Algorithms and complexity results for exact Bayesian structure learning

Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, UAI 2010

Volumn , Issue , 2010, Pages 401-408

  Ordyniak, Sebastian ^a   Szeider, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Bayesian structure learning; Fixed parameter tractability; Parameterized complexity; Super structure; Treewidth

Indexed keywords

ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; NP-HARD; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

BAYESIAN STRUCTURE LEARNING; FIXED-PARAMETER TRACTABILITY; PARAMETERIZED COMPLEXITY; SUPER-STRUCTURES; TREE-WIDTH;

COMPLEX NETWORKS;

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

References (19)

1. Anton, C., and Carlos, G. 2007. Efficient principled learning of thin junction trees. In Advances in Neural Information Processing Systems (NIPS 2007)
2. Bodlaender, H. L. 1996. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6):1305-1317 (Pubitemid 126584672)
3. Chickering, D. M. 1995. A transformational characterization of equivalent Bayesian network structures. In UAI 1995
4. Chickering, D. M. 1996. Learning Bayesian networks is NP-complete. In Learning from Data: Artificial Intelligence and Statistics, Springer Verlag. 121-130
5. Chickering, D. M. 2003. Optimal structure identification with greedy search. J. Mach. Learn. Res. 3(3):507-554
6. Downey, R. G., and Fellows, M. R. 1999. Parameterized Complexity. Springer Verlag
7. Flum, J., and Grohe, M. 2006. Parameterized Complexity Theory. Springer Verlag
8. Gogate, V., and Dechter, R. 2004. A complete anytime algorithm for treewidth. In UAI 2004
9. 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
10. Impagliazzo, R.; Paturi, R.; and Zane, F. 2001. Which problems have strongly exponential complexity? J. Comput. System Sci. 63(4):512-530 (Pubitemid 34325767)
11. Karp, R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations. 85-103
12. Kloks, T. 1994. Treewidth: Computations and Approximations. Springer Verlag
13. Mukund, N., and Jeff, B. 2004. PAC-learning bounded tree-width graphical models. In UAI 2004
14. Parviainen, P., and Koivisto, M. 2009. Exact structure discovery in Bayesian networks with less space. In UAI 2009
15. Perrier, E.; Imoto, S.; and Miyano, S. 2008. Finding optimal Bayesian network given a super-structure. J. Mach. Learn. Res. 9:2251-2286
16. Pieter, A.; Daphne, K.; and Andrew, Y. N. 2006. Learning factor graphs in polynomial time and sample complexity. J. Mach. Learn. Res. 7:1743-1788
17. Pietrzak, K. 2003. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. Comput. System Sci. 67(4):757-771
18. Silander, T., and Myllymäki, P. 2006. A simple approach for finding the globally optimal Bayesian network structure. In UAI 2006
19. Szeider, S. 2009. The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT. In SAT 2009. Lecture Notes in Computer Science 5584, Springer Verlag, 276-283