Bayesian structure learning using dynamic programming and MCMC

Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, UAI 2007

Volumn , Issue , 2007, Pages 101-108

  Eaton, Daniel ^a   Murphy, Kevin ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN STRUCTURE LEARNING; EXPONENTIAL TIME; HYBRID TECHNIQUES; MCMC METHOD; PREDICTIVE DENSITY; PROPOSAL DISTRIBUTION; STRUCTURE-LEARNING; TEST DATA;

ARTIFICIAL INTELLIGENCE;

DYNAMIC PROGRAMMING;

EID: 80053158041     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. G. Brightwell and P. Winkler. Computing linear extensions is #P-complete. In STOC, 1991.
2. C. K. Chow and C. N. Liu. Approximating discrete probability distributions with dependence trees. IEEE Trans. on Info. Theory, 14:462-67, 1968.
3. D. Chickering and C. Meek. Finding Optimal Bayesian Networks. In UAI, 2002.
4. G. Cooper and C. Yoo. Causal discovery from a mixture of experimental and observational data. In UAI, 1999.
5. D. Dash and G. Cooper. Model Averaging for Prediction with Discrete Bayesian Networks. J. of Machine Learning Research, 5:1177-1203, 2004.
6. N. de Freitas, P. Hjen-Srensen, M. I. Jordan, and S. Russell. Variational MCMC. In UAI, 2001.
7. D. Edwards. Introduction to graphical modelling. Springer, 2000. 2nd edition.
8. B. Ellis and W. Wong. Sampling Bayesian Networks quickly. In Interface, 2006.
9. N. Friedman and D. Koller. Being Bayesian about Network Structure: A Bayesian Approach to Structure Discovery in Bayesian Networks. Machine Learning, 50:95-126, 2003.
10. N. Friedman, K. Murphy, and S. Russell. Learning the structure of dynamic probabilistic networks. In UAI, 1998.
11. P Giudici and R. Castelo. Improving Markov chain Monte Carlo model search for data mining. Machine Learning, 50(1-2):127 - 158, January 2003.
12. D. Heckerman, D. Geiger, and M. Chickering. Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning, 20(3):197-243, 1995.
13. D. Husmeier. Sensitivity and specificity of inferring genetic regulatory interactions from microarray experiments with dynamic Bayesian networks. Bioinformatics, 19:2271-2282, 2003. (Pubitemid 37483983)
14. K.-B. Hwang and B.-T. Zhang. Bayesian model averaging of Bayesian network classifiers over multiple node-orders: application to sparse datasets. IEEE Trans. on Systems, Man and Cybernetics, 35(6):1302-1310, 2005. (Pubitemid 41800428)
15. M. Koivisto. Advances in exact Bayesian structure discovery in Bayesian networks. In UAI, 2006.
16. M. Koivisto and K. Sood. Exact Bayesian structure discovery in Bayesian networks. J. of Machine Learning Research, 5:549-573, 2004.
17. D. Madigan, J. Gavrin, and A. Raftery. Enhancing the predictive performance of Bayesian graphical models. Communications in Statistics - Theory and Methods, 24:2271-2292, 1995.
18. M. Meila and M. I. Jordan. Learning with mixtures of trees. J. of Machine Learning Research, 1:1-48, 2000. (Pubitemid 33739061)
19. M. Meila and T. Jaakkola. Tractable Bayesian learning of tree belief networks. Statistics and Computing, 16:77-92, 2006. (Pubitemid 43296619)
20. V. Mansinghka, C. Kemp, J. Tenenbaum, and T. Griffiths. Structured priors for structure learning. In UAI, 2006.
21. Andrew W Moore and Mary S. Lee. Cached sufficient statistics for efficient machine learning with large datasets. J. of AI Research, 8:67-91, 1998.
22. D. Madigan and A. Raftery. Model selection and accounting for model uncertainty in graphical models using Occam's window. J. of the Am. Stat. Assoc, 89:1535-1546, 1994.
23. Andrew Moore and Weng-Keen Wong. Optimal reinsertion: A new search operator for accelerated and more accurate bayesian network structure learning. In Intl. Conf. on Machine Learning, pages 552-559, 2003.
24. D. Madigan and J. York. Bayesian graphical models for discrete data. Intl. Statistical Review, 63:215-232, 1995.
25. C. Robert and G. Casella. Monte Carlo Statisical Methods. Springer, 2004. 2nd edition.
26. R. W. Robinson. Counting labeled acyclic digraphs. In F. Harary, editor, New Directions in the Theory of Graphs, pages 239-273. Academic Press, 1973.
27. T. Silander and P. Myllmaki. A simple approach for finding the globally optimal Bayesian network structure. In UAI, 2006.
28. K. Sachs, O. Perez, D. Pe'er, D. Lauffenburger, and G. Nolan. Causal protein-signaling networks derived from multiparameter single-cell data. Science, 308, 2005.
29. I. Tsamardinos, L. Brown, and C. Aliferis. The max-min hill-climbing bayesian network structure learning algorithm. Machine learning, 2006.