Exact structure discovery in Bayesian networks with less space

Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009

Volumn , Issue , 2009, Pages 436-443

  Parviainen, Pekka ^a   Koivisto, Mikko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; STRUCTURAL OPTIMIZATION;

EXACT ALGORITHMS; HAMILTONIAN PATH PROBLEMS; IN-DEGREE; OPTIMAL NETWORK STRUCTURE; PARALLELIZATIONS; RUNNING TIME; SPACE REQUIREMENTS; SPACE-TIME TRADEOFFS;

BAYESIAN NETWORKS;

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

References (17)

1. S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth., 8:277-284, 1987.
2. R. Bellman. Dynamic programming treatment of the travelling salesman problem. J. Assoc. Comput. Mach., 9: 61-63, 1962.
3. A. Björklund and T. Husfeldt. Exact algorithms for exact satisfiability and number of perfect matchings. Algorithmica, 52:226-249, 2008.
4. H. L. Bodlaender, F. V. Fomin, A. M. C. A. Koster, D. Kratsch, and D. M. Thilikos. On exact algorithms for treewidth. In ESA, pages 672-683, 2006. (Pubitemid 44699689)
5. G. F. Cooper and E. Herskovits. A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9:309-347, 1992.
6. D. Eaton and K. Murphy. Exact Bayesian structure learning from uncertain interventions. In Proc. of the 23rd Conference on Uncertainty in Artificial Intelligence and Statistics (AISTAT). Omnipress, 2007. Electronic only.
7. N. Friedman and D. Koller. Being Bayesian about network structure: A Bayesian approach to structure discovery in Bayesian networks. Machine Learning, 50(1-2):95-125, 2003.
8. Y. Gurevich and S. Shelah. Expected computation time for Hamiltonian path problem. SIAM J. Comput., 16: 486-502, 1987. (Pubitemid 17583640)
9. D. Heckerman, D. Geiger, and D. M. Chickering. Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20:197-243, 1995.
10. M. Held and R. Karp. A dynamic programming approach to sequencing problems. J. Soc. Indust. Appl. Math., (10):196-210, 1962.
11. M. Koivisto. Advances in exact Bayesian structure discovery in Bayesian networks. In Proc. of the 22nd Conference on Uncertainty in Artificial Intelligence (UAI), pages 241-248. AUAI Press, 2006.
12. M. Koivisto and K. Sood. Exact Bayesian structure discovery in Bayesian networks. Journal of Machine Learning Research, 5:549-573, 2004.
13. E. Lawler. A comment on minimum feedback arc sets. IEEE Trans. on Circuit Theory, pages 296-297, 1964.
14. S. Ott and S. Miyano. Finding optimal gene networks using biological constraints. Genome Informatics, (14):124-133, 2003.
15. E. Perrier, S. Imoto, and S. Miyano. Finding optimal Bayesian network given a super-structure. Journal of Machine Learning Research, 9:2251-2286, 2008.
16. T. Silander and P. Myllymäki. A simple approach for finding the globally optimal Bayesian network structure. In Proc. of the 22nd Conference on Uncertainty in Artificial Intelligence (UAI), pages 445-452. AUAI Press, 2006.
17. A. Singh and A. Moore. Finding optimal Bayesian networks by dynamic programming. Technical report, Carnegie Mellon University, June 2005.