Streaming k-means on well-clusterable data

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 26-40

  Braverman, Vladimir ^a   Meyerson, Adam ^a   Ostrovsky, Rafail ^b   Roytman, Alan ^a   Shindler, Michael ^a   Tagiku, Brian ^a  

^a University of California   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; CLUSTER ANALYSIS; POLYNOMIAL APPROXIMATION;

APPROXIMATION METHODS; CLUSTERING PROBLEMS; EXPONENTIAL DEPENDENCE; FACILITY LOCATIONS; HIGH-DIMENSIONAL; MEANS CLUSTERING; NOVEL TECHNIQUES; RESAMPLING METHOD;

K-MEANS CLUSTERING;

EID: 79955707875     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.3     Document Type: Conference Paper

References (38)

1. Nir Ailon, Ragesh Jaiswal, and Claire Monteleoni. Streaming k-means approximation. In NIPS, 2009.
2. Khaled Alsabti, Sanjay Ranka, and Vineet Singh. An efficient k-means clustering algorithm. In Proc. 1st Workshop on High Performance Data Mining, 1998.
3. David Arthur and Sergei Vassilvitskii. How Slow is the k-means Method? In SCG, 2006.
4. David Arthur and Sergei Vassilvitskii. k-means++: The Advantages of Careful Seeding. In SODA, 2007.
5. 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.
6. Mihai Bādoiu, Sariel Har-Peled, and Piotr Indyk. Approximate clustering via core-sets. In STOC, 2002.
7. Maria-Fiorina Balean, Avrim Blum, and Anupam Gupta. Approximate clustering without the approximation. In SODA, 2009.
8. Geoffrey H. Ball. Data analysis in the social sciences: what about the details? In AFIPS'65 (Fall, part I): Proceedings of the November 30-December 1, 1965, fall joint computer conference, part I, pages 533-559, New York, NY, USA, 1965. ACM.
9. Moses Charikar, Liadan O'Callaghan, and Rina Pani-grahy. Better streaming algorithms for clustering problems. In STOC, 2003.
10. Ke Chen. On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications. SIAM J. Comput., 2009.
11. Arthur Pentland Dempster, Nan McKenzie Laird, and Donald Bruce Rubin. Maximum likelihood from incomplete data via the EM algorithm (with discussion). Journal of the Royal Statistical Society. Series B (Methodological), 39:1-38, 1977.
12. Dan Feldman, Morteza Monemizadeh, and Christian Sohler. A PTAS for k-means clustering based on weak coresets. In SCG, 2007.
13. Walter D. Fisher. On grouping for maximum homogeneity. Journal of the American Statistical Association, 53:789-798, 1958.
14. Edward Forgey. Cluster analysis of multivariate data: efficiency vs. interpretability of classification. Biometrics, 21:768, 1965.
15. Gereon Frahling and Christian Sohler. Coresets in dynamic geometric data streams. In STOC, 2005.
16. Allen Gersho and Robert M. Gray. Vector quantization and signal compression. Kluwer, 1992.
17. Robert M. Gray and David L. Neuhoff. Quantization. IEEE Transactions on Information Theory, 44(6):2325-2384, October 1998. (Pubitemid 128741893)
18. Sudipto Guha, Adam Meyerson, Nina Mishra, Rajeev Motwani, and Liadan O'Callaghan. Clustering data streams: Theory and practice. In IEEE Tansactions on Data and Knowledge Engineering (TDKE), 2003.
19. Sudipto Guha, Nina Mishra, Rajeev Motwani, and Liadan O'Callaghan. Clustering data streams. In FOCS, 2000.
20. David J. Hall and Geoffrey H. Ball. ISODATA: a novel method of data analysis and pattern classification. Technical report, Stanford Research Institute, 1965.
21. Sariel Har-Peled and Soham Mazumdar. On coresets for k-means and k-median clustering. In STOC'04, pages 291-300, New York, NY, USA, 2004. ACM.
22. Anil Kumar Jain, M Narasimha Murty, and Patrick Joseph Flynn. Data clustering: a review. ACM Computing Surveys, 31(3), September 1999.
23. Robert C. Jancey. Multidimensional group analysis. Australian Journal of Botany, 14:127-130, 1966.
24. W. Johnson and J. Lindenstrauss. Extensions of Lipschitz maps into a Hilbert space. In Contemporary Mathematics, 1984.
25. 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.
26. Yoseph Linde, Andres Buzo, and Robert M. Gray. An algorithm for vector quantization design. IEEE Transactions on Communication, COM-28:84-95, January 1980.
27. Stuart Lloyd. Least Squares Quantization in PCM. In Special issue on quantization, IEEE Transactions on Information Theory, volume 28, pages 129-137, 1982.
28. James MacQueen. Some methods for classification and analysis of multivariate observations. In Proc. 5th Berkeley Symp. on Math. Statistics and Probability, pages 281-297, 1967.
29. Joel Max. Quantizing for minimum distortion. IEEE Transactions on Information Theory, 1960.
30. Adam Meyerson. Online facility location. In FOCS, 2001.
31. Rafail Ostrovsky, Yuval Rabani, Leonard Schulman, and Chaitanya Swamy. The Effectiveness of Lloyd-Type Methods for the k-Means Problem. In FOCS, 2006.
32. Dan Pelleg and Andrew Moore. Accelerating exact k-means algorithms with geometric reasoning. In Proc. 5th ACM KDD, pages 277-281, 1999.
33. Steven J. Phillips. Acceleration of k-means and related clustering problems. In ALENEX, 2002.
34. Hugo Steinhaus. Sur la division des corp materiels en parties. Bull. Acad. Polon. Sci., Cl. Ill vol IV:801-804, 1956.
35. Laszlo Fejes Toth. Sur la representation d'une population infinie par un nombre fini d'elements. Acta math. Acad. Sci. Hung., 10:76-81, 1959.
36. Robert Choate Tryon and Daniel Edgar Bailey. Cluster Analysis. McGraw-Hill, 1970. Pages 147-150.
37. Jeffrey S. Vitter. Random sampling with a reservoir. In ACM Transactions on Mathematical Software, 1985.
38. Paul L. Zador. Development and evaluation of procedures for quantizing multivariate distributions. PhD thesis, Stanford University, 1963. Stanford University Department of Statistics Technical Report.