arXiv · 0907.3454
Generalized density clustering
Abstract
We study generalized density-based clustering in which sharply defined clusters such as clusters on lower-dimensional manifolds are allowed. We show that accurate clustering is possible even in high dimensions. We propose two data-based methods for choosing the bandwidth and we study the stability properties of density clusters. We show that a simple graph-based algorithm successfully approximates the high density clusters.
Explore related subjects
Keep this discovery
Alessandro Rinaldo, Larry Wasserman. 2009-07-20. Generalized density clustering. https://doi.org/10.1214/10-aos797
Cite the original work for its findings. Save a collection to share your selection of sources.