pPOP: Fast yet accurate parallel hierarchical clustering using partitioning

Data and Knowledge Engineering

Volumn 61, Issue 3, 2007, Pages 563-578

  Dash, Manoranjan ^a   Petrutiu, Simona ^b   Scheuermann, Peter ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b Northwestern University   (United States)

Author keywords

Hierarchical agglomerative clustering; Parallel algorithm; Partitioning; Shared memory multiprocessor architecture

Indexed keywords

COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; PARALLEL ALGORITHMS; PROGRAM PROCESSORS; STORAGE ALLOCATION (COMPUTER);

HIERARCHICAL AGGLOMERATIVE CLUSTERING (HAC); PARTIALLY OVERLAPPING PARTITIONING (POP); SHARED MEMORY MULTIPROCESSOR ARCHITECTURES;

CLUSTERING ALGORITHMS;

EID: 34147197499     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2006.07.004     Document Type: Article

References (30)

1. Anderberg M.R. Cluster Analysis for Applications (1973), Academic Press, New York
2. K. Beyer, J. Goldstein, R. Ramakrishnan, U. Shaft, When is "nearest neighbor" meaningful? in: Proceedings of the International Conference on Database Theory (ICDT), 1999, pp. 217-235.
3. P.S. Bradley, U. Fayyad, C. Reina, Scaling clustering algorithms to large databases, in: Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD), 1998, pp. 9-15.
4. S. Brin, Near neighbor search in large metric spaces, in: Proceedings of the International Conference on Very Large Databases (VLDB), 1995.
5. In: Chandra R., Dagum L., Kohr D., Maydan D., McDonald J., and Menon R. (Eds). Parallel Programming in OpenMP (2000), Morgan Kaufman Publishers
6. M. Dash, Efficient clustering for knowledge discovery in large high-dimensional databases, Ph.D. thesis, Department of Computer Science, School of Computing, National University of Singapore, 2002. Available from: .
7. Dash M., Liu H., Scheuermann P., and Tan K.L. Fast hierarchical clustering and its validation. Data and Knowledge Engineering 44 1 (2003) 109-138
8. Dash M., Petrutiu S., and Scheuermann P. Efficient parallel hierarchical clustering. Proceedings of 10th International Conference on Parallel and Distributed Computing (Euro-Par) (2004), Springer-Verlag 363-371
9. M. Dash, K.L. Tan, H. Liu, Efficient yet accurate clustering, in: Proceedings of IEEE International Conference on Data Mining, (ICDM), 2001, pp. 99-106.
10. Day W.H.E., and Edelsbrunner H. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification 1 1 (1984) 7-24
11. Dhillon I.S., and Modha D.M. Large-scale parallel data mining. Lecture Notes in Artificial Intelligence 1759 (2000) 245-260
12. M. Ester, H.P. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, in: Proceedings of International Conference on Knowledge Discovery and Data Mining (KDD), 1996, pp. 226-231.
13. S. Guha, R. Rastogi, K. Shim, CURE: an efficient clustering algorithm for large databases, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1998, pp. 73-84.
14. Han J., and Kamber M. Data Mining: Concepts and Techniques (2000), Morgan Kaufmann Publishers
15. A. Hinneburg, D.A. Keim, Optimal grid-clustering: towards breaking the curse of dimensionality clustering, in: Proceedings of International Conference on Very Large Databases (VLDB), 1999.
16. A.K. Jain, R.C. Dubes, Clustering methods and algorithms, in: Algorithm for Clustering Data, Prentice-Hall Advanced Reference Series, 1988.
17. Jain A.K., Murty M.N., and Flynn P.J. Data clustering: a review. ACM Computing Surveys 31 3 (1999) 264-323
18. Karypis G., Han E.-H., and Kumar V. CHAMELEON: a hierarchical clustering algorithm using dynamic modeling. IEEE Computer 32 (1999) 68-75
19. Li X. Parallel algorithms for hierarchical clustering and cluster validity. IEEE Transactions on Pattern Analysis and Machine Intelligence 12 (1990) 1088-1092
20. Li X., and Fang Z. Parallel clustering algorithms. Parallel Computing 11 (1989) 275-290
21. Milligan G., and Cooper M. An examination of procedures for determining the number of clusters in a data set. Pshychometrika 50 (1985) 159-179
22. H. Nagesh, S. Goil, A. Choudhary, PMAFIA: a scalable parallel subspace clustering algorithm for massive datasets, in: Proceedings of the International Conference on Parallel Processing, 2000, pp. 21-24.
23. Olson C.F. Parallel algorithms for hierarchical clustering. Parallel Computing 21 (1995) 1313-1325
24. Omiecinski E., and Scheuermann P. A parallel algorithm for record clustering. ACM Transactions on Database Systems 15 4 (1990) 599-624
25. In: Preparata F.P., and Shamos M.I. (Eds). Computational Geometry: An Introduction (1985), Springer-Verlag
26. M. Stonebraker, J. Frew, K. Gardels, J. Meredith, The SEQUOIA 2000 storage benchmark, in: Proceedings of ACM SIGMOD International Conference on Management of Data, 1993, pp. 2-11.
27. Ward Jr. J.H. Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association 58 (1963) 236-244
28. R. Weber, H.-J. Schek, S. Blott, A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces, in: Proceedings of the International Conference on Very Large Databases (VLDB), 1998, pp. 194-205.
29. Wu C.H., Horng S.J., and Tsai H.R. Efficient parallel algorithms for hierarchical clustering on arrays with reconfigurable optical buses. Journal of Parallel and Distributed Computing 60 (2000) 1137-1153
30. T. Zhang, R. Ramakrishnan, M. Livny, BIRCH: an efficient data clustering method for very large databases, in: Proceedings of ACM SIGMOD Conference on Management of Data, Montreal, Canada, June 1996, pp. 103-114.