The Hardness of K-means Clustering Department of Computer Science and Engineering, University of California, San Diego, 2008 - 6 Seiten We show that k-means clustering is an NP-hard optimization problem, even if k is fixed to 2. |
The Hardness of K-means ClusteringDepartment of Computer Science and Engineering, University of California, San Diego, 2008 - 6 Seiten We show that k-means clustering is an NP-hard optimization problem, even if k is fixed to 2. |