Learning Bayesian network structure: Towards the essential graph by integer linear programming tools

International Journal of Approximate Reasoning

Volumn 55, Issue 4, 2014, Pages 1043-1071

  Studený, Milan ^a   Haws, David ^b  

^a INSTITUTE OF INFORMATION THEORY AND AUTOMATION   (Czech Republic)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Characteristic imset; Essential graph; Integer linear programming; Learning Bayesian network structure

Indexed keywords

INTEGER PROGRAMMING;

ACYCLIC DIRECTED GRAPH; CHARACTERISTIC IMSET; COMPUTATIONAL EXPERIMENT; ESSENTIAL GRAPH; GEOMETRIC APPROACHES; INTEGER LINEAR PROGRAMMING; LEARNING BAYESIAN NETWORKS; LINEAR INEQUALITIES;

BAYESIAN NETWORKS;

EID: 84896545829     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2013.09.016     Document Type: Article

References (32)

1. T. Achterberg, T. Koch, and A. Martin Branching rules revisited Oper. Res. Lett. 33 2005 42 54
2. S.A. Andersson, D. Madigan, and M.D. Perlman A characterization of Markov equivalence classes for acyclic digraphs Ann. Stat. 25 1997 505 541
3. R.R. Bouckaert Bayesian belief networks: from construction to evidence PhD thesis 1995 University of Utrecht
4. A. Cano, M. Gómez-Olmedo, A.R. Masegosa, and S. Moral Locally averaged Bayesian Dirichlet metrics for learning the structure and the parameters of Bayesian networks Int. J. Approx. Reason. 54 4 2013 526 540
5. D.M. Chickering Optimal structure identification with greedy search J. Mach. Learn. Res. 3 2002 507 554
6. J. Cussens Maximum likelihood pedigree reconstruction using integer programming Proceedings of the Workshop on Constraint Based Methods for Bioinformatics (WCBMB) 2010 9 19
7. J. Cussens Bayesian network learning with cutting planes Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence (UAI) 2011 153 160
8. J. Cussens, M. Bartlett, E.M. Jones, and N.A. Sheehan Maximum likelihood pedigree reconstruction using integer programming Genet. Epidemiol. 37 1 2013 69 83
9. C.P. de Campos, Z. Zeng, and Q. Ji Structure learning Bayesian networks using constraints Proceedings of the 26th International Conference on Machine Learning (ICML) 2009 113 120
10. C.P. de Campos, and Q. Ji Efficient structure learning Bayesian networks using constraints J. Mach. Learn. Res. 12 2011 663 689
11. D. Heckerman, D. Geiger, and D.M. Chickering Learning Bayesian networks: the combination of knowledge and statistical data Mach. Learn. 20 1995 194 243
12. R. Hemmecke, S. Lindner, and M. Studený Characteristic imsets for learning Bayesian network structure Int. J. Approx. Reason. 53 2012 1336 1349
13. T. Jaakkola, D. Sontag, A. Globerson, and M. Meila Learning Bayesian network structure using LP relaxations Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS) 2010 358 365
14. A. Land, and S. Powell Computer codes for problems of integer programming Ann. Discrete Math. 5 1979 221 269
15. S.L. Lauritzen Graphical Models 1996 Clarendon Press
16. J.T. Linderoth, and M.W.P. Savelsbergh A computational study of search strategies for mixed integer programming INFORMS J. Comput. 11 1999 173 187
17. S. Lindner Discrete optimization in machine learning: learning Bayesian network structures and conditional independence implication PhD thesis 2012 TU Munich
18. R.E. Neapolitan Learning Bayesian Networks 2004 Pearson Prentice Hall
19. G.E. Schwarz Estimation of the dimension of a model Ann. Stat. 6 1978 461 464
20. M. Studený A recovery algorithm for chain graphs Int. J. Approx. Reason. 17 1997 265 293 (Pubitemid 127399854)
21. M. Studený Characterization of essential graphs by means of the operation of legal merging of components Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 12 2004 43 62
22. M. Studený Probabilistic Conditional Independence Structures 2005 Springer
23. M. Studený, J. Vomlel, and R. Hemmecke A geometric view on learning Bayesian network structures Int. J. Approx. Reason. 51 2010 578 586
24. M. Studený, R. Hemmecke, and S. Lindner Characteristic imset: a simple algebraic representative of a Bayesian network structure Proceedings of the 5th European Workshop on Probabilistic Graphical Models (PGM) 2010 257 264
25. M. Studený Integer linear programming approach to learning Bayesian network structure: towards the essential graph Proceedings of the 6th European Workshop on Probabilistic Graphical Models (PGM) 2012 307 314
26. M. Studený, D. Haws, R. Hemmecke, and S. Lindner Polyhedral approach to statistical learning graphical models T. Hibi, Harmony of Gröbner Bases and the Modern Industrial Society: the 2nd CREST-SBM International Conference 2012 World Scientific 346 372
27. M. Studený LP relaxations and pruning for characteristic imsets research report n. 2323 June 2012 Institute of Information Theory and Automation of the ASCR Prague also available at http://staff.utia.cas.cz/studeny/f18.html
28. M. Studený, and D. Haws On polyhedral approximations of polytopes for learning Bayesian networks J. Algebr. Stat. 4 2013 59 92
29. M. Teyssier, and D. Koller Ordering-based search: a simple and effective algorithm for learning Bayesian networks Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (UAI) 2005 584 590
30. T. Verma, and J. Pearl Equivalence and synthesis of causal models Proceedings of the 6th Conference on Uncertainty in Artificial Intelligence (UAI) 1991 220 227
31. I.L.O.G. CPLEX, reference manual, 2013, http://www.ilog.com/products/ cplex.
32. GOBNILP, a web page, 2013, http://www.cs.york.ac.uk/aig/sw/gobnilp.