Density-Based Clustering Based on Hierarchical Density Estimates¶
Authors: Ricardo J. G. B. Campello, Davoud Moulavi, Joerg Sander
Published: 2013 (Conference Paper)
Source: Lecture Notes in Computer Science
Algorithm: HDBSCAN
DOI: 10.1007/978-3-642-37456-2_14
Summary¶
Abstract¶
We propose a theoretically and practically improved density-based, hierarchical clustering method, providing a clustering hierarchy from which a simplified tree of significant clusters can be constructed. For obtaining a “flat” partition consisting of only the most significant clusters (possibly corresponding to different density thresholds), we propose a novel cluster stability measure, formalize the problem of maximizing the overall stability of selected clusters, and formulate an algorithm that computes an optimal solution to this problem. We demonstrate that our approach outperforms the current, state-of-the-art, density-based clustering methods on a wide variety of real world data.