Stability of Density-Based Clustering

Details Stability of Density-Based Clustering Stability of Density-Based Clustering

2010-11-11

arxiv.org/abs/1011.2771v1

Statistics

Machine Learning

Scientific paper

High density clusters can be characterized by the connected components of a level set $L(\lambda) = \{x:\ p(x)>\lambda\}$ of the underlying probability density function $p$ generating the data, at some appropriate level $\lambda\geq 0$. The complete hierarchical clustering can be characterized by a cluster tree ${\cal T}= \bigcup_{\lambda} L(\lambda)$. In this paper, we study the behavior of a density level set estimate $\widehat L(\lambda)$ and cluster tree estimate $\widehat{\cal{T}}$ based on a kernel density estimator with kernel bandwidth $h$. We define two notions of instability to measure the variability of $\widehat L(\lambda)$ and $\widehat{\cal{T}}$ as a function of $h$, and investigate the theoretical properties of these instability measures.

Affiliated with

Also associated with

No associations

Rating

Stability of Density-Based Clustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stability of Density-Based Clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stability of Density-Based Clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-203029