Efficient Parallel Hierarchical Clustering Algorithms

Authors:
Sanguthevar Rajasekaran
Affiliations:
IEEE
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2005

Citing 15
Cited 6

Optimal and sublogarithmic time randomized parallel sorting algorithms

SIAM Journal on Computing
Space multiplexing of waveguides in optically interconnected multiprocessor systems

The Computer Journal - Special issue on object-oriented programming
Parallel Algorithms for Hierarchical Clustering and Cluster Validity

IEEE Transactions on Pattern Analysis and Machine Intelligence
The power of reconfiguration

Journal of Parallel and Distributed Computing
An optimal randomized parallel algorithm for finding connected components in a graph

SIAM Journal on Computing
An introduction to parallel algorithms

An introduction to parallel algorithms
A randomized linear-time algorithm to find minimum spanning trees

Journal of the ACM (JACM)
Parallel algorithms for hierarchical clustering

Parallel Computing
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses

IEEE Transactions on Parallel and Distributed Systems
A minimum spanning tree algorithm with inverse-Ackermann type complexity

Journal of the ACM (JACM)
Efficient parallel algorithms for hierarchical clustering on arrays with reconfigurable optical buses

Journal of Parallel and Distributed Computing
Computer Algorithms: C++

Computer Algorithms: C++
Clustering on a Hypercube Multicomputer

IEEE Transactions on Parallel and Distributed Systems
An Optimal Sorting Algorithm on Reconfigurable Mesh

IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest

RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques

Exploiting parallelism to support scalable hierarchical clustering

Journal of the American Society for Information Science and Technology
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective

Journal of Parallel and Distributed Computing
Parallel time and space upper-bounds for the subset-sum problem

Theoretical Computer Science
Efficient parallel algorithm for pixel classification in remote sensing imagery

Geoinformatica
Feature selection based on sensitivity analysis of fuzzy ISODATA

Neurocomputing
An adaptive parallel hierarchical clustering algorithm

HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

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.