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

Volumn , Issue , 2012, Pages 307-314

  Studení, Milan ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC DIRECTED GRAPH; CHAIN GRAPH; ESSENTIAL GRAPH; GEOMETRIC APPROACHES; GLOBAL MAXIMUM; ILP OPTIMIZATIONS; INTEGER LINEAR PROGRAMMING; LEARNING BAYESIAN NETWORKS; LINEAR INEQUALITIES; THEORETICAL RESULT; ZERO-ONE;

BAYESIAN NETWORKS; INTEGER PROGRAMMING;

INDUCTIVE LOGIC PROGRAMMING (ILP);

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

References (21)

1. Steen A. Andersson, David Madigan and Michael D. Perlman. 1997. A characterization of Markov equivalence classes for acyclic digraphs. Annals of Statistics, 25(2):505-541.
2. Remco R. Bouckaert. 1995. Bayesian belief networks: from construction to evidence. PhD thesis, University of Utrecht.
3. David M. Chickering. 2002. Optimal structure identification with greedy search. Journal of Machine Learning Research, 3:507-554.
4. James Cussens. 2010. Maximum likelihood pedigree reconstruction using integer programming. In Workshop on Constraint Based Methods for Bioinformat-ics, pages 9-19.
5. James Cussens. 2011. Bayesian network learning with cutting planes. In 27th Conference on Uncertainty in Artificial Intelligence, pages 153-160.
6. Cassio P. de Campos, Zhi Zeng and Qiang Ji. 2009. Structure learning Bayesian networks using constraints. In 26th International Conference on Machine Learning, pages 113-120.
7. Cassio P. de Campos and Qiang Ji. 2011. Efficient structure learning Bayesian networks using constraints. Journal of Machine Learning Research, 12:663-689.
8. David Heckerman, Dan Geiger and David M. Chickering. 1995. Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning, 20:194-243.
9. Raymond Hemmecke, Silvia Lindner and Milan Studeny. 2012. Characteristic imsets for learning Bayesian network structure. To appear in International Journal of Approximate Reasoning, see doi:10.l0l6/j.ijar.20l2.04.00l.
10. Tommi Jaakkola, David Sontag, Amir Globerson and Marina Meila. 2010. Learning Bayesian network structure using LP relaxations. In JMLR Workshop and Conference Proceedings, volume 9: AISTATS, pages 358-365.
11. Steffen L. Lauritzen. 1996. Graphical Models, Clarendon Press.
12. Silvia Lindner. 2012. Discrete optimization in machine learning-learning Bayesian network structures and conditional independence implication. PhD thesis, TU Munich.
13. Gideon E. Schwarz. 1978. Estimation of the dimension of a model. Annals of Statistics, 6:461-464.
14. Milan Studeny. 2004. Characterization of essential graphs by means of the operation of legal merging of components. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 12:43-62.
15. Milan Studeny. 2005. Probabilistic Conditional Independence Structures, Springer Verlag.
16. Milan Studeny, Jifi Vomlel and Raymond Hemmecke. 2010. A geometric view on learning Bayesian network structures. International Journal of Approximate Reasoning, 51(5):578-586.
17. Milan Studeny, Raymond Hemmecke and Silvia Lindner. 2010. Characteristic imset: a simple algebraic representative of a Bayesian network structure. In 5th European Workshop on Probabilistic Graphical Models, pages 257-264.
18. Milan Studeny and David Haws. 2012. On polyhedral approximations of polytopes for learning Bayesian networks. Submitted to Journal of Algebraic Statistics; previous working paper available on http ://arxiv.org/abs/1107.4708.
19. Milan Studeny, David Haws, Raymond Hemmecke and Silvia Lindner. 2012. Polyhedral approach to statistical learning graphical models. In 2nd CREST-SBM International Conference, World Scientific, pages 346-372.
20. Milan Studeny. 2012. LP relaxations and pruning for characteristic imsets. Research report n. 2323, Institute of Information Theory and Automation of the ASCR; available through staff.utia.cas.cz/studeny/f18.html.
21. Thomas Verma and Judea Pearl. 1991. Equivalence and synthesis of causal models. In 6th Conference on Uncertainty in Artificial Intelligence, pages 220-227.