ParaKMeans: Implementation of a parallelized K-means algorithm suitable for general laboratory use. Background: During the last decade, the use of microarrays to assess the transcriptome of many biological systems has generated an enormous amount of data. A common technique used to organize and analyze microarray data is to perform cluster analysis. While many clustering algorithms have been developed, they all suffer a significant decrease in computational performance as the size of the dataset being analyzed becomes very large. For example, clustering 10000 genes from an experiment containing 200 microarrays can be quite time consuming and challenging on a desktop PC. One solution to the scalability problem of clustering algorithms is to distribute or parallelize the algorithm across multiple computers. Results: The software described in this paper is a high performance multithreaded application that implements a parallelized version of the K-means Clustering algorithm. Most parallel processing applications are not accessible to the general public and require specialized software libraries (e.g. MPI) and specialized hardware configurations. The parallel nature of the application comes from the use of a web service to perform the distance calculations and cluster assignments. Here we show our parallel implementation provides significant performance gains over a wide range of datasets using as little as seven nodes. The software was written in C# and was designed in a modular fashion to provide both deployment flexibility as well as flexibility in the user interface. Conclusion: ParaKMeans was designed to provide the general scientific community with an easy and manageable client-server application that can be installed on a wide variety of Windows operating systems.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Erciyes, K.: Distributed and sequential algorithms for bioinformatics (2015)
- Xia, Dawen; Wang, Binfeng; Li, Yantao; Rong, Zhuobo; Zhang, Zili: An efficient mapreduce-based parallel clustering algorithm for distributed traffic subarea division (2015)
- Hardin, Johanna; Garcia, Stephan Ramon; Golan, David: A method for generating realistic correlation matrices (2013)
- Kraus, Johann M.; Kestler, Hans A.: A highly efficient multi-core algorithm for clustering extremely large datasets (2010) ioport