On the quality of k-means clustering based on grouped data

DOI10.1016/J.JSPI.2009.05.021MaRDI QIDQ840740zbMATH OpenOpenAlexFDO

Authors Meelis Käärik, K. Pärna

Publication date 14 September 2009

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jspi.2009.05.021

zbMATH Keywords

Lloyd's algorithmloss-functionVoronoi partitions

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• On variants of \(k\)-means clustering
• On the number of groups in clustering
• Some refinements of rough \(k\)-means clustering
• Candidate groups search for K-harmonic means data clustering
• scientific article; zbMATH DE number 2222601
• scientific article; zbMATH DE number 2170297
• Application of \(K\)-means theory based on data
• A \(K\)-means clustering algorithm based distance concentration
• On the discrepancy between Kleinberg's clustering axioms and \(k\)-means clustering algorithm behavior
• Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions

Cites work

• scientific article; zbMATH DE number 1433402 (Why is no real title available?)
• Foundations of quantization for probability distributions
• Least squares quantization in PCM
• Principal points
• Probabilistic models in cluster analysis
• Quantization
• Strong consistency of k-means clustering
• The strong law of large numbers for k-means and best possible nets of Banach valued random variables

Cited in

(3)

• Quantization/clustering: when and why does \(k\)-means work?
• Candidate groups search for K-harmonic means data clustering
• Geometry-inference based clustering heuristic: new \(k\)-means metric for Gaussian data and experimental proof of concept

This page was built for publication: On the quality of \(k\)-means clustering based on grouped data

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