About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Journal article

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

From

Department of Systems Biology, Technical University of Denmark1

Cognitive Systems, Department of Informatics and Mathematical Modeling, Technical University of Denmark2

Department of Informatics and Mathematical Modeling, Technical University of Denmark3

Center for Microbial Biotechnology, Department of Systems Biology, Technical University of Denmark4

Motivation: 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.

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.

Availability: Matlab source code for the clustering algorithm ClusterLustre, and the simulated dataset for testing are available upon request from T.G. and O.W. Contact: tg@biocentrum.dtu.dk and owi@imm.dtu.dk Supplementary information: http://www.cmb.dtu.dk/

Language: English
Year: 2006
Pages: 58-67
ISSN: 02667061 , 13674803 , 13674811 and 14602059
Types: Journal article
DOI: 10.1093/bioinformatics/bti746
ORCIDs: Winther, Ole and Hansen, Lars Kai

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis