Consistent Procedures for Cluster Tree Estimation and Pruning

DOI10.1109/TIT.2014.2361055zbMath1359.62234arXiv1406.1546OpenAlexW2007077266MaRDI QIDQ2979179

Sanjoy Dasgupta, Samory Kpotufe, Kamalika Chaudhuri, Ulrike von Luxburg

Publication date: 2 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.1546

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Information theory (general) (94A15)

Related Items (10)

Automatic topography of high-dimensional data sets by non-parametric density peak clustering ⋮ DBSCAN: Optimal Rates For Density Based Clustering ⋮ Consistency of the \(k\)-nearest neighbors rule for functional data ⋮ Hellinger–Kantorovich barycenter between Dirac measures ⋮ Moving Up the Cluster Tree with the Gradient Flow ⋮ QuickDSC: clustering by quick density subgraph estimation ⋮ Multiscale inference for a multivariate density with applications to X-ray astronomy ⋮ Nonlocal-interaction equation on graphs: gradient flow structure and continuum limit ⋮ Barycenters for the Hellinger--Kantorovich Distance Over $\mathbb{R}^d$ ⋮ Generalized cluster trees and singular measures

This page was built for publication: Consistent Procedures for Cluster Tree Estimation and Pruning