Advances in Bayesian network learning using integer programming

Uncertainty in Artificial Intelligence - Proceedings of the 29th Conference, UAI 2013

Volumn , Issue , 2013, Pages 182-191

  Barlett, Mark ^a   Cussens, James ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORK LEARNING; DISCRETE OPTIMISATION; GREEDY ALGORITHMS; INTEGER PROGRAM; LEARNING BAYESIAN NETWORKS; LEARNING PROBLEM; LINEAR RELAXATIONS; MULTIDIMENSIONAL 0-1 KNAPSACK PROBLEM;

ARTIFICIAL INTELLIGENCE; INTEGER PROGRAMMING; OPTIMIZATION;

BAYESIAN NETWORKS;

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

References (17)

1. Tobias Achterberg. Constraint Integer Programming. PhD thesis, TU Berlin, July 2007.
2. David Avis. A revised implementation of the reverse search vertex enumeration algorithm. In Gil Kalai and Günter M. Ziegler, editors, Polytopes Combinatorics and Computation, Volume 29 of DMV Seminar, pages 177-198. Birkhuser Basel, 2000.
3. Egon Balas and Shu Ming Ng. On the set covering polytope: 1. All the facets with coefficients in {0,1,2}. Mathematical Programming, 43: 57-69, 1989.
4. Vacláv Chvátal. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics, 4: 305-337, 1973.
5. James Cussens. Bayesian network learning by compiling to weighted MAX-SAT. In Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence (UAI 2008), pages 105-112, Helsinki, 2008. AUAI Press.
6. James Cussens. Bayesian network learning with cutting planes. In Fabio G. Cozman and Avi Pfeffer, editors, Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence (UAI 2011), pages 153-160, Barcelona, 2011. AUAI Press.
7. James Cussens. Column generation for exact BN learning: Work in progress. In Proc. ECAI-2012 workshop on COmbining COnstraint solving with MIning and LEarning (CoCoMile 2012), 2012.
8. James Cussens, Mark Bartlett, Elinor M. Jones, and Nuala A. Sheehan. Maximum likelihood pedigree reconstruction using integer linear programming. Genetic Epidemiology, 37(1): 69-83, Janary 2013.
9. Cassio de Campos and Qiang Ji. Properties of Bayesian Dirichlet scores to learn Bayesian network structures. In AAAI-10, pages 431-436, 2010.
10. Michel X. Goemans and Leslie A. Hall. The strongest facets of the acyclic subgraph polytope are unknown. In Integer Programming and Combinatorial Optimization, Volume 1084 of Lectures Notes in Computer Science, pages 415-429. Springer, 1996.
11. Martin Grötschel, Michael Jünger, and Gerhard Reinelt. On the acyclic subgraph polytope. Mathematical Programming, 33(1): 28-42, 1985.
12. Raymond Hemmecke, Silvia Lindner, and Milan Studeńy. Characteristic imsets for learning Bayesian network structure. International Journal of Approximate Reasoning, 53: 1336-1349, 2012.
13. Tommi Jaakkola, David Sontag, Amir Globerson, and Marina Meila. Learning Bayesian network structure using LP relaxations. In Proceedings of 13th International Conference on Artificial Intelligence and Statistics (AISTATS 2010), Volume 9, pages 358-365, 2010. Journal of Machine Learning Research Workshop and Conference Proceedings.
14. Daphne Koller and Nir Friedman. Probabilistic Graphical Models: Principles and Techniques. MIT Press, 2009.
15. Tomi Silander and Petri Myllymäki. 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-45, 2006.
16. Laurence A. Wolsey. Integer Programming. John Wiley, 1998.
17. Changhe Yuan and Brandon Malone. An improved admissible heuristic for learning optimal Bayesian networks. In Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence (UAI-12), Catalina Island, CA, 2012.