Memory-efficient dynamic programming for learning optimal Bayesian networks

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2011, Pages 1057-1062

  Malone, Brandon ^a   Yuan, Changhe ^a   Hansen, Eric A ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINOMIAL COEFFICIENTS; DATA SETS; DYNAMIC PROGRAMMING ALGORITHM; LAYERED STRUCTURES; MEMORY REQUIREMENTS; OPTIMAL STRUCTURES; RECURSIVE DECOMPOSITION; TRAINING DATA;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; C (PROGRAMMING LANGUAGE); COMPUTER SYSTEMS PROGRAMMING; DISTRIBUTED PARAMETER NETWORKS; INFERENCE ENGINES; INTELLIGENT NETWORKS; STRUCTURAL OPTIMIZATION;

DYNAMIC PROGRAMMING;

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

References (11)

1. Chickering, D. M. 1996. Learning bayesian networks is np-complete. In Learning from Data: Artificial Intelligence and Statistics, V, 121-130. Springer-Verlag.
2. de Campos, C. P.; Zeng, Z.; and Ji, Q. 2009. Structure learning of bayesian networks using constraints. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, 113-120. New York, NY, USA: ACM.
3. Frank, A., and Asuncion, A. 2010. UCl machine learning repository.
4. Heckerman, D. 1995. A tutorial on learning bayesian networks. Technical report, Microsoft Research.
5. Knuth, D. E. 2009. The Art of Computer Programming, Volume 4, Fascicles 0-4. Addison-Wesley Professional, 1st edition.
6. Koivisto, M., and Sood, K. 2004. Exact bayesian structure discovery in bayesian networks. 549-573-.
7. Moore, A., and Lee, M. S. 1998. Cached sufficient statistics for efficient machine learning with large datasets. J. Artif. Int. Res. 8:67-91. (Pubitemid 128636194)
8. Rissanen, J. 1978. Modeling by shortest data description. Automatica 14:465-471.
9. Silander, T., and Myllymaki, P. 2006. A simple approach for finding the globally optimal bayesian network structure. In Proceedings of the 22nd Annual Conference on Uncertainty in Artificial Intelligence (UAI-06), -. Arlington, Virginia: AUAl Press.
10. Singh, A., and Moore, A. 2005. Finding optimal bayesian networks by dynamic programming. Technical report, Carnegie Mellon University.
11. Tian, J. 2000. A branch-and-bound algorithm for mdl learning bayesian networks.