Rates of convergence for the cluster tree
Rates of convergence for the cluster tree
复制标题
DOI：
--
复制
发表时间：
2010-12
期刊：
影响因子：
--
通讯作者：
Kamalika Chaudhuri;S. Dasgupta
中科院分区：
文献类型：
--
作者：
Kamalika Chaudhuri;S. Dasgupta
对于ℝd的密度f，对于{x：f（x）≥λ}的任何连接组件，对于某些λ<0。 f，我们提出了一个估计f给定样品的过程，我们为我们的算法提供了有限样本的收敛速率，以及此估计问题的样本复杂性的下限。
For a density f on ℝd, a high-density cluster is any connected component of {x : f(x) ≥ λ}, for some λ < 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.