Characteristic imsets for learning Bayesian network structure

International Journal of Approximate Reasoning

Volumn 53, Issue 9, 2012, Pages 1336-1349

  Hemmecke, Raymond ^a   Lindner, Silvia ^a   Studený, Milan ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

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

Author keywords

Characteristic imset; Essential graph; Learning Bayesian network structure; LP relaxation of a polytope; Standard imset

Indexed keywords

CHARACTERISTIC IMSET; ESSENTIAL GRAPH; LEARNING BAYESIAN NETWORKS; POLYTOPES; STANDARD IMSET;

VECTORS;

BAYESIAN NETWORKS;

EID: 84869095652     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2012.04.001     Document Type: Conference Paper

References (31)

1. S.A. Andersson, D. Madigan, and M.D. Perlman A characterization of Markov equivalence classes for acyclic digraphs Annals of Statistics 25 1997 505 541
2. S.A. Andersson, D. Madigan, and M.D. Perlman On the Markov equivalence of chain graphs, undirected graphs, and acyclic digraphs Scandinavian Journal of Statistics 24 1997 81 102
3. R.R. Bouckaert, Bayesian belief networks: from construction to evidence, Ph.D. thesis, University of Utrecht, 1995.
4. R.R. Bouckaert, R. Hemmecke, S. Lindner, and M. Studený Efficient algorithms for conditional independence inference Journal of Machine Learning Research 11 2010 3453 3479
5. D.M. Chickering Optimal structure identification with greedy search Journal of Machine Learning Research 3 2002 507 554
6. C.K. Chow, and C.N. Liu Approximating discrete probability distributions with dependence trees IEEE Transactions on Information Theory 14 1968 462 467
7. J. Cussens, Bayesian network learning with cutting planes, in: Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, AUAI Press, 2011, pp. 153-160.
8. C.P. de Campos, Z. Zeng, Q. Ji, Structure learning Bayesian networks using constraints, in: Proceedings of the 26th International Conference on Machine Learning (ICML), Montreal, Canada, 2009, pp. 113-120.
9. C.P. de Campos, and Q. Ji Efficient structure learning Bayesian networks using constraints Journal of Machine Learning Research 12 2011 663 689
10. M. Frydenberg The chain graph Markov property Scandinavian Journal of Statistics 17 1990 333 353
11. T. Jaakkola, D. Sontag, A. Globerson, M. Meila, Learning Bayesian network structure using LP relaxations, in: JMLR Workshop and Conference Proceedings, vol. 9: AISTATS, 2010, pp. 358-365.
12. D. Heckerman, D. Geiger, and D.M. Chickering Learing Bayesian networks: the combination of knowledge and statistical data Machine Learning 20 1995 194 243
13. S.L. Lauritzen Graphical Models 1996 Clarendon Press
14. S. Lindner, Discrete optimization in machine learning - learning Bayesian network structures and conditional independence implication, Ph.D. thesis, TU Munich, 2012.
15. C. Meek, Causal inference and causal explanation with background knowledge, in: Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, 1995, pp. 403-410.
16. R.E. Neapolitan Learning Bayesian Networks 2004 Pearson Prentice Hall
17. M. Niepert, Logical inference algorithms and matrix representations for probabilistic conditional independence, in: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, AUAI Press, 2009, pp. 428-435.
18. J. Pearl Probabilistic Reasoning in Intelligent Systems 1988 Morgan Kaufmann
19. A. Schrijver Theory of Linear and Integer Programming 1986 John Wiley
20. A. Schrijver Combinatorial Optimization - Polyhedra and Efficiency vol. B 2003 Springer Verlag
21. G.E. Schwarz Estimation of the dimension of a model Annals of Statistics 6 1978 461 464
22. M. Studený Probabilistic Conditional Independence Structures 2005 Springer Verlag
23. M. Studený, Mathematical aspects of learning Bayesian networks: Bayesian quality criteria, research report no. 2234, Institute of Information Theory and Automation, Prague, December 2008.
24. M. Studený, and J. Vomlel A reconstruction algorithm for the essential graph International Journal of Approximate Reasoning 50 2009 385 413
25. M. Studený, A. Roverato, and Š. Štěpá nová Two operations of merging and splitting components in a chain graph Kybernetika 45 2009 208 248
26. M. Studený, J. Vomlel, and R. Hemmecke A geometric view on learning Bayesian network structures International Journal of Approximate Reasoning 51 2010 578 586
27. M. Studený, R. Hemmecke, S. Lindner, Characteristic imset: a simple algebraic representative of a Bayesian network structure, in: P. Myllymäki, T. Roos, T. Jaakkola (Eds.), Proceedings of the 5th European Workshop on Probabilistic Graphical Models, HIIT Publications, 2010, pp. 257-264.
28. M. Studený, and J. Vomlel On open questions in the geometric approach to structural learning Bayesian nets International Journal of Approximate Reasoning 52 2011 627 640
29. M. Studený, D. Haws, On polyhedral approximations of polytopes for learning Bayes nets, research report no. 2303 Institute of Information Theory and Automation of the ASCR, Prague, July 2011. Also available on .
30. M. Studený, D. Haws, R. Hemmecke, S. Lindner, Polyhedral approach to statistical learning graphical models, in: Proceedings of the 2nd CREST-SBM International Conference Harmony of Gröbner Bases and the Modern Industrial Society, World Scientific, 2012, pp. 346-372, in press.
31. T. Verma, J. Pearl, Equivalence and synthesis of causal models, in: Proceedings of the 6th Conference on Uncertainty in Artificial Intelligence, Elsevier, 1991, pp. 220-227.