Adaptive sampling for k-means clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5687 LNCS, Issue , 2009, Pages 15-28

  Aggarwal, Ankit ^a   Deshpande, Amit ^b   Kannan, Ravi ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SAMPLING; BI-CRITERIA; CHARIKAR; CONSTANT FACTOR APPROXIMATION; CONSTANT FACTORS; K-CENTER; K-MEANS; K-MEANS CLUSTERING;

COMBINATORIAL OPTIMIZATION; TECHNICAL PRESENTATIONS;

APPROXIMATION ALGORITHMS;

EID: 70449722914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_2     Document Type: Conference Paper

References (24)

1. [ADHP09] Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Machine Learning 75(2), 245-248 (2009)
2. [AMR09] Arthur, D., Manthey, B., Röglin, H.: k-means has polynomial smoothed complexity (2009), http://arxiv.org/abs/0904.1113
3. [AV06] Arthur, D., Vassilvitskii, S.: How slow is the k-means method?. In: Annual Symposium on Computational Geometry (SOCG) (2006)
4. [AV07] Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding. In: ACM-SIAM Symposium on Discrete Algorithms (SODA) (2007)
5. [CGTS02] Charikar, M., Guha, S., Tardos, M., Shmoys, D.: A constant factor approximation for the k-median problem. Journal of Computer and System Sciences (2002)
6. [Che09] Chen, K.: On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications. Submitted to SIAM Journal on Computing (SICOMP) (2009)
7. [COP03] Charikar, M., O'Callaghan, L., Panigrahy, R.: Better streaming algorithms for clustering problems. In: ACM Symposium on Theory of Computing (STOC), pp. 30-39 (2003)
8. [Das08] Dasgupta, S.: The hardness of k-means clustering, Tech. Report CS2008-0916, UC San Diego (2008)
9. [dlVKKR03] de la Vega, F., Karpinski, M., Kenyon, C., Rabani, Y.: Approximation schemes for clustering problems. In: ACM Symposium on Theory of Computing (STOC), pp. 50-58. ACM Press, New York (2003)
10. [GI03] Guruswami, V., Indyk, P.: Embeddings and non-approximability of geometric problems. In: ACM-SIAM Symposium on Discrete Algorithms (SODA) (2003)
11. [GMM+03] Guha, S., Meyerson, A., Mishra, N., Motwani, R., O'Callaghan, L.: Clustering data streams: Theory and practice. IEEE Transactions on Knowledge and Data Engineering 15(3), 515-528 (2003)
12. [Gon85] Gonzalez, T.: Clustering to minimize the maximum intercluster distance. Theoretical Computer Science 38, 293-306 (1985)
13. [HPM04] Har-Peled, S., Mazumdar, S.: On core-sets for k-means and k-median clustering. In: ACM Symposium on Theory of Computing (STOC), pp. 291-300 (2004)
14. [JV01] Jain, K., Vazirani, V.: Approximation algorithms for metric facility loca- tion and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of ACM 48, 274-296 (2001)
15. [KMN+04] Kanugo, T., Mount, D., Netanyahu, N., Piatko, C., Silverman, R., Wu, A.: A local search approximation algorithm for k-means clustering. Computational Geometry 28(2-3), 89-112 (2004)
16. [KNV08] Kanade, G., Nimbhorkar, P., Varadarajan, K.: On the NP-hardness of the 2-means problem (unpublished manuscript) (2008)
17. [KSS04] Kumar, A., Sabharwal, Y., Sen, S.: A simple linear time (1 + ε)- approximation algorithm for k-means clustering in any dimensions. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 454-462 (2004)
18. [Llo82] Lloyd, S.: Least squares quantization in pcm. IEEE Transactions on Information Theory 28(2), 129-136 (1982)
19. [Mat00] Matoušek, J.: On approximate geometric k-clustering. Discrete and Computational Geometry 24(1), 61-84 (2000)
20. [Mey01] Meyerson, A.: Online facility location. In: IEEE Symposium on Foundations of Computer Science (FOCS) (2001)
21. [MNV09] Mahajan, M., Nimbhorkar, P., Varadarajan, K.: The planar k-means problem is NP-hard. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 274-285. Springer, Heidelberg (2009)
22. [MP02] Mettu, R., Plaxton, C.: Optimal time bounds for approximate clustering. Machine Learning, 344-351 (2002)
23. [ORSS06] Ostrovsky, R., Rabani, Y., Schulman, L., Swamy, C.: The effectiveness of Lloyd-type methods for the k-means problem. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 165-176 (2006)
24. [Vat09] Vattani, A.: k-means requires exponentially many iterations even in the plane. In: Annual Symposium on Computational Geometry (SOCG) (2009)