Learning Bayesian network structure: towards the essential graph by integer linear programming tools
DOI10.1016/J.IJAR.2013.09.016zbMATH Open1390.68678OpenAlexW1980545402MaRDI QIDQ2440188FDOQ2440188
Authors: Milan Studený, David C. Haws 
Publication date: 27 March 2014
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2013.09.016
Recommendations
- Characteristic imsets for learning Bayesian network structure
- Integer linear programming for the Bayesian network structure learning problem
- Polyhedral approaches to learning Bayesian networks
- On polyhedral approximations of polytopes for learning Bayesian networks
- Bayesian network structure learning with integer programming: polytopes, facets and complexity
Learning and adaptive systems in artificial intelligence (68T05) Applications of graph theory (05C90) Reasoning under uncertainty in the context of artificial intelligence (68T37) Integer programming (90C10)
Cites Work
- Estimating the dimension of a model
- A characterization of Markov equivalence classes for acyclic digraphs
- Learning Bayesian networks: The combination of knowledge and statistical data
- Title not available (Why is that?)
- A Computational Study of Search Strategies for Mixed Integer Programming
- Title not available (Why is that?)
- Efficient structure learning of Bayesian networks using constraints
- Branching rules revisited
- 10.1162/153244303321897717
- Computer Codes for Problems of Integer Programming
- A geometric view on learning Bayesian network structures
- A recovery algorithm for chain graphs
- CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
- Characteristic imsets for learning Bayesian network structure
- On polyhedral approximations of polytopes for learning Bayesian networks
- Polyhedral approach to statistical learning graphical models
Cited In (14)
- Bayesian network structure learning with integer programming: polytopes, facets and complexity
- A geometric view on learning Bayesian network structures
- Title not available (Why is that?)
- On open questions in the geometric approach to structural learning Bayesian nets
- A reconstruction algorithm for the essential graph
- Learning Moral Graphs in Construction of High-Dimensional Bayesian Networks for Mixed Data
- Polyhedral approach to statistical learning graphical models
- Learning maximum weighted \((k+1)\)-order decomposable graphs by integer linear programming
- Polyhedral aspects of score equivalence in Bayesian network structure learning
- The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
- Towards using the chordal graph polytope in learning decomposable models
- Characteristic imsets for learning Bayesian network structure
- Integer linear programming for the Bayesian network structure learning problem
- Polyhedral approaches to learning Bayesian networks
Uses Software
This page was built for publication: Learning Bayesian network structure: towards the essential graph by integer linear programming tools
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2440188)
