Tractable Bayesian learning of tree belief networks

Statistics and Computing

Volumn 16, Issue 1, 2006, Pages 77-92

  Meilă, Marina ^a   Jaakkola, Tommi ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Bayesian; Decomposable prior; Graphical model; Matrix tree theorem; Spanning tree; Tree belief network

Indexed keywords

EID: 33644516911     PISSN: 09603174     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11222-006-5535-3     Document Type: Article

References (22)

1. Cheeseman P. and Stutz J. (1995). Bayesian classification (AutoClass): Theory and results. In: Fayyad U., Piatesky-Shapiro G., Smyth P., and Uthurusamy, (Eds.), Advances in Knowledge Discovery and Data Mining pp. 153-180. AAAI Press.
2. Chow C.K. and Liu C.N. (1968). Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory IT-14(3): 462-467.
3. Cooper G.F. and Herskovits E. (1992). A Bayesian method for the induction of probabilistic networks from data. Machine Learning 9: 309-347.
4. Dasgupta S. (1999). Learning polytrees. In: Laskey K.B. and Prade H., (Eds.), Proceedings of the 15th Conference on Uncertainty in AI, San Francisco, CA. Morgan Kaufmann.
5. Dawid A.P. and Lauritzen S. (1993). Hyper Markov laws in the statistical analysis of decomposable graphical models. Annals of Statistics 21: 1272-1317.
6. DeGroot M.H. (1975). Probability and Statistics. Addison-Wesley Pub. Co., Reading, MA.
7. Dellaportas P. and Forster J.J. (1999). Markov chain Monte Carlo model determination for hierarchical and graphical log-linear models. Biometrika 86(3): 615-633.
8. Dempster A.P., Laird N.M. and Rubin D.B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, B 39: 1-38.
9. Giudici P. and Green P. (1999). Decomposable graphical gaussian model determination. Biometrika 86: 785-801.
10. Harary, F. (1967). Graphs and matrices. SIAM Review 9(1): 83-90.
11. Heckerman D., Geiger D. and Chickering D.M. (1995). Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning 20(3): 197-243.
12. Jaakkola T., Meilǎ M., and Jebara T. (2000). Maximum entropy discrimination. In: Solla S.A., Leen T.K., and Müller K.-R., (Eds.), Neural Information Processing Systems, vol. 12, pp. 470-476. MIT Press.
13. Madigan D. and Raftery A. (1994). Model selection and accounting for model uncertainty in graphical models using occam's window. Journal of the American Statistical Association 89: 1335-1346.
14. Meilǎ M. and Jaakkola T. (2000). Tractable bayesian learning of tree distributions. In: Boutilier, C. and Goldszmidt, M., (Eds.), Proceedings of the 16th Conference on Uncertainty in Al San Francisco, CA. Morgan Kaufmann pp. 380-388.
15. Meilǎ M. and Jordan M.I. (2000). Learning with mixtures of trees. Journal for Machine Learning Research 1(1).
16. Meilǎ-Predoviciu M. (1999). Learning with Mixtures of Trees. PhD thesis, Massachusetts Institute of Technology.
17. Murray M.K. and Rice J.W. (1993). Differential Geometry and Statistics. Chapman & Hall.
18. Pearl J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufman Publishers, San Mateo, CA.
19. Spiegelhalter D.J. and Lauritzen S.L. (1990). Sequential updating of conditional probabilities on directed graphical structures. Networks 20: 491-505.
20. Spirtes P. and Meek C. (1995). Learning Bayesian networks with discrete variables from data. In Proceedings of First International Conference on Knowledge Discovery and Data Mining, Montreal, QU pp. 294-299. Morgan Kaufmann.
21. Srebro N. (2001). Maximum likelihood bounded tree-width Markov networks. In: Breese J. and Koller D., (Eds.), Proceedings of the 17th Conference on Uncertainty in AI pp. 504-511, San Francisco, CA. Morgan Kaufmann.
22. West D.B. (1996). Introduction to Graph Theory. Prentice Hall, Upper Saddle River, NJ.