Fast and exact out-of-core K-means clustering

Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

Volumn , Issue , 2004, Pages 83-90

  Goswami, Anjan ^a   Jin, Ruoming ^a   Agrawal, Gagan ^a  

^a Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DATA CLUSTERING; DATA SETS; FAST AND EXACT K-MEANS (FEKM);

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER HARDWARE; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; RANDOM PROCESSES; VECTORS;

DATA MINING;

EID: 19544377164     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2004.10102     Document Type: Conference Paper

References (17)

1. Mihai Badoiu, Sariel Har-Pelad, and Piotr Indyk. Approximate clustering via core-sets. In Proceedings of the Annual ACM Symposium on Theory of Computing, 2002.
2. Pavel Berkhin. Survey of clustering data mining techniques. Technical report, Accrue Software, 2002.
3. Leon Bottou and Yoshua Bengio. Convergence properties of the K-means algorithms. In G. Tesauro, D. Tburetzky, and T. Leen, editors, Advances in Neural Information Processing Systems, volume 7, pages 585-592. The MIT Press, 1995.
4. P. S. Bradley, Usama Fayyad, and Cory Reina. Scaling clustering algorithms to large databases. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, August 1998.
5. Moses Charikar, Liadan O'Callaghan, and Rina Panigrahi. Better streaming algorithms for clustering problems. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003.
6. Moses Cherikar, Chandra Chekuri, Tomas Feder, and Rajeev Motwani. Incremental clustering and dynamic information retrieval. In Proceedings of Symposium of Theory of Computing, 1997.
7. Pedro Domingos and Geoff Hulten. A general method for scaling up machine learning algorithms and its application to clustering. In Proceedings of the Eighteenth International Conference on Machine Learning, 2001.
8. Fredrik Farnstrom, James Lewis, and Charles Elkan. Scalability for clustering algorithms revisited. SIGKDD Explorations, 2(1):51-57, 2000.
9. Joydeep Ghosh. Scalable clustering methods for data mining. In Nong Ye, editor, Handbook of Data Mining, chapter 10, pages 247-277. Lawrence Ealbaum Assoc, 2003.
10. Sudipto Guha, Adam Meyerson, Nina Mishra, Rajeev Motwani, and Liadan O'Callaghan. Clustering data streams: Theory and practice. IEEE Transactions on Knowledge and Data Engineering, 15(3):515-528, May 2003.
11. Jiawei Han and Micheline Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2000.
12. J. A. Hartigan and M. A. Wong. A k-means clustering algorithm. Applied Statistics, (28):100-108, 1979.
13. Anil K. Jain and Richard C. Dubes. Algorithms for Clustering Data. Prentice-Hall International, 1988.
14. J. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, volume 1, pages 281-297, 1967.
15. Silvia Nittel, Kelvin T. Leung, and Amy Braverman. Scaling clustering algorithms for massive data sets using data stream. In Umeshwar Dayal, Krithi Ramamritham, and T. M. Vijayaraman, editors, Proceedings of the 19th International Conference on Data Engineering, March 5-8, 2003, Bangalore, India. IEEE Computer Society, 2003.
16. Liadan OCallaghan, Nina Mishra, Adam Meyerson, Sudipto Guha, and Rajeev Motwani. Streaming-data algorithms for high-quality clustering. In Proceedings of International Conference of Data Engineering, 2002.
17. Dan Pelleg and Andrew Moore. Accelerating exact k-means algorithms with geometric reasoning. In In Proceedings of Fifth International Conference of Knowledge Discovery and Data Mining, pages 277-281, 1999.