On the limits of clustering in high dimensions via cost functions

DOI10.1002/SAM.10095MaRDI QIDQ4969748zbMATH OpenOpenAlexFDO

Authors Hoyt A. Koepke, Bertrand S. Clarke

Publication date 14 October 2020

Published in Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/sam.10095

zbMATH Keywords

cost functionhigh dimensionsVC-dimensionclustering impossibility

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 5957308 (Why is no real title available?)
• scientific article; zbMATH DE number 893887 (Why is no real title available?)
• A graph-based estimator of the number of clusters
• Estimating the number of clusters in a data set via the gap statistic
• Feature selection for unsupervised learning
• Geometric Representation of High Dimension, Low Sample Size Data
• Impossibility of successful classification when useful features are rare and weak
• Matrix Analysis
• Nemirovski's inequalities revisited
• On the Performance of Clustering in Hilbert Spaces
• Refinement of the upper bound of the constant in the central limit theorem
• Some theory for Fisher's linear discriminant function, `naive Bayes', and some alternatives when there are many more variables than observations
• The remarkable simplicity of very high dimensional data: application of model-based clustering
• Uniform Central Limit Theorems
• Weak convergence and empirical processes. With applications to statistics

Cited in

(1)

• scientific article; zbMATH DE number 6850339 (Why is no real title available?)

This page was built for publication: On the limits of clustering in high dimensions via cost functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969748)