Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions

DOI10.1109/TIT.2011.2104630zbMath1366.62117arXiv0909.2353MaRDI QIDQ5281049

Ery Arias-Castro

Publication date: 27 July 2017

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

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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90)

Related Items (11)

Balancing Geometry and Density: Path Distances on High-Dimensional Data ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Diffusion \(K\)-means clustering on manifolds: provable exact recovery via semidefinite relaxations ⋮ Spectral clustering based on local linear approximations ⋮ Unnamed Item ⋮ Robust subspace clustering ⋮ On clustering procedures and nonparametric mixture estimation ⋮ The shape of data and probability measures ⋮ A multiscale environment for learning by diffusion ⋮ Statistical analysis of a hierarchical clustering algorithm with outliers

This page was built for publication: Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions