Parallel clustering algorithm for large data sets with applications in bioinformatics.
Large sets of bioinformatical data provide a challenge in time consumption while solving the cluster identification problem, and that is why a parallel algorithm is so needed for identifying dense clusters in a noisy background. Our algorithm works on a graph representation of the data set to be analyzed. It identifies clusters through the identification of densely intraconnected subgraphs. We have employed a minimum spanning tree (MST) representation of the graph and solve the cluster identification problem using this representation. The computational bottleneck of our algorithm is the construction of an MST of a graph, for which a parallel algorithm is employed. Our high-level strategy for the parallel MST construction algorithm is to first partition the graph, then construct MSTs for the partitioned subgraphs and auxiliary bipartite graphs based on the subgraphs, and finally merge these MSTs to derive an MST of the original graph. The computational results indicate that when running on 150 CPUs, our algorithm can solve a cluster identification problem on a data set with 1,000,000 data points almost 100 times faster than on single CPU, indicating that this program is capable of handling very large data clustering problems in an efficient manner. We have implemented the clustering algorithm as the software CLUMP.
Olman
Victor
V
Department of Biochemistry and Molecular Biology, Computational System Biology Laboratory, Institute of Bioinformatics, University of Georgia, Athens, Georgia 30602, USA. olman@csbl.bmb.uga.edu
Mao
Fenglou
F
Wu
Hongwei
H
Xu
Ying
Y
D000465:Algorithms; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods*; D030541:Databases, Genetic; D016014:Linear Models; D005810:Multigene Family; D010363:Pattern Recognition, Automated / Q000379:methods*; D015203:Reproducibility of Results; D012984:Software; D018511:Systems Integration