Clustering Methods: A History of k-Means Algorithms

DOI10.1007/978-3-540-73560-1_15zbMath1181.68229OpenAlexW35739717MaRDI QIDQ5302504

Hans-Hermann Bock

Publication date: 7 January 2009

Published in: Selected Contributions in Data Analysis and Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73560-1_15

zbMATH Keywords

data analysiscluster analysis

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10)

Related Items (8)

Partition of interval-valued observations using regression ⋮ A fast algorithm for robust constrained clustering ⋮ The \(k\)-means algorithm for 3D shapes with an application to apparel design ⋮ Unsupervised classification of children's bodies using currents ⋮ Also for \(k\)-means: more data does not imply better performance ⋮ Cross-entropy clustering ⋮ Data-driven modeling of the temporal evolution of breakers' states in the French electrical transmission grid ⋮ Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads

This page was built for publication: Clustering Methods: A History of k-Means Algorithms