Bioinformatics Advance Access originally published online on July 31, 2006
Bioinformatics 2006 22(19):2405-2412; doi:10.1093/bioinformatics/btl406
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Evaluation and comparison of gene clustering methods in microarray analysis


1 Department of Human Genetics, University of Pittsburgh Pittsburgh, PA, USA
2 Department of Biostatistics, University of Pittsburgh Pittsburgh, PA, USA
*To whom correspondence should be addressed.
Motivation: Microarray technology has been widely applied in biological and clinical studies for simultaneous monitoring of gene expression in thousands of genes. Gene clustering analysis is found useful for discovering groups of correlated genes potentially co-regulated or associated to the disease or conditions under investigation. Many clustering methods including hierarchical clustering, K-means, PAM, SOM, mixture model-based clustering and tight clustering have been widely used in the literature. Yet no comprehensive comparative study has been performed to evaluate the effectiveness of these methods.
Results: In this paper, six gene clustering methods are evaluated by simulated data from a hierarchical log-normal model with various degrees of perturbation as well as four real datasets. A weighted Rand index is proposed for measuring similarity of two clustering results with possible scattered genes (i.e. a set of noise genes not being clustered). Performance of the methods in the real data is assessed by a predictive accuracy analysis through verified gene annotations. Our results show that tight clustering and model-based clustering consistently outperform other clustering methods both in simulated and real data while hierarchical clustering and SOM perform among the worst. Our analysis provides deep insight to the complicated gene clustering problem of expression profile and serves as a practical guideline for routine microarray cluster analysis.
Contact: ctseng{at}pitt.edu
Supplementary information: Supplementary data are available at Bioinformatics online.
Received on February 4, 2006; revised on May 23, 2006; accepted on July 21, 2006
This article has been cited by other articles:
![]() |
A. Krishnan and A. Pereira Integrative approaches for mining transcriptional regulatory programs in Arabidopsis Brief Funct Genomic Proteomic, July 16, 2008; (2008) eln035v1. [Abstract] [Full Text] [PDF] |
||||
![]() |
P. Langfelder, B. Zhang, and S. Horvath Defining clusters from a hierarchical cluster tree: the Dynamic Tree Cut package for R Bioinformatics, March 1, 2008; 24(5): 719 - 720. [Abstract] [Full Text] [PDF] |
||||
![]() |
G. C. Tseng Penalized and weighted K-means for clustering with scattered objects and prior information in high-throughput biological data Bioinformatics, September 1, 2007; 23(17): 2247 - 2255. [Abstract] [Full Text] [PDF] |
||||
![]() |
L. L. Elo, H. Jarvenpaa, M. Oresic, R. Lahesmaa, and T. Aittokallio Systematic construction of gene coexpression networks with applications to human T helper cell differentiation process Bioinformatics, August 15, 2007; 23(16): 2096 - 2103. [Abstract] [Full Text] [PDF] |
||||
![]() |
Y. Lu, X. He, and S. Zhong Cross-species microarray analysis with the OSCAR system suggests an INSR->Pax6->NQO1 neuro-protective pathway in aging and Alzheimer's disease Nucleic Acids Res., July 13, 2007; 35(suppl_2): W105 - W114. [Abstract] [Full Text] [PDF] |
||||


