DocumentCode :
790457
Title :
Efficient parallel hierarchical clustering algorithms
Author :
Rajasekaran, Sanguthevar
Author_Institution :
Dept. of Comput. & Sci. Eng., Connecticut Univ., Storrs, CT, USA
Volume :
16
Issue :
6
fYear :
2005
fDate :
6/1/2005 12:00:00 AM
Firstpage :
497
Lastpage :
502
Abstract :
Clustering of data has numerous applications and has been studied extensively. Though most of the algorithms in the literature are sequential, many parallel algorithms have also been designed. In this paper, we present parallel algorithms with better performance than known algorithms. We consider algorithms that work well in the worst case as well as algorithms with good expected performance.
Keywords :
computational complexity; hypercube networks; parallel algorithms; parallel machines; pattern clustering; reconfigurable architectures; PRAM; mesh-connected computer; optical buses; parallel hierarchical clustering algorithm; parallel random access machine; reconfigurable network; Algorithm design and analysis; Clustering algorithms; Computer networks; Optical arrays; Optical computing; Optical fiber networks; Parallel algorithms; Partitioning algorithms; Phase change random access memory; Writing; PRAMs; Reconfigurable networks; hierarchical clustering; mesh-connected computers; meshes with optical buses; single-link metric.;
fLanguage :
English
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
1045-9219
Type :
jour
DOI :
10.1109/TPDS.2005.72
Filename :
1425438
Link To Document :
بازگشت