Space partitioning for scalable K-means

Proceedings - 9th International Conference on Machine Learning and Applications, ICMLA 2010

Volumn , Issue , 2010, Pages 319-324

  Pettinger, David ^a   Di Fatta, Giuseppe ^a  

^a UNIVERSITY OF READING   (United Kingdom)

Author keywords

Clustering; K means; Space partitioning trees

Indexed keywords

BINARY SEARCH TREES; BINARY SPACE PARTITIONING; BINARY SPACE PARTITIONING TREES; BRUTE FORCE; CLUSTERING; DATA PARTITION; DATA POINTS; DISTANCE COMPUTATION; EFFICIENT DATA STRUCTURES; EFFICIENT IMPLEMENTATION; EXPERIMENTAL ANALYSIS; EXPERIMENTAL TEST; GEOMETRICAL CONSTRAINTS; HIERARCHICAL CLUSTERING METHODS; HIGH DIMENSIONAL SPACES; ITERATIVE REFINEMENT; K-D TREE; K-MEANS; K-MEANS ALGORITHM; OTHER ALGORITHMS; PROXIMITY MEASURE; SPACE PARTITIONING; SPACE PARTITIONING TREES;

BINARY TREES; CLUSTER ANALYSIS; ITERATIVE METHODS; LEARNING SYSTEMS; PARTITIONS (BUILDING); TREES (MATHEMATICS);

CLUSTERING ALGORITHMS;

EID: 79952387634     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLA.2010.46     Document Type: Conference Paper

References (16)

1. J. B. MacQueen, "Some methods for classification and analysis of multivariate observations," in Proc. of the fifth Berkeley Symposium on Mathematical Statistics and Probability, L. M. L. Cam and J. Neyman, Eds., vol. 1. University of California Press, 1967, pp. 281-297.
2. S. P. Lloyd, "Least squares quantization in PCM," IEEE Transactions on Information Theory, vol. IT-28, no. 2, pp. 129-137, Mar. 1982.
3. S. Har-Peled and B. Sadri, "How fast is the k-means method?" in SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2005, pp. 877-885.
4. D. Arthur and S. Vassilvitskii, "How slow is the k-means method?" in SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry. NewYork, NY, USA: ACM, 2006, pp. 144-153.
5. P. S. Bradley and U. M. Fayyad, "Refining initial points for k-means clustering," Proceedings of Fifteenth Intl. Conference on Machine Learning, pp. 91-99, 1998.
6. D. Pelleg and A. Moore, "X-means: Extending k-means with efficient estimation of the number of clusters," Proceedings of the Seventeenth Intl. Conference on Machine Learning, pp. 727-734, 2000.
7. D. Judd and P. K. McKinley and A. K. Jain, "Large-scale parallel data clustering," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 8, pp. 871-876, Aug. 1998.
8. I. S. Dhillon and D. S. Modha, "A data-clustering algorithm on distributed memory multiprocessors," In Large-Scale Parallel Data Mining, Lecture Notes in Computer Science, vol. 1759, pp. 245-260, Mar. 2000.
9. D. Pettinger and G. D. Fatta, "Scalability of efficient parallel k-means," in Proceedings of the 5th IEEE International Conference on eScience Workshops, Dec. 2009, pp. 96-101.
10. K. Alsabti and S. Ranka and V. Singh, "An efficient k-means clustering algorithm," Proceedings of First Workshop on High Performance Data Mining, 1998.
11. D. Pelleg and A. Moore, "Accelerating exact k-means algorithms with geometric reasoning," Proceedings of Fifth ACM SIGKDD Intl. Conference on Knowledge Discovery and Data Mining, pp. 277-281, Jul. 1999.
12. T. Kanungo and D. M. Mount and N. S. Netanyahu and C. D. Piatko and R. Silverman and A. Y. Wu, "An efficient k-means clustering algorithm: Analysis and implementation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 881-892, Jul. 2002.
13. T. Zhang, R. Ramakrishnan, and M. Livny, "Birch: an efficient data clustering method for very large databases," SIGMOD Rec., vol. 25, no. 2, pp. 103-114, 1996.
14. J. L. Bentley, "Multidimensional binary search trees used for associative searching," Communications of the ACM, vol. 18, no. 9, pp. 509-517, 1975.
15. J. Lu, J. Tang, Z. Tang, and J. Yang, "Hierarchical initialization approach for k-means clustering," Pattern Recognition Letters, vol. 29, no. 6, pp. 787-795, April 2008.
16. D. L. Davies and D. W. Bouldin, "A cluster separation measure," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-1, no. 2, pp. 224-227, Apr. 1979.