Concentration of measure and cluster analysis.

DOI10.1016/J.SPL.2003.07.001zbMath1116.60301OpenAlexW2047020567MaRDI QIDQ1423105

Daniel Z. Zanger

Publication date: 14 February 2004

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2003.07.001

zbMATH Keywords

Asymptotic analysis of algorithmsClustering methodsMeasure concentration

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Probabilistic measure theory (60A10)

Related Items (3)

Talagrand's inductive method and isoperimetric inequalities involving random sets ⋮ New instability results for high-dimensional nearest neighbor search ⋮ Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data

Uses Software

• ElemStatLearn

Cites Work

• On the geometry of similarity search: dimensionality curse and concentration of measure
• Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
• Concentration of measure and isoperimetric inequalities in product spaces
• The elements of statistical learning. Data mining, inference, and prediction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Concentration of measure and cluster analysis.