Abstract

Hierarchical clustering is a common method used to determine clusters of similar data points in multidimensional spaces. O(n 2 ) algorithms are known for this problem [3, 4, 10, 18]. This paper reviews important results for sequential algorithms and describes previous work on parallel algorithms for hierarchical clustering. Parallel algorithms to perform hierarchical clustering using several distance metrics are then described. Optimal PRAM algorithms using n log n processors are given for the average link, complete link, centroid, median, and minimum variance metrics. Optimal butterfly and tree algorithms using n log n processors are given for the centroid, median, and minimum variance metrics. Optimal asymptotic speedups are achieved for the best practical algorithm to perform clustering using the single link metric on a n log n processor PRAM, butterfly, or tree. Keywords. Hierarchical clustering, pattern analysis, parallel algorithm, butterfly network, PRAM algorithm. 1 In...

Citations

2172	The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
1206	Introduction to Parallel Algorithms and Architectures: Arrays - Leighton - 1992
1011	A note on two problems in connexion with graphs. Numerische Mathematik 1: 269–271 - Dijkstra - 1959
657	A note on Two Problems in Connection with Graphs - Dijkstra
421	Generalizing the Hough Transform to Detect Arbitrary Shapes. Pattern Recognition - Ballard - 1981
406	RC: Shortest connection networks and some generalizations - Prim
321	On the shortest spanning subtree of a graph and the traveling salesman problem - Kruskal - 1956
162	On constructing minimum spanning trees in k-dimensional spaces and related problems - Yao - 1982
122	Mathematical Theory of Connecting Networks and Telephone Traffic - Benes - 1965
93	Three-dimensional model matching from an unconstrained viewpoint - Thompson, Mundy - 1987
85	A survey of recent advances in hierarchical clustering algorithms - Murtagh - 1983
83	Slink: an optimally efficient algorithm for the single-link cluster method - SIBSON - 1973
68	Object recognition and localization via pose clustering - Stockman - 1987
67	Tarjan, “Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation - Driscoll, Gabow, et al. - 1988
65	A general theory of classificatory sorting strategies 1 - Lance, Williams - 1967
62	H.: Efficient algorithms for agglomerative hierarchical clustering methods - Day, Edelsbrunner - 1984
51	Multidimensional clustering algorithms - Murtagh - 1985
45	Pose Determination of a ThreeDimensional Object Using Triangle Pairs - Linnainmaa, Harwood, et al. - 1988
30	Programming a Hypercube Multicomputer - Ranka, Won, et al. - 1988
27	An efficient algorithm for a complete link method - Defays - 1977
26	Hierarchical grouping to optimize an objective function - Jr - 1963
22	Optimal expected time algorithms for closest point problems - Bentley, Weide, et al. - 1980
12	Time and Space Efficient Pose Clustering - Olson - 1993
11	Parallel clustering algorithms - Li, Fang - 1989
7	Algorithm 76: Hierarchical clustering using the minimum spanning tree - Rohlf - 1973
6	Efficiency of hierarchical agglomerative clustering using the ICL distributed array processor - Rasmussen, Willett - 1989
6	A general theory of classi catory sorting strategies: 1 - Lance, Williams - 1967
4	Parallel squared error clustering on hypercube arrays - Rivera, Ismail, et al. - 1990
4	Parallel fuzzy clustering on fixed size hypercube SIMD computers - Zapata, Rivera, et al. - 1989
4	A probabilistic minimum spanning tree algorithm - Rohlf - 1978
3	Expected-time complexity results for hierarchical clustering algorithms which use cluster centers - Murtagh - 1983
3	Time and space e cient pose clustering - Olson - 1994
2	Parallel implementation of fast clustering algorithms - Bruynooghe - 1989
2	SLINK: An optimally e cient algorithm for the single link cluster method - Sibson - 1973
1	Classification ascendante hi'erarchique, des grands ensembles de donn'ees: un algorithme rapide fond'e sur la construction des voisinages r'eductibles. Les Cahiers de l'Analyse de Donn'ees - Bruynooghe - 1978
1	The Design and Analysis of Computer Algoriths - Aho, Hopcroft, et al. - 1974
1	Classi cation ascendante hierarchique, des grands ensembles de donnees: un algorithme rapide fonde sur la construction des voisinages reductibles. Les Cahiers de l'Analyse de Donnees, III:7{33 - Bruynooghe - 1978