Home LiteratureArticle Details
PMID: 16257984 Published · ppublish English Journal Article Research Support, Non-U.S. Gov't

Robust multi-scale clustering of large DNA microarray datasets with the consensus algorithm.

Bioinformatics (Oxford, England) ·Vol. 22 ·No. 1 ·2006-01-01 ·Pages 58-67

Grotkjaer T, Winther O, Regenberg B, Nielsen J, Hansen LK

Abstract

Hierarchical and relocation clustering (e.g. K-means and self-organizing maps) have been successful tools in the display and analysis of whole genome DNA microarray expression data. However, the results of hierarchical clustering are sensitive to outliers, and most relocation methods give results which are dependent on the initialization of the algorithm. Therefore, it is difficult to assess the significance of the results. We have developed a consensus clustering algorithm, where the final result is averaged over multiple clustering runs, giving a robust and reproducible clustering, capable of capturing small signal variations. The algorithm preserves valuable properties of hierarchical clustering, which is useful for visualization and interpretation of the results. We show for the first time that one can take advantage of multiple clustering runs in DNA microarray analysis by collecting re-occurring clustering patterns in a co-occurrence matrix. The results show that consensus clustering obtained from clustering multiple times with Variational Bayes Mixtures of Gaussians or K-means significantly reduces the classification error rate for a simulated dataset. The method is flexible and it is possible to find consensus clusters from different clustering algorithms. Thus, the algorithm can be used as a framework to test in a quantitative manner the homogeneity of different clustering algorithms. We compare the method with a number of state-of-the-art clustering methods. It is shown that the method is robust and gives low classification error rates for a realistic, simulated dataset. The algorithm is also demonstrated for real datasets. It is shown that more biological meaningful transcriptional patterns can be found without conservative statistical or fold-change exclusion of data. Matlab source code for the clustering algorithm ClusterLustre, and the simulated dataset for testing are available upon request from T.G. and O.W.

MeSH Terms
Algorithms Cluster Analysis Computational Biology/methods Computer Simulation Gene Expression Profiling Genes, Fungal Genome Models, Statistical Normal Distribution Oligonucleotide Array Sequence Analysis/methods Open Reading Frames Pattern Recognition, Automated Sequence Alignment
Authors & Affiliations
5 authors, click to expand affiliations / ORCID
Grotkjaer Thomas
Center for Microbial Biotechnology BioCentrum-DTU, Building 223, Technical University of Denmark, DK-2800 Kgs. Lyngby, Denmark. [email protected]
Winther Ole
Regenberg Birgitte
Nielsen Jens
Hansen Lars Kai
Article Info
Journal
Bioinformatics (Oxford, England)
Abbr.
Bioinformatics
ISSN
1367-4803
Published
2006-01-01
Epub
2005-00-27
Pages
58-67
Language
English
Region
England
NLM ID
9808944
Subset
IM
Analysis Services
Analysis Services

Contact

No. 2 Wenbo Road, Zhangqiu District, Jinan, Shandong

Qilu Normal University · Genelibs Bioinformatics Lab

750 Shunhua Rd, Jinan

2F, Bldg F, University Science Park

Tel: 0531-88819269

WeChat Official Account

Follow our WeChat subscription account for real-time updates and the latest in medical and biological research.


Business Email

E-mail: [email protected]