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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.