Significant DBSCAN+: Statistically Robust Density-based Clustering
- University of Maryland, College Park, MD
- University of Pittsburgh, S. Bouquet Street Pittsburgh, PA
- University of Minnesota, Minneapolis, MN
- University of Iowa, Iowa City, IA
Cluster detection is important and widely used in a variety of applications, including public health, public safety, transportation, and so on. Given a collection of data points, we aim to detect density-connected spatial clusters with varying geometric shapes and densities, under the constraint that the clusters are statistically significant. The problem is challenging, because many societal applications and domain science studies have low tolerance for spurious results, and clusters may have arbitrary shapes and varying densities. As a classical topic in data mining and learning, a myriad of techniques have been developed to detect clusters with both varying shapes and densities (e.g., density-based, hierarchical, spectral, or deep clustering methods). However, the vast majority of these techniques do not consider statistical rigor and are susceptible to detecting spurious clusters formed as a result of natural randomness. On the other hand, scan statistic approaches explicitly control the rate of spurious results, but they typically assume a single “hotspot” of over-density and many rely on further assumptions such as a tessellated input space. To unite the strengths of both lines of work, we propose a statistically robust formulation of a multi-scale DBSCAN, namely Significant DBSCAN+, to identify significant clusters that are density connected. As we will show, incorporation of statistical rigor is a powerful mechanism that allows the new Significant DBSCAN+ to outperform state-of-the-art clustering techniques in various scenarios. We also propose computational enhancements to speed-up the proposed approach. Experiment results show that Significant DBSCAN+ can simultaneously improve the success rate of true cluster detection (e.g., 10–20% increases in absolute F1 scores) and substantially reduce the rate of spurious results (e.g., from thousands/hundreds of spurious detections to none or just a few across 100 datasets), and the acceleration methods can improve the efficiency for both clustered and non-clustered data.
- Research Organization:
- Univ. of Minnesota, Minneapolis, MN (United States)
- Sponsoring Organization:
- USDOE Advanced Research Projects Agency - Energy (ARPA-E)
- DOE Contract Number:
- AR0000795
- OSTI ID:
- 1980836
- Journal Information:
- ACM Transactions on Intelligent Systems and Technology, Vol. 12, Issue 5; ISSN 2157-6904
- Publisher:
- Association for Computing Machinery (ACM)
- Country of Publication:
- United States
- Language:
- English
Similar Records
The Application of the OPTICS Algorithm to Cluster Analysis in Atom Probe Tomography Data
Blind chemical tagging with DBSCAN: prospects for spectroscopic surveys