Abstract
Developing fast algorithms for clustering has been an important area of research in data mining and other fields. K-means is one of the widely used clustering algorithms. In this work, we have developed and evaluated parallelization of k-means method for low-dimensional data on message passing computers. Three different data decomposition schemes and their impact on the pruning of distance calculations in tree-based k-means algorithm have been studied. Random pattern decomposition has good load balancing but fails to prune distance calculations effectively. Compact spatial decomposition of patterns based on space filling curves outperforms random pattern decomposition even though it has load imbalance problem. In both cases, parallel tree-based k-means clustering runs significantly faster than the traditional parallel k-means.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys 31(3), 264–323 (1999)
Judd, D., McKinley, P.K., Jain, A.K.: Large-Scale Parallel Data Clustering. In: Proc. of the 13th Int. Conf. on Pattern Recognition (1996)
Xue, L., Bajorath, J.: Molecular Descriptors for Effective Classification of Biologically Active Compounds Based on Principal Component Analysis Identified by a Genetic Algorithm. J. Chem. Inf. Comput. Sci. 40, 801–809 (2000)
McQueen, J.: Some Methods for Classification and Analysis of Multivariate Observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 173–188 (1997)
Alsabti, K., Ranka, S., Singh, V.: An Efficient K-Means Clustering Algorithm. In: IPPS/SPDP 1st Workshop on High Performance Data Mining (1998)
Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading (1989)
Dhillon, I.S., Modha, D.S.: A Data Clustering Algorithm on Distributed Memory Machines. In: Zaki, M.J., H0, C.T. (eds.) Workshop on Large-Scale Parallel KDD Systems. Technical Report 99-8, Computer Sci. Dept. Rensselaer Polytechnic Institute (1999)
Gürsoy, A., Cengiz, I.: Parallel Pruning for K-Means Clustering Shared Memory Architectures. In: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol. 2150, pp. 321–325. Springer, Heidelberg (2001)
Singh, J.P., Holt, C., Totsuke, T., Gupta, A., Hennessy, J.: Load Balancing and Data Locality in Adaptive Hierarchical N-Body Methods: Barnes-Hut, Fast Multipole, and Radiosity. Journal of Parallel and Distributed Computing 27, 118–141 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gursoy, A. (2004). Data Decomposition for Parallel K-means Clustering. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive