Stability of Density-Based Clustering
Machine Learning
2010-11-15 v1 Statistics Theory
Statistics Theory
Abstract
High density clusters can be characterized by the connected components of a level set of the underlying probability density function generating the data, at some appropriate level . The complete hierarchical clustering can be characterized by a cluster tree . In this paper, we study the behavior of a density level set estimate and cluster tree estimate based on a kernel density estimator with kernel bandwidth . We define two notions of instability to measure the variability of and as a function of , and investigate the theoretical properties of these instability measures.
Keywords
Cite
@article{arxiv.1011.2771,
title = {Stability of Density-Based Clustering},
author = {Alessandro Rinaldo and Aarti Singh and Rebecca Nugent and Larry Wasserman},
journal= {arXiv preprint arXiv:1011.2771},
year = {2010}
}