Skip to content
naulon

No retraction, correction or concern found when last checked on Oct 29, 2026.

Bayesian correlated clustering to integrate multiple datasets

Paul Kirk, Jim E. Griffin, Richard S. Savage and 2 more

Bioinformatics · 2012 · CC BY-NC

doi:10.1093/bioinformatics/bts595

Abstract

Motivation: The integration of multiple datasets remains a key challenge in systems biology and genomic medicine. Modern high-throughput technologies generate a broad array of different data types, providing distinct—but often complementary—information. We present a Bayesian method for the unsupervised integrative modelling of multiple datasets, which we refer to as MDI (Multiple Dataset Integration). MDI can integrate information from a wide range of different datasets and data types simultaneously (including the ability to model time series data explicitly using Gaussian processes). Each dataset is modelled using a Dirichlet-multinomial allocation (DMA) mixture model, with dependencies between these models captured through parameters that describe the agreement among the datasets. Results: Using a set of six artificially constructed time series datasets, we show that MDI is able to integrate a significant number of datasets simultaneously, and that it successfully captures the underlying structural similarity between the datasets. We also analyse a variety of real Saccharomyces cerevisiae datasets. In the two-dataset case, we show that MDI’s performance is comparable with the present state-of-the-art. We then move beyond the capabilities of current approaches and integrate gene expression, chromatin immunoprecipitation–chip and protein–protein interaction data, to identify a set of protein complexes for which genes are co-regulated during the cell cycle. Comparisons to other unsupervised data integration techniques—as well as to non-integrative approaches—demonstrate that MDI is competitive, while also providing information that would be difficult or impossible to extract using other methods. Availability: A Matlab implementation of MDI is available from http://www2.warwick.ac.uk/fac/sci/systemsbiology/research/software/. Contact: D.L.Wild@warwick.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online.

Shown for reading. Its publisher allows quoting it, not republishing it.

References 55

  1. 1.

    Balasubramanian R., et al. A graph-theoretic approach to testing associations between disparate sources of functional genomics data. Bioinformatics. 2004;20:3353-3362.

    Not in our library10.1093/bioinformatics/bth405

  2. 2.

    Barash Y., Friedman N. Context-specific Bayesian clustering for gene expression data. J. Comput. Biol. 2002;9:169-191.

    Not in our library10.1089/10665270252935403

  3. 3.

    Brock G., et al. clValid: an R package for cluster validation. J. Stat. Softw. 2008;25:1-22.

    Not in our library

  4. 4.

    Carlson M., et al. org.Sc.sgd.db: genome wide annotation for Yeast. 2010.

    Not in our library

  5. 5.

    Cheng Y., Church G.M. Biclustering of expression data. Proc. Int. Conf. Intell. Syst. Mol. Biol. 2000;8:93-103.

    Not in our library

  6. 6.

    Cherry J.M., et al. SGD: Saccharomyces genome database. Nucleic Acids Res. 1998;26:73-79.

    Not in our library10.1093/nar/26.1.73

  7. 7.

    Cho R.J., et al. A genome-wide transcriptional analysis of the mitotic cell cycle. Mol. Cell. 1998;2:65-73.

    Not in our library10.1016/s1097-2765(00)80114-8

  8. 8.

    Cooke E.J., et al. Bayesian hierarchical clustering for microarray time series data with replicates and outlier measurements. BMC Bioinformatics. 2011;12:399.

    Not in our library10.1186/1471-2105-12-399

  9. 9.

    Datta S., Datta S. Methods for evaluating clustering algorithms for gene expression data using a reference set of functional classes. BMC Bioinformatics. 2006;7:397.

    Not in our library10.1186/1471-2105-7-397

  10. 10.

    Dempster A., et al. Maximum likelihood from incomplete data via EM Algorithm. J. R. Stat. Soc. Series B Methodol. 1977;39:1-38.

    Not in our library

  11. 11.

    Friedman J., et al. Consistency in boosting: discussion. Ann. Stat. 2004;32:102-107.

    Not in our library

  12. 12.

    Fritsch A., Ickstadt K. Improved criteria for clustering based on the posterior similarity matrix. Bayesian Anal. 2009;4:367-391.

    Not in our library

  13. 13.

    Granovskaia M.V., et al. High-resolution transcription atlas of the mitotic cell cycle in budding yeast. Genome Biol. 2010;11:R24.

    Not in our library10.1186/gb-2010-11-3-r24

  14. 14.

    Green P., Richardson S. Modelling heterogeneity with and without the Dirichlet process. Scand. J. Stat. 2001;28:355-375.

    Not in our library

  15. 15.

    Harbison C.T., et al. Transcriptional regulatory code of a eukaryotic genome. Nature. 2004;431:99-104.

    Not in our library10.1038/nature02800

  16. 16.

    Hubert L., Arabie P. Comparing partitions. J. Classif. 1985;2:193-218.

    Not in our library

  17. 17.

    Huttenhower C., et al. Exploring the human genome with functional maps. Genome Res. 2009;19:1093-1106.

    Not in our library10.1101/gr.082214.108

  18. 18.

    Ideker T., et al. Integrated genomic and proteomic analyses of a systematically perturbed metabolic network. Science. 2001;292:929-934.

    Not in our library10.1126/science.292.5518.929

  19. 19.

    Ishwaran H., Zarepour M. Exact and approximate representations for the sum Dirichlet process. Can. J. Stat. 2002;30:269-283.

    Not in our library

  20. 20.

    Jackson J.D., Gorovsky M.A. Histone H2A.Z has a conserved function that is distinct from that of the major H2A sequence variants. Nucleic Acids Res. 2000;28:3811-3816.

    Not in our library10.1093/nar/28.19.3811

  21. 21.

    Jackson J.D., et al. A likely histone H2A.F/Z variant in Saccharomyces cerevisiae. Trends Biochem. Sci. 1996;21:466-467.

    Not in our library10.1016/s0968-0004(96)20028-3

  22. 22.

    Jansen R., et al. A Bayesian networks approach for predicting protein-protein interactions from genomic data. Science. 2003;302:449-453.

    Not in our library10.1126/science.1087361

  23. 23.

    Kirk P.D., Stumpf M.P. Gaussian process regression bootstrapping: exploring the effects of uncertainty in time course data. Bioinformatics. 2009;25:1300-1306.

    Not in our library10.1093/bioinformatics/btp139

  24. 24.

    Lee I., et al. A probabilistic functional network of yeast genes. Science. 2004;306:1555-1558.

    Not in our library10.1126/science.1099511

  25. 25.

    Liu X., et al. Context-specific infinite mixtures for clustering gene expression profiles across diverse microarray dataset. Bioinformatics. 2006;22:1737-1744.

    Not in our library10.1093/bioinformatics/btl184

  26. 26.

    Liu X., et al. Bayesian hierarchical model for transcriptional module discovery by jointly modeling gene expression and ChIP-chip data. BMC Bioinformatics. 2007;8:283.

    Not in our library10.1186/1471-2105-8-283

  27. 27.

    Lockhart D.J., et al. Expression monitoring by hybridization to high-density oligonucleotide arrays. Nat. Biotechnol. 1996;14:1675-1680.

    Not in our library10.1038/nbt1296-1675

  28. 28.
  29. 29.

    Myers C.L., Troyanskaya O.G. Context-sensitive data integration and prediction of biological networks. Bioinformatics. 2007;23:2322-2330.

    Not in our library10.1093/bioinformatics/btm332

  30. 30.
  31. 31.

    Neal R.M. Bayesian mixture modeling. Maximum Entropy and Bayesian Methods: Proceedings of the 11th International Workshop on Maximum Entropy and Bayesian Methods of Statistical Analysis. 1992;197-211.

    Not in our library

  32. 32.

    Neal R.M. Markov chain sampling methods for Dirichlet process mixture models. J. Comput. Graph. Stat. 2000;9:249-265.

    Not in our library

  33. 33.

    Nieto-Barajas L., et al. Normalized random measures driven by increasing additive processes. Ann. Stat. 2004;32:2343-2360.

    Not in our library

  34. 34.

    Puig O., et al. The tandem affinity purification (TAP) method: a general procedure of protein complex purification. Methods. 2001;24:218-229.

    Not in our library10.1006/meth.2001.1183

  35. 35.

    Rand W. Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 1971;66:846-850.

    Not in our library

  36. 36.

    Rasmussen C.E., Solla S.A., Leen T.K., Müller K.-R. The infinite Gaussian mixture model. Advances in Neural Information Processing Systems. 2000;12:554-560.

    Not in our library

  37. 37.

    Rasmussen C.E., Williams C.K. Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning). 2006.

    Not in our library

  38. 38.
  39. 39.

    Rhodes D.R., et al. Probabilistic model of the human protein-protein interaction network. Nat. Biotechnol. 2005;23:951-959.

    Not in our library10.1038/nbt1103

  40. 40.

    Rigaut G., et al. A generic protein purification method for protein complex characterization and proteome exploration. Nat. Biotechnol. 1999;17:1030-1032.

    Not in our library10.1038/13732

  41. 41.

    Rogers S., et al. Investigating the correspondence between transcriptomic and proteomic expression profiles using coupled cluster models. Bioinformatics. 2008;24:2894-2900.

    Not in our library10.1093/bioinformatics/btn553

  42. 42.

    Rogers S., et al. Infinite factorization of multiple non-parametric views. Mach. Learn. 2010;79:201-226.

    Not in our library

  43. 43.

    Rousseau J., Mengersen K. Asymptotic behaviour of the posterior distribution in overfitted mixture models. J. R. Stat. Soc. Series B Stat. Methodol. 2011;73:689-710.

    Not in our library

  44. 44.

    Santisteban M.S., et al. Histone H2A.Z regulates transcription and is partially redundant with nucleosome remodeling complexes. Cell. 2000;103:411-422.

    Not in our library10.1016/s0092-8674(00)00133-1

  45. 45.

    Savage R.S., et al. Discovering transcriptional modules by Bayesian data integration. Bioinformatics. 2010;26:i158-i167.

    Not in our library10.1093/bioinformatics/btq210

  46. 46.

    Schena M., et al. Quantitative monitoring of gene expression patterns with a complementary DNA microarray. Science. 1995;270:467-470.

    Not in our library10.1126/science.270.5235.467

  47. 47.

    Shen R., et al. Integrative clustering of multiple genomic data types using a joint latent variable model with application to breast and lung cancer subtype analysis. Bioinformatics. 2009;25:2906-2912.

    Not in our library10.1093/bioinformatics/btp543

  48. 48.

    Solomon M.J., et al. Mapping protein-DNA interactions in vivo with formaldehyde: evidence that histone H4 is retained on a highly transcribed gene. Cell. 1988;53:937-947.

    Not in our library10.1016/s0092-8674(88)90469-2

  49. 49.

    Stark C., et al. BioGRID: a general repository for interaction datasets. Nucleic Acids Res. 2006;34:D535-D539.

    Not in our library10.1093/nar/gkj109

  50. 50.

    Suchard M.A., et al. Understanding GPU programming for statistical computation: studies in massively parallel massive mixtures. J. Comput. Graph. Stat. 2010;19:419-438.

    Not in our library10.1198/jcgs.2010.10016

  51. 51.

    Troyanskaya O.G., et al. A Bayesian framework for combining heterogeneous data sources for gene function prediction (in Saccharomyces cerevisiae). Proc. Natl Acad. Sci. USA. 2003;100:8348-8353.

    Not in our library10.1073/pnas.0832373100

  52. 52.

    Wei P., Pan W. Bayesian joint modeling of multiple gene networks and diverse genomic data to identify target genes of a transcription factor. Ann. Appl. Stat. 2012;6:334-355.

    Not in our library10.1214/11-aoas502

  53. 53.

    Wong S.L., et al. Combining biological networks to predict genetic interactions. Proc. Natl Acad. Sci. USA. 2004;101:15682-15687.

    Not in our library10.1073/pnas.0406614101

  54. 54.

    Yeung K.Y., et al. Clustering gene-expression data with repeated measurements. Genome Biol. 2003;4:R34.

    Not in our library10.1186/gb-2003-4-5-r34

  55. 55.

    Yuan Y., et al. Patient-specific data fusion defines prognostic cancer subtypes. PLoS Comput. Biol. 2011;7:e1002227.

    Not in our library10.1371/journal.pcbi.1002227

Cited by papers we hold 9

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.