Abstract

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

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.