article Open AccessTop 1% cited
NP-hardness of Euclidean sum-of-squares clustering
Machine Learning · 2009 · Vol. 75(2) · pp. 245–248
Daniel Aloise✉(Polytechnique Montréal)Amit Deshpande(Microsoft (United States))Pierre Hansen(Group for Research in Decision Analysis)Preyas Popat(Chennai Mathematical Institute)
Algorithms and Data CompressionAdvanced Clustering Algorithms ResearchData Management and AlgorithmsCluster analysisMathematicsEuclidean distanceExplained sum of squaresEuclidean geometryCombinatoricsPattern recognition (psychology)Artificial intelligenceComputer scienceStatistics
Citations
852
FWCI
41.73
field-weighted impact
References
14
Percentile
100%
vs. same field & year
Citations per year
Cited by
A comparative study of efficient initialization methods for the k-means clustering algorithm
Expert Systems with Applications · 2012 · 1,182 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.