P-DBSCAN: A density based clustering algorithm for exploration and analysis of attractive areas using collections of geo-tagged photos
The rapid spread of location-based devices and cheap storage mechanisms, as well as fast development of Internet technology, allowed collection and distribution of huge amounts of user-generated data, such as people’s movement or geo-tagged photos. These types of data produce new challenges for research in different application domains. In many cases, new algorithms should be devised to better portray the phenomena under investigation. In this paper, we present P-DBSCAN, a new density-based clustering algorithm based on DBSCAN for analysis of places and events using a collection of geo-tagged photos. We thereby introduce two new concepts: (1) density threshold, which is defined according to the number of people in the neighborhood, and (2) adaptive density, which is used for fast convergence towards high density regions. Our approach is demonstrated on the area of Washington, D.C.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Scalable Density-based Clustering with Random Projections
We present sDBSCAN, a scalable density-based clustering algorithm in high dimensions with cosine distance. Utilizing the neighborhood-preserving property of random projections, sDBSCAN can quickly identify core points an…
ClusteringRNN-DBSCAN: A Density-Based Clustering Algorithm Using Reverse Nearest Neighbor Density Estimates
A new density-based clustering algorithm, RNN-DBSCAN, is presented which uses reverse nearest neighbor counts as an estimate of observation density. Clustering is performed using a DBSCAN-like approach based on k nearest…
3D Multi-Person Pose Estimation (absolute)ClusteringAccelerated Hierarchical Density Clustering
We present an accelerated algorithm for hierarchical density based clustering. Our new algorithm improves upon HDBSCAN*, which itself provided a significant qualitative improvement over the popular DBSCAN algorithm. The …
ClusteringLinear density-based clustering with a discrete density model
Density-based clustering techniques are used in a wide range of data mining applications. One of their most attractive features con- sists in not making use of prior knowledge of the number of clusters that a dataset con…
ClusteringPersistent Multiscale Density-based Clustering
Clustering is a cornerstone of modern data analysis. Detecting clusters in exploratory data analyses (EDA) requires algorithms that make few assumptions about the data. Density-based clustering algorithms are particularl…