Improved gene clustering based on particle swarm optimization, k-means, and cluster matching

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Past research has demonstrated that gene expression data can be effectively clustered into a group of centroids using an integration of the particle swarm optimization (PSO) and the K-Means algorithm. It is entitled PSO-based K-Means clustering algorithm (PSO-KM). This paper proposes a novel scheme of cluster matching to improve the PSO-KM for gene expression data. With the proposed scheme prior to the PSO operations, sequence of the clusters' centroids represented in a particle is matched that of the corresponding ones in the best particle with the closest distance. On this basis, not only a particle communicates with the best one in the swarm, but also sequence of the centroids is optimized. Experimental results reflect that the performance of the proposed design is superior in term of the reduction of the clustering error and convergence rate. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Lam, Y. K., Tsang, P. W. M., & Leung, C. S. (2011). Improved gene clustering based on particle swarm optimization, k-means, and cluster matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7062 LNCS, pp. 654–661). https://doi.org/10.1007/978-3-642-24955-6_77

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free