Scalability of efficient parallel K-Means

e-science 2009 - Proceedings of the 2009 5th IEEE International Conference on e-Science Workshops

Volumn , Issue , 2009, Pages 96-101

  Pettinger, David ^a   Fatta, Giuseppe Di ^a  

^a UNIVERSITY OF READING   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEARCH TREES; CLUSTERING METHODS; COMPUTATION LOADS; COMPUTATIONAL ENVIRONMENTS; DATA POINTS; EFFICIENT DATA STRUCTURES; K-MEANS; K-MEANS ALGORITHM; K-MEANS TECHNIQUE; KD-TREE; LOAD IMBALANCE; LOAD-BALANCING; PARALLEL FORMULATION; PARALLEL PROCESSING; PROCESSING NODES; SQUARED ERROR DISTORTION;

CLUSTERING ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; DATA PROCESSING; DATA STRUCTURES; NETWORK MANAGEMENT;

COMPUTATIONAL EFFICIENCY;

EID: 77950151906     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ESCIW.2009.5407991     Document Type: Conference Paper

References (14)

1. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: A review. ACM Computing Surveys, 31(3):264-323, 1999.
2. M. Baker, B. Carpenter, and A. Shafi. MPJ Express: Towards thread safe Java HPC. Proceedings of the IEEE International Conference on Cluster Computing, 2006.
3. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509-517, 1975.
4. P. S. Bradley and U. M. Fayyad. Refining initial points for kmeans clustering. Proceedings of Fifteenth Intl. Conference on Machine Learning, pages 91-99, 1998.
5. D. Foti, D. Lipari, C. Pizzuti, and D. Talia. Scalable parallel clustering for data mining on multicomputers. Proceedings of the 15th IPDPS 2000 Workshops on Parallel and Distributed Processing, pages 390-398, 2000.
6. D. Judd, P. K. McKinley, and A. K. Jain. Large-scale parallel data clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(8):871-876, Aug. 1998.
7. 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, 1759:245-260, Mar. 2000.
8. J.B. Kruskal and M. Wish. Multidimensional Scaling. Sage University Paper series on Quantitative Applications in the Social Sciences, Beverly Hills and London: Sage Publications, 07-011, 1978.
9. K. Alsabti, S. Ranka, and V. Singh. An efficient k-means clustering algorithm. Proceedings of First Workshop on High Performance Data Mining, 1998.
10. J. B. MacQueen. Some methods for classification and analysis of multivariate observations. Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability.
11. A. W. Moore. Efficient memory based learning for robot control. PhD thesis, 1991.
12. 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, pages 277-281, July 1999.
13. 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, pages 727-734, 2000.
14. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y.Wu. An efficient k-means clustering algorithm: Analysis and implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(7):881-892, July 2002.