资源分类
》 资源 》论文》Rates of convergence for the cluster tree

Rates of convergence for the cluster tree

2020-01-06 | |  84 |   45 |   0

Abstract

For a density f on Rd , a high-density cluster is any connected component of {x : 图片.pngThe 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.

上一篇：A primal-dual algorithm for group sparse regularization with overlapping groups

下一篇：Link Discovery using Graph Feature Tracking Emile Richard

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...