Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests

BMC Bioinformatics

Volumn 11, Issue , 2010, Pages

  Edwards, David ^a   de Abreu, Gabriel C G ^a   Labouriau, Rodrigo ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCE STRUCTURES; DIFFERENTIAL EXPRESSIONS; DIFFERENTIALLY EXPRESSED GENE; GENE EXPRESSION STUDIES; KRUSKAL'S ALGORITHMS; MULTIVARIATE DISCRETE DISTRIBUTIONS; PENALIZED LIKELIHOOD CRITERIONS; SPANNING TREE ALGORITHMS;

ALGORITHMS; BAYESIAN NETWORKS; BIOLOGICAL SYSTEMS; CHROMOSOMES; FORESTRY;

GENE EXPRESSION;

ALGORITHM; ARTICLE; AUTOMATED PATTERN RECOGNITION; BREAST TUMOR; FEMALE; GENE EXPRESSION PROFILING; GENE REGULATORY NETWORK; GENETICS; HUMAN; METHODOLOGY; STATISTICAL MODEL;

ALGORITHMS; BREAST NEOPLASMS; FEMALE; GENE EXPRESSION PROFILING; GENE REGULATORY NETWORKS; HUMANS; LIKELIHOOD FUNCTIONS; MODELS, STATISTICAL; PATTERN RECOGNITION, AUTOMATED;

EID: 76949106424     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-11-18     Document Type: Article

References (43)

1. Friedman N. Inferring cellular networks using probabilistic graphical models. Science 2004, 303(5659):799-805. 10.1126/science.1094068, 14764868.
2. Larrañaga P, Inza I, Flores J. A Guide to the Literature on Inferring Genetic Networks by Probabilistic Graphical Models. Data Analysis and Visualization in Genomics and Proteomics 2005, 215-238. Wiley, New York, Azuaje F, Dopazo J.
3. Andrade-Cetto L, Manolakos E. A Graphical Model Formulation of the DNA Base-Calling Problem. Proc. IEEE Workshop on Machine Learning for Signal Processing 2005, 369-374.
4. Chow C, Liu C. Approximating discrete probability distributions with dependence trees. Information Theory, IEEE Transactions 1968, 14(3):462-467.
5. Kruskal J. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proc Am Math Soc 1956, 7:48-50.
6. Meila M. An accelerated Chow and Liu algorithm: fitting tree distributions to high dimensional sparse data. Proceedings of the 16th International Conference on Machine Learning 1999,
7. Pelleg D, Moore A. Dependency Trees in sub-linear time and bounded memory. The International Journal on Very Large Databases 2006, 15:250-262.
8. Bach F, Jordan M. Thin Junction Trees. Advances in Neural Information Processing Systems 2002, 14:569-576. Cambridge, MA: MIT Press, Dietterich TG, GZ Becker S.
9. Ouerd M, Oommen B, Matwin S. A formal approach to using data distributions for building causal polytree structures. Information Sciences 2004, 111-132.
10. Srebro N. Maximum likelihood bounded tree-width Markov networks. Artificial Intelligence 2003, 143:123-138.
11. Meila M, Jordan MI. Learning with mixtures of trees. J Mach Learn Res 2001, 1:1-48.
12. Sudderth E, Sudderth E, Wainwright M, Willsky A. Embedded trees: estimation of Gaussian Processes on graphs with cycles. IEEE Transactions on Signal Processing 2004, 52(11):3136-3150.
13. Kirshner S, Smyth P, Robertson AW. Conditional Chow-Liu tree structures for modeling discrete-valued vector time series. AUAI '04: Proceedings of the 20th conference on Uncertainty in artificial intelligence 2004, 317-324. Arlington, Virginia, United States: AUAI Press.
14. Chou C, Wagner T. Consistency of an estimate of tree-dependent probability distribution. IEEE Transactions on Information Theory 1973, IT-19:369-371.
15. Rissanen J. Stochastic Complexity. J Royal Stat Soc B 1987, 49:223-239.
16. Akaike H. A new look at the statistical identification problem. IEEE Trans Auto Control 1974, 19:716-723.
17. Schwarz G. Estimating the Dimension of a Model. Annals of Statistics 1978, 6:461-464.
18. Burnham KP, Anderson DR. Multimodel Inference: Understanding AIC and BIC in Model Selection. Sociological Methods Research 2004, 33:261-304.
19. Liang P, Srebro N. Methods and experiments with bounded tree-width Markov networks. Tech rep 2004, MIT.
20. Panayidou K. Estimation of Tree Structure for Variable Selection. PhD thesis University of Oxford, to appear..
21. Edwards D. Introduction to Graphical Modelling 2000, New York: Springer-Verlag, second.
22. Lauritzen SL. Graphical Models 1996, Oxford: Clarendon Press.
23. Lauritzen S, Wermuth N. Graphical models for associations between variables, some of which are qualitative and some quantitative. Ann Statist 1989, 17:31-57.
24. Frydenberg M, Lauritzen S. Decomposition of maximum likelihood in mixed graphical interaction models. Biometrika 1989, 76:539-555.
25. Verma T, Pearl J. Equivalence and synthesis of causal models. UAI '90: Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence 1991, 255-270. New York, NY, USA: Elsevier Science Inc.
26. Andersson SA, Madigan D, Perlman MD. On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs. Scandinavian Journal of Statistics 1997, 24:81-102.
27. Spirtes P, Glymour C, Scheines R. Causation, Prediction and Search. New York 1993, [Reprinted by MIT Press]..
28. Heckerman D, Geiger D, Chickering DM. Learning Bayesian Networks: The combination of knowledge and statistical data. Machine Learning 1995, 20:197-243.
29. Hung S, Baldi P, Hatfield G. Global Gene Expression Profiling in Escherichia coli K12. Journal of Biological Chemistry 2002, 477:40309-40323.
30. Cho BK, Barrett CL, Knight EM, Park YS, Palsson B. Genome-scale reconstruction of the Lrp regulatory network in Escherichia coli. Proc Natl Acad Sci USA 2008, 105(49):19462-19467. 10.1073/pnas.0807227105, 2614783, 19052235.
31. Smyth GK. Linear models and empirical bayes methods for assessing differential expression in microarray experiments. Stat Appl Genet Mol Biol 2004, 3:Article3.
32. Ligi P, Blumenthal R, Matthews R. Activation from a Distance: Roles of Lrp and Integration Host Factor in Transcriptional Activation of gltBDF. Journal of Bacteriology 2001, 183:3910-3918. 10.1128/JB.183.13.3910-3918.2001, 95273, 11395454.
33. Miller LD, Smeds J, George J, Vega VB, Vergara L, Ploner A, Pawitan Y, Hall P, Klaar S, Liu ET, Bergh J. An expression signature for p53 status in human breast cancer predicts mutation status, transcriptional effects, and patient survival. Proc Natl Acad Sci USA 2005, 102(38):13550-13555. 10.1073/pnas.0506230102, 1197273,1197273, 16141321.
34. Friedman J, Hastie T, Tibshirani R. Sparse inverse covariance estimation with the graphical lasso. Biostatistics 2008, 9(3):432-441. 10.1093/biostatistics/kxm045, 18079126.
35. Kalisch M, Buhlmann P. Estimating High-dimensional Directed Acyclic Graphs with the PC-Algorithm. Journal of Machine Learning Research 2007, 8:613-636.
36. Castelo R, Roverato A. Reverse engineering molecular regulatory networks from microarray data with qp-graphs. J Comput Biol 2009, 16(2):213-227. 10.1089/cmb.2008.08TT, 19178140.
37. Wermuth N. Model Search among Multiplicative Models. Biometrics 1976, 32(2):253-263.
38. Thomas A, Camp NJ. Graphical modeling of the joint distribution of alleles at associated loci. Am J Hum Genet 2004, 74(6):1088-1101. 10.1086/421249, 1182104, 15114533.
39. Chickering DM. Learning Bayesian networks is NP-complete. Learning from Data: Artificial Intelligence and Statistics V. New York 1996, 121-130. Fisher D, Lenz HJ.
40. Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chkovskii D, Alon U. Network Motifs: Simple Building Blocks of Complex Networks. Science 2002, 298:824-827. 10.1126/science.298.5594.824, 12399590.
41. Ciriello G, Guerra C. A review on models and algorithms for motif discovery in protein-protein interaction networks. Briefings in Functional Genomics and Proteomics 2008, 7(2):147-156. 10.1093/bfgp/eln015, 18443014.
42. Margolin AA, Nemenman I, Basso K, Wiggins C, Stolovitzky G, Favera RD, Califano A. ARACNE: an algorithm for the reconstruction of gene regulatory networks in a mammalian cellular context. BMC Bioinformatics 2006, 7(Suppl 1):S7. 10.1186/1471-2105-7-S1-S7, 1810318, 16723010.
43. Steuer R, Kurths J, Daub CO, Weise J, Selbig J. The mutual information: detecting and evaluating dependencies between variables. Bioinformatics 2002, 18(Suppl 2):S231-S240.