Speeding up the Consensus Clustering methodology for microarray data analysis
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
BACKGROUND: The inference of the number of clusters in a dataset, a fundamental problem in Statistics, Data Analysis and Classification, is usually addressed via internal validation measures. The stated problem is quite difficult, in particular for microarrays, since the inferred prediction must be sensible enough to capture the inherent biological structure in a dataset, e.g., functionally related genes. Despite the rich literature present in that area, the identification of an internal validation measure that is both fast and precise has proved to be elusive. In order to partially fill this gap, we propose a speed-up of Consensus (Consensus Clustering), a methodology whose purpose is the provision of a prediction of the number of clusters in a dataset, together with a dissimilarity matrix (the consensus matrix) that can be used by clustering algorithms. As detailed in the remainder of the paper, Consensus is a natural candidate for a speed-up. RESULTS: Since the time-precision performance of Consensus depends on two parameters, our first task is to show that a simple adjustment of the parameters is not enough to obtain a good precision-time trade-off. Our second task is to provide a fast approximation algorithm for Consensus. That is, the closely related algorithm FC (Fast Consensus) that would have the same precision as Consensus with a substantially better time performance. The performance of FC has been assessed via extensive experiments on twelve benchmark datasets that summarize key features of microarray applications, such as cancer studies, gene expression with up and down patterns, and a full spectrum of dimensionality up to over a thousand. Based on their outcome, compared with previous benchmarking results available in the literature, FC turns out to be among the fastest internal validation methods, while retaining the same outstanding precision of Consensus. Moreover, it also provides a consensus matrix that can be used as a dissimilarity matrix, guaranteeing the same performance as the corresponding matrix produced by Consensus. We have also experimented with the use of Consensus and FC in conjunction with NMF (Nonnegative Matrix Factorization), in order to identify the correct number of clusters in a dataset. Although NMF is an increasingly popular technique for biological data mining, our results are somewhat disappointing and complement quite well the state of the art about NMF, shedding further light on its merits and limitations. CONCLUSIONS: In summary, FC with a parameter setting that makes it robust with respect to small and medium-sized datasets, i.e, number of items to cluster in the hundreds and number of conditions up to a thousand, seems to be the internal validation measure of choice. Moreover, the technique we have developed here can be used in other contexts, in particular for the speed-up of stability-based validation measures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Finding Groups in Data: An Introduction to Cluster Analysis
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344 · cited 1×
“In terms of time, there is a gap of at least two orders of magnitude between the fastest, WCSS [6], and the slowest ones.”
BackgroundEstimating the Number of Clusters in a Data Set Via the Gap Statistic
Tibshirani, R., Walther, G., & Hastie, T. (2001) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00293 · Cited by 6,205
Metagenes and molecular pattern discovery using matrix factorization
Brunet, J.-P., Tamayo, P., Golub, T. R., & Mesirov, J. P. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0308531101 · Cited by 2,183
Monti, S., Tamayo, P., Mesirov, J., & Golub, T. (2003) · Machine Learning · doi:10.1023/a:1023949509487 · Cited by 2,116 · cited 5×
“However, for the special case of microarray data, the experimental assessment of the “ fitness ” of a measure has been rather ad hoc and studies in that area provide only partial comparison among measures, e.g., [19].”
BackgroundMethodInfluentialNonnegative Matrix Factorization: An Analytical and Interpretive Tool in Computational Biology
Devarajan, K. (2008) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000029 · Cited by 454 · cited 1×
“…nat-ural hierarchical structure ” in microarray data, have been highlighted by Brunet et al. [25] in conjunction with NMF , a very versatile pattern discovery technique that has received quite a bit of attention in the computational biology literature, as discussed in the review by Devarajan [26].”
Method
Research works printed but not linked: 31
- Speed TP: Statistical analysis of gene expression microarray data. 2003, Chapman & Hall/CRC, · DOI · Paper page
- Everitt B: Cluster Analysis. 1993, London: Edward Arnold,
- Hansen P, Jaumard P: Cluster Analysis and Mathematical Programming. Mathematical Programming. 1997, 79: 191-215.
- Hartigan JA: Clustering Algorithms. 1975, John Wiley and Sons,
- Jain AK, Murty MN, Flynn PJ: Data Clustering: a Review. ACM Computing Surveys. 1999, 31 (3): 264-323. 10.1145/331499.331504 · DOI · Paper page
- Mirkin B: Mathematical Classification and Clustering. 1996, Kluwer Academic Publisher, · DOI · Paper page
- Rice JA: Mathematical Statistics and Data Analysis. 1996, Wadsworth,
- Hastie T, Tibshirani R, Friedman J: The Elements of Statistical Learning. 2003, Springer,
- Handl J, Knowles J, Kell DB: Computational Cluster Validation in Post-genomic Data Analysis. Bioinformatics. 2005, 21 (15): 3201-3212. 10.1093/bioinformatics/bti517 · DOI · Paper page
- Shamir R, Sharan R: Algorithmic Approaches to Clustering Gene Expression Data. Current Topics in Computational Biology. Edited by: Jiang T, Smith T, Xu Y, Zhang MQ. 2003, 120-161. Cambridge, Ma.: MIT Press,
- D'haeseleer P: How Does Gene Expression Cluster Work?. Nature Biotechnology. 2006, 23: 1499-1501. 10.1038/nbt1205-1499 · DOI · Paper page
- Jain A, Dubes R: Algorithms for Clustering Data. 1988, Englewood Cliffs: Prentice-Hall,
- Seal S, Comarina S, Aluru S: An Optimal Hierarchical Clustering Algorithm For Gene Expression Data. Information Processing Letters. 2004, 93: 143-147. 10.1016/j.ipl.2004.11.001 · doi:10.1016/j.ipl.2004.11.001
- Borodin A, Ostrovsky R, Rabani Y: Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Space. Machine Learning. 2004, 56: 153-167. 10.1023/B:MACH.0000033118.09057.80 · doi:10.1023/b:mach.0000033118.09057.80
- Frahling G, Sohler C: A fast K-means Implementation Using Coresets. Proceedings of the Twenty-Second Annual Symposium on Computational Geometry. 2006, 135-143. full_text. New York, NY, USA: ACM, · DOI
- Kraus J, Kestler H: A highly efficient multi-core algorithm for clustering extremely large datasets. BMC Bioinformatics. 2010, 11:
- Milligan G, Cooper M: An Examination of Procedures for Determining the Number of Clusters in a Data Set. Psychometrika. 1985, 50: 159-179. 10.1007/BF02294245 · DOI · Paper page
- Giancarlo R, Scaturro D, Utro F: Computational cluster validation for microarray data analysis: experimental assessment of Clest, Consensus Clustering, Figure of Merit, Gap Statistics and Model Explorer. BMC Bioinformatics. 2008, 9: 462- 10.1186/1471-2105-9-462 · DOI
- Dudoit S, Fridlyand J: A Prediction-based Resampling Method for Estimating the Number of Clusters in a Dataset. Genome Biology. 2002, 3:
- Ben-Hur A, Elisseeff A, Guyon I: A Stability Based Method for Discovering Structure in Clustering Data. Seventh Pacific Symposium on Biocomputing. 2002, 6-17. ISCB,
- Yeung K, Haynor D, Ruzzo W: Validating Clustering for Gene Expression Data. Bioinformatics. 2001, 17: 309-318. 10.1093/bioinformatics/17.4.309 · DOI · Paper page
- Dudoit S, Fridlyand J: Bagging to improve the accuracy of a clustering procedure. Bioinformatics. 2003, 19 (9): 1090-1099. 10.1093/bioinformatics/btg038 · DOI · Paper page
- Levine E, Domany E: Resampling Method for Unsupervised Estimation of Cluster Validity. Neural Computation. 2001, 13: 2573-2593. 10.1162/089976601753196030 · DOI · Paper page
- Roth V, Lange T, Braun M, Buhmann J: A Resampling Approach to Cluster Validation. Proc 15th Symposium in Computational Statistics. 2002, 123-128.
- Bertoni A, Valentini G: Model order selection for bio-molecular data clustering. BMC Bioinformatics. 2007, 8:
- Bertrand P, Mufti GB: Loevinger's measures of rule quality for assessing cluster stability. Computational Statistics & Data Analysis. 2006, 50: 992-1015. 10.1016/j.csda.2004.10.012 · doi:10.1016/j.csda.2004.10.012
- Klie S, Nikoloski Z, Selbig J: Biological Cluster Evaluation for Gene Function Prediction. Journal of Computational Biology. 2010, 17: 1-18. 10.1089/cmb.2009.0031 · DOI
- Di Gesú V, Giancarlo R, Lo Bosco G, Raimondi A, Scaturro D: Genclust: A Genetic Algorithm for Clustering Gene Expression Data. BMC Bioinformatics. 2005, 6: 289- 10.1186/1471-2105-6-289 · DOI
- Krzanowski W, Lai Y: A Criterion for Determining the Number of Groups in a Dataset Using Sum of Squares Clustering. Biometrics. 1985, 44: 23-34. 10.2307/2531893 · DOI · Paper page
- Bertoni A, Valentini G: Randomized maps for assessing the reliability of patients clusters in DNA microarray data analyses. Artificial Intelligence in Medicine. 2006, 37: 85-109. 10.1016/j.artmed.2006.03.005 · DOI
- Salvador S, Chan P: Determining the number of clusters/segments in hierarchical clustering/segmentation algorithms. Tools with Artificial Intelligence, 2004. ICTAI 2004. 16th IEEE International Conference on. 2004, 576-584. full_text.
Cited by
Krogh, N., Jansson, M. D., Häfner, S. J., Tehler, D., Birkedal, U., Christensen-Dalsgaard, M., Lund, A. H., & Nielsen, H. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkw482 · Cited by 262
LinearFold: linear-time approximate RNA folding by 5'-to-3' dynamic programming and beam search
Huang, L., Zhang, H., Deng, D., Zhao, K., Liu, K., Hendrix, D. A., & Mathews, D. H. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz375 · Cited by 207
RNA folding using quantum computers
Fox, D. M., MacDermaid, C. M., Schreij, A. M. A., Zwierzyna, M., & Walker, R. C. (2022) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1010032 · Cited by 33
Deep generalizable prediction of RNA secondary structure via base pair motif energy
Zhu, H., Tang, F., Quan, Q., Chen, K., Xiong, P., & Zhou, S. K. (2025) · Nature Communications · doi:10.1038/s41467-025-60048-1 · Cited by 17
The implications of APOBEC3-mediated C-to-U RNA editing for human disease
(2024) · doi:10.1038/s42003-024-06239-w · Cited by 16
Metadata
- Authors
- Giancarlo, R., & Utro, F.
- Venue
- Algorithms for Molecular Biology
- Published
- 2011-01-14
- Volume
- 6
- Issue
- 1
- Pages
- 1-1
- ISSN
- 1748-7188 (ISSN-L)
- OpenAlex
- W2132922290
- Cited by
- 166
- References
- 5
- FWCI
- 2.12
- Type
- journal article
- Language
- en
- Open access
- gold
- Licence
- creativecommons.org/licenses/by/2.0 (tdm)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Speeding up the Consensus Clustering methodology for microarray data analysis. https://app.cochat.ai/papers/10.1186/1748-7188-6-1
- The paper
- Giancarlo, R., & Utro, F. (2011). Speeding up the Consensus Clustering methodology for microarray data analysis. Algorithms for Molecular Biology. https://doi.org/10.1186/1748-7188-6-1
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.