Timezone: »

Rates of convergence for the cluster tree
Kamalika Chaudhuri · Sanjoy Dasgupta

Wed Dec 08 12:00 AM -- 12:00 AM (PST) @

For a density f on R^d, a high-density cluster is any connected component of {x: f(x) >= c}, for some c > 0. The set of all high-density clusters form a hierarchy called the cluster tree of f. We present a procedure for estimating the cluster tree given samples from f. We give finite-sample convergence rates for our algorithm, as well as lower bounds on the sample complexity of this estimation problem.

Author Information

Kamalika Chaudhuri (UCSD)
Sanjoy Dasgupta (UC San Diego)

More from the Same Authors