Fast and accurate κ-means for large datasets

Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011

Volumn , Issue , 2011, Pages

  Shindler, Michael ^a   Wong, Alex ^b   Meyerson, Adam ^c  

^a OREGON STATE UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; NEAREST NEIGHBOR SEARCH;

APPROXIMATE NEAREST NEIGHBOR SEARCH; CLUSTERINGS; CONSTANT FACTORS; DATAPOINTS; K-MEANS; LARGE DATASETS; MAIN-MEMORY; MEMORY REQUIREMENTS; NUMBER OF DATUM; RUNNING TIME;

APPROXIMATION ALGORITHMS;

EID: 85162439676     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. http://www.cs.uni-paderborn.de/en/fachgebiete/ag-bloemer/research/ clustering/streamkmpp.
2. Marcel R. Ackermann, Christian Lammersen, Marcus Märtens, Christoph Raupach, Christian Sohler, and Kamil Swierkot. StreamKM++: A clustering algorithms for data streams. In ALENEX, 2010.
3. Charu C. Aggarwal, editor. Data Streams: Models and Algorithms. Springer, 2007.
4. Nir Ailon, Ragesh Jaiswal, and Claire Monteleoni. Streaming k-means approximation. In NIPS, 2009.
5. Khaled Alsabti, Sanjay Ranka, and Vineet Singh. An efficient k-means clustering algorithm. In HPDM, 1998.
6. Alexandr Andoni and Piotr Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM, January 2008.
7. David Arthur and Sergei Vassilvitskii. k-means++: The Advantages of Careful Seeding. In SODA, 2007.
8. Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, and Vinayaka Pandit. Local search heuristic for k-median and facility location problems. In STOC, 2001.
9. Vladimir Braverman, Adam Meyerson, Rafail Ostrovsky, Alan Roytman, Michael Shindler, and Brian Tagiku. Streaming k-means on Well-Clusterable Data. In SODA, 2011.
10. Mihai Badoiu, Sariel Har-Peled, and Piotr Indyk. Approximate clustering via core-sets. In STOC, 2002.
11. Moses Charikar, Liadan O'Callaghan, and Rina Panigrahy. Better streaming algorithms for clustering problems. In STOC, 2003.
12. Ke Chen. On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications. SIAM J. Comput., 2009.
13. Dan Feldman, Morteza Monemizadeh, and Christian Sohler. A PTAS for k-means clustering based on weak coresets. In SCG, 2007.
14. Gereon Frahling and Christian Sohler. Coresets in dynamic geometric data streams. In STOC, 2005.
15. A. Frank and A. Asuncion. UCI machine learning repository, 2010.
16. Sudipto Guha, Adam Meyerson, Nina Mishra, Rajeev Motwani, and Liadan O'Callaghan. Clustering data streams: Theory and practice. In TDKE, 2003.
17. Sudipto Guha, Nina Mishra, Rajeev Motwani, and Liadan O'Callaghan. Clustering data streams. In FOCS, 2000.
18. Sariel Har-Peled and Soham Mazumdar. On coresets for k-means and k-median clustering. In STOC, 2004.
19. Anil Kumar Jain, M Narasimha Murty, and Patrick Joseph Flynn. Data clustering: a review. ACM Computing Surveys, 31(3), September 1999.
20. Tapas Kanungo, David Mount, Nathan Netanyahu, Christine Piatko, Ruth Silverman, and Angela Wu. A local search approximation algorithm for k-means clustering. In SCG, 2002.
21. Stuart Lloyd. Least Squares Quantization in PCM. In Special issue on quantization, IEEE Transactions on Information Theory, 1982.
22. James MacQueen. Some methods for classiication and analysis of multivariate observations. In Berkeley Symposium on Mathematical Statistics and Probability, 1967.
23. Joel Max. Quantizing for minimum distortion. IEEE Transactions on Information Theory, 1960.
24. Adam Meyerson. Online facility location. In FOCS, 2001.
25. Rafail Ostrovsky, Yuval Rabani, Leonard Schulman, and Chaitanya Swamy. The Effectiveness of Lloyd-Type Methods for the k-Means Problem. In FOCS, 2006.
26. Rina Panigrahy. Entropy based nearest neighbor search in high dimensions. In SODA, 2006.
27. Dan Pelleg and Andrew Moore. Accelerating exact k-means algorithms with geometric reasoning. In KDD, 1999.
28. Steven J. Phillips. Acceleration of k-means and related clustering problems. In ALENEX, 2002.
29. Andrea vattani. k-means requires exponentially many iterations even in the plane. Disc ete Computational Geometry, June 2011.