Exact learning of bounded tree-width Bayesian networks

Journal of Machine Learning Research

Volumn 31, Issue , 2013, Pages 370-378

  Korhonen, Janne H ^a   Parviainen, Pekka ^b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; TREES (MATHEMATICS);

BAYESIAN NETWORK LEARNING; BOUNDED TREEWIDTH; EXACT ALGORITHMS; EXACT LEARNING; LEARNING NETWORK; NON-TRIVIAL; RUNNING TIME; SUPER-STRUCTURES;

BAYESIAN NETWORKS;

EID: 84919758182     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (27)

1. F. R. Bach and M. I. Jordan. Thin junction trees. In Advances in Neural Information Processing Systems 14 (NIPS). MIT Press, 2002.
2. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal of Computing, 25: 1305-1317, 1996.
3. A. Chechetka and C. Guestrin. Efficient principled learning of thin junction trees. In Advances in Neural Information Processing Systems 20 (NIPS), pages 273-280. MIT Press, 2008.
4. D. M. Chickering. Learning Bayesian networks is NPComplete. In Learning from Data: Artificial Intel- ligence and Statistics V, pages 121-130. Springer- Verlag, 1996.
5. D. M. Chickering, D. Heckerman, and C. Meek. Largesample learning of Bayesian networks is NP-Hard. Journal of Machine Learning Research, 5: 1287-1330, 2004.
6. C. K. Chow and C. N. Liu. Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14(3): 462-467, 1968.
7. G. F. Cooper. The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence, 42: 393-405, 1990.
8. G. F. Cooper and E. Herskovits. A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9: 309-347, 1992.
9. G. Elidan and S. Gould. Learning bounded treewidth Bayesian networks. Journal of Machine Learning Research, 9: 2699-2731, 2008.
10. A. Frank and A. Asuncion. UCI machine learning repository, 2010.
11. D. Heckerman, D. Geiger, and D. M. Chickering. Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20(3): 197-243, 1995.
12. T. Johnson, N. Robertson, P.D. Seymour, and R. Thomas. Directed tree-width. Journal of Combi- natorial Theory, Series B, 82(1): 138-154, 2001.
13. E. Y. Kang, I. Shpitser, and E. Eskin. Respecting Markov equivalence in computing posterior probabilities of causal graphical features. In 24th AAAI Conference on Artificial Intelligence (AAAI), pages 1175-1180. AAAI Press, 2010.
14. D. Karger and N. Srebro. Learning Markov networks: Maximum bounded tree-width graphs. In 12th ACM- SIAM Symposium on Discrete Algorithms (SODA), pages 392-401, 2001.
15. T. Kloks. Treewidth: Computations and approximations. Springer, 1994.
16. M. Koivisto. Advances in exact Bayesian structure discovery in Bayesian networks. In 22nd Conference on Uncertainty in Artificial Intelligence (UAI), pages 241-248. AUAI Press, 2006.
17. M. Koivisto and K. Sood. Exact Bayesian structure discovery in Bayesian networks. Journal of Machine Learning Research, 5: 549-573, 2004.
18. S. Ordyniak and S. Szeider. Algorithms and complexity results for exact Bayesian structure learning. In 26th Conference on Uncertainty in Artificial Intelligence (UAI), pages 8-11, 2010.
19. S. Ott and S. Miyano. Finding optimal gene networks using biological constraints. Genome Informatics, 14: 124-133, 2003.
20. P. Parviainen and M. Koivisto. Ancestor relations in the presence of unobserved variables. In Euro- pean Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), pages 581-596. Springer, 2011.
21. E. Perrier, S. Imoto, and S. Miyano. Finding optimal Bayesian network given a super-structure. Journal of Machine Learning Research, 9: 2251-2286, 2008.
22. T. Silander and P. Myllymäki. A simple approach for finding the globally optimal Bayesian network structure. In 22nd Conference on Uncertainty in Artificial Intelligence (UAI), pages 445-452. AUAI Press, 2006.
23. A. P. Singh and A. W. Moore. Finding optimal Bayesian networks by dynamic programming. Technical Report CMU-CALD-05-106, Carnegie Mellon University, June 2005.
24. N. Srebro. Maximum likelihood Markov networks: An algorithmic approach. Master's thesis, Massachusetts Institute of Technology, 2000.
25. N. Srebro. Maximum likelihood bounded tree-width Markov networks. In 17th Conference on Uncertainty in Artificial Intelligence (UAI), pages 504-511. AUAI Press, 2001.
26. J. Tian and R. He. Computing posterior probabilities of structural features in Bayesian networks. In 25th Conference on Uncertainty in Artificial Intelligence (UAI), pages 538-547. AUAI Press, 2009.
27. J. van Leeuwen. Graph algorithms. In Handbook of theoretical computer science, Vol. A, pages 525-631. Elsevier, 1990.