The Planar k-Means Problem is NP-Hard-Reference-Cited by-同舟云学术

The Planar k-Means Problem is NP-Hard

Published:2009 Issue: Volume: Page:274-285
ISSN:0302-9743
Container-title:WALCOM: Algorithms and Computation
language:
Short-container-title:

Author:

Mahajan Meena,Nimbhorkar Prajakta,Varadarajan Kasturi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-00202-1_24

Reference19 articles.

1. Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-Hardness of Euclidean Sum-of-Squares Clustering. Technical Report G-2008-33, Les Cahiers du GERAD (to appear in Machine Learning) (April 2008)

2. Lecture Notes in Computer Science;E. Allender,2005

3. Arthur, D., Vassilvitskii, S.: Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method. In: Proc. IEEE Symp. Foundations of Computer Science (2006)

4. Arthur, D., Vassilvitskii, S.: How slow is the k-means method? In: Proc. Symp. on Comput. Geom. (2006)

5. Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding. In: Proc. ACM-SIAM Symp. Discrete Algorithms (2007)

Cited by 185 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Algorithm for the $k$-Means Problem with Must-Link and Cannot-Link Constraints;Tsinghua Science and Technology;2023-12

2. Privacy-Preservation for Distributed Quantized k-means Clustering;2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton);2023-09-26

3. Stop using the elbow criterion for k-means and how to choose the number of clusters instead;ACM SIGKDD Explorations Newsletter;2023-06-22

4. Fast computation of cluster validity measures for bregman divergences and benefits;Pattern Recognition Letters;2023-06

5. Speedup of the k-Means Algorithm for Partitioning Large Datasets of Flat Points by a Preliminary Partition and Selecting Initial Centroids;Applied Computer Systems;2023-06-01