NP-hardness of Euclidean sum-of-squares clustering
Top Cited Papers
- 24 January 2009
- journal article
- Published by Springer Science and Business Media LLC in Machine Learning
- Vol. 75 (2), 245-248
- https://doi.org/10.1007/s10994-009-5103-0
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Online clustering of parallel data streamsData & Knowledge Engineering, 2006
- The Effectiveness of Lloyd-Type Methods for the k-Means ProblemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- On the Complexity of Several Haplotyping ProblemsLecture Notes in Computer Science, 2005
- Clustering Large Graphs via the Singular Value DecompositionMachine Learning, 2004
- Sparsest cuts and bottlenecks in graphsDiscrete Applied Mathematics, 1990