Fast parallel algorithm for the single link heuristics of hierarchical clustering

Authors:
Dahlhaus
Affiliations:
Basser Dept. of Comput. Sci., Sydney Univ., NSW, Australia
Venue:
SPDP '92 Proceedings of the 1992 Fourth IEEE Symposium on Parallel and Distributed Processing
Year:
1992

Citing 0
Cited 1

A coarse grained parallel algorithm for closest larger ancestors in trees with applications to single link clustering

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fast parallel algorithm of single link heuristics of hierarchical clustering is presented. Its time processor product is optimal and the parallel time is the square of the logarithm. The algorithm is based on computing a minimum spanning tree which can be done in O(log/sup 2/ n) time using O(n/sup 2//log/sup n/) processors. The main gap to be filled is to compute a hierarchical clustering tree (dendrogram) from a minimum spanning tree. The author proves that this can be done in O(log n) time using O(n) processors. Therefore, the overall time-processor product of O(n/sup 2/) is optimal.