Efficient structure learning of Bayesian networks using constraints

Journal of Machine Learning Research

Volumn 12, Issue , 2011, Pages 663-689

  De Campos, Cassio P ^a   Ji, Qiang ^b  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Bayesian networks; Branch and bound technique; Properties of decomposable scores; Structural constraints; Structure learning

Indexed keywords

AKAIKE INFORMATION CRITERION; BAYESIAN INFORMATION CRITERION; BOUND ALGORITHMS; BRANCH-AND-BOUND TECHNIQUE; DATA SETS; DIRICHLET; DYNAMIC BAYESIAN NETWORK; GLOBAL OPTIMALITY; LEARNING BAYESIAN NETWORKS; MEMORY COST; MINIMUM DESCRIPTION LENGTH; PROPERTIES OF DECOMPOSABLE SCORES; SCORE FUNCTION; STATE-OF-THE-ART METHODS; STRUCTURAL CONSTRAINTS; STRUCTURE LEARNING;

ALGORITHMS; DISTRIBUTED PARAMETER NETWORKS; INFERENCE ENGINES; INTELLIGENT NETWORKS; SPEECH RECOGNITION; STRUCTURAL PROPERTIES;

BAYESIAN NETWORKS;

EID: 79955857786     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. H. Akaike. A new look at the statistical model identification. IEEE Transactions on Automatic Control, 19(6):716-723, 1974.
2. D. L. Applegate, R. E. Bixby, V. Chv́atal, and W. J. Cook. The Traveling Salesman Problem: A Computational Study. Princeton Univ. Press, 2006.
3. A. Asuncion and D.J. Newman. UCI machine learning repository, 2007. URL http://www.ics.uci.edu/~mlearn/MLRepository.html.
4. R. Bouckaert. Properties of Bayesian belief network learning algorithms. In Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, UAI'94, pages 102-109, San Francisco, CA, 1994. Morgan Kaufmann.
5. W. Buntine. Theory refinement on Bayesian networks. In Proceedings of the 8th Annual Conference on Uncertainty in Artificial Intelligence, UAI'92, pages 52-60, San Francisco, CA, 1991. Morgan Kaufmann.
6. D. M. Chickering. Optimal structure identiication with greedy search. Journal of Machine Learning Research, 3:507-554, 2002.
7. D. M. Chickering, C. Meek, and D. Heckerman. Large-sample learning of Bayesian networks is np-hard. In Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence, UAI'03, pages 124-13, San Francisco, CA, 2003. Morgan Kaufmann.
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. C. P. de Campos, Z. Zeng, and Q. Ji. Structure learning of Bayesian networks using constraints. In Proceedings of the 26th International Conference on Machine Learning, ICML'09, pages 113-120, Montreal, 2009. Omnipress.
10. D. Heckerman, D. Geiger, and D. M. Chickering. Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning, 20:197-243, 1995.
11. T. Jaakkola, D. Sontag, A. Globerson, and M. Meila. Learning Bayesian Network Structure using LP Relaxations. In Proceedings of the 13th International Conference on Artificial Intelligence and Statistics, AISTATS'10, pages 358-365, 2010.
12. M. Koivisto. Advances in exact Bayesian structure discovery in Bayesian networks. In Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence, UAI'06, pages 241-248. AUAI Press, 2006.
13. M. Koivisto and K. Sood. Exact Bayesian Structure Discovery in Bayesian Networks. Journal of Machine Learning Research, 5:549-573, 2004.
14. K. Kojima, E. Perrier, S. Imoto, and S. Miyano. Optimal search on clustered structural constraint for learning Bayesian network structure. Journal of Machine Learning Research, 11:285-310, 2010.
15. S. Ott and S. Miyano. Finding optimal gene networks using biological constraints. Genome Informatics, 14:124-133, 2003.
16. P. Parviainen and M. Koivisto. Exact structure discovery in Bayesian networks with less space. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI'09, pages 436-443, Arlington, Virginia, United States, 2009. AUAI Press.
17. F. Pernkopf and J. Bilmes. Discriminative versus generative parameter and structure learning of Bayesian network classiiers. In Proceedings of the 22nd International Conference on Machine Learning, ICML'05, pages 657-664, New York, NY, USA, 2005. ACM. (Pubitemid 43183390)
18. E. Perrier, S. Imoto, and S. Miyano. Finding optimal Bayesian network given a super-structure. Journal of Machine Learning Research, 9:2251-2286, 2008.
19. G. Schwarz. Estimating the dimension of a model. The Annals of Statistics, 6(2):461-464, 1978.
20. T. Silander and P. Myllymaki. A simple approach for finding the globally optimal Bayesian network structure. In Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence, UAI'06, pages 445-452, Arlington, Virginia, 2006. AUAI Press.
21. A. P. Singh and A. W. Moore. Finding optimal Bayesian networks by dynamic programming. Technical report, Carnegie Mellon University, 2005. CMU-CALD-05-106.
22. P. Spirtes, C. Glymour, and R. Scheines. Causation, Prediction and Search. Springer-Verlag, New York, 1993 .
23. J. Suzuki. Learning Bayesian belief networks based on the minimum description length principle: An efficient algorithm using the B&B technique. In Proceedings of the 13th International Conference on Machine Learning, ICML 96, pages 462-470, 1996.
24. M. Teyssier and D. Koller. Ordering-based search: A simple and effective algorithm for learning Bayesian networks. In Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 05, pages 584-590, 2005.
25. I. Tsamardinos, L. E. Brown, and C. Aliferis. The max-min hill-climbing Bayesian network structure learning algorithm. Machine Learning, 65(1):31-78, 2006. (Pubitemid 44451193)