This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Algorithms for Hierarchical Clustering and Cluster Validity
November 1990 (vol. 12 no. 11)
pp. 1088-1092

Parallel algorithms on SIMD (single-instruction stream multiple-data stream) machines for hierarchical clustering and cluster validity computation are proposed. The machine model uses a parallel memory system and an alignment network to facilitate parallel access to both pattern matrix and proximity matrix. For a problem with N patterns, the number of memory accesses is reduced from O(N/sup 3/) on a sequential machine to O(N/sup 2/) on an SIMD machine with N PEs.

[1] K. Batcher, "The multidimensional access memory in STARAN,"IEEE Trans. Comput., vol. C-26, pp. 174-177, Feb. 1977.
[2] E. Dekel, D. Nassimi, and S. Sahni, "Parallel matrix and graph algorithms,"SIAM J. Comput., vol. 10, no. 4, pp. 657-675, 1981.
[3] R. Dubes and A. Jain, "Clustering methodologies in exploratory data analysis,"Advances in Comput., vol. 19, pp. 113-228, 1980.
[4] Z. Fang, X. Li, and L. Ni, "Parallel algorithms for image template matching on hypercube SIMD computers,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-9, no. 6, pp. 835-841, Nov. 1987.
[5] K. Hwang and F. A. Briggs,Computer Architecture and Parallel Processing. New York: McGraw-Hill, 1984.
[6] A. K. Jain and R. C. Dubes,Algorithms for Clustering Data. Englewood Cliffs, NJ: Prentice-Hall, 1988.
[7] X. Li, "Parallel hierarchical clustering and cluster validity computation," Dep. Comput. Sci., Univ. Alberta, Edmonton, Tech. Rep. 88-21, 1988.
[8] X. Li and Z. Fang, "Parallel clustering algorithms,"Parallel Comput., vol. 11, no. 3, pp. 275-290, 1989.
[9] X. Li and R. Dubes, "A probabilistic measure of similarity for binary data in pattern recognition,"Pattern Recognition, vol. 22, no. 4, pp. 397-409, 1989.
[10] L. Ni and A. Jain, "A VLSI systolic architecture for pattern clustering,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-7, no. 1, pp. 80-89, Jan. 1985.
[11] C. Wu and T. Feng, "The universality of the shuffle-exchange network,"IEEE Trans. Comput., vol. C-30, no. 5, pp. 324-332, May 1981.

Index Terms:
SIMD machines; parallel algorithms; computational complexity; hierarchical clustering; cluster validity; parallel memory system; alignment network; pattern matrix; proximity matrix; computational complexity; computerised pattern recognition; parallel processing
Citation:
X. Li, "Parallel Algorithms for Hierarchical Clustering and Cluster Validity," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 11, pp. 1088-1092, Nov. 1990, doi:10.1109/34.61708
Usage of this product signifies your acceptance of the Terms of Use.