Entropy-based pruning for learning Bayesian networks using BIC

Artificial Intelligence - Tập 260 - Trang 42-50 - 2018
Cassio P. de Campos1,2, Mauro Scanagatta3, Giorgio Corani3, Marco Zaffalon3
1Utrecht University, The Netherlands
2Queen’s University, Belfast, United Kingdom
3Istituto Dalle Molle di Studi Sull'Intelligenza Artificiale (IDSIA), Lugano, Switzerland

Tài liệu tham khảo

Pearl, 1988 Chickering, 2014, Large-sample learning of Bayesian networks is NP-hard, J. Mach. Learn. Res., 5, 1287 Heckerman, 1995, Learning Bayesian networks: the combination of knowledge and statistical data, Mach. Learn., 20, 197, 10.1007/BF00994016 Koivisto, 2006, Parent assignment is hard for the MDL, AIC, and NML costs, 289 Cooper, 1992, A Bayesian method for the induction of probabilistic networks from data, Mach. Learn., 9, 309, 10.1007/BF00994110 Schwarz, 1978, Estimating the dimension of a model, Ann. Stat., 6, 461, 10.1214/aos/1176344136 de Campos, 2011, Efficient structure learning of Bayesian networks using constraints, J. Mach. Learn. Res., 12, 663 Bartlett, 2017, Integer linear programming for the Bayesian network structure learning problem, Artif. Intell., 24, 258, 10.1016/j.artint.2015.03.003 Teyssier, 2005, Ordering-based search: a simple and effective algorithm for learning Bayesian networks, 584 de Campos, 2009, Structure learning of Bayesian networks using constraints, 113 Lichman Tian, 2000, A branch-and-bound algorithm for MDL learning Bayesian networks, 580 de Campos, 2010, Properties of Bayesian Dirichlet score to learn Bayesian network structures, 431