Learning Bayesian network structure: towards the essential graph by integer linear programming tools
From MaRDI portal
Publication:2440188
DOI10.1016/j.ijar.2013.09.016zbMath1390.68678OpenAlexW1980545402MaRDI QIDQ2440188
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
Applications of graph theory (05C90) Integer programming (90C10) Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (4)
Polyhedral aspects of score equivalence in Bayesian network structure learning ⋮ Towards using the chordal graph polytope in learning decomposable models ⋮ Polyhedral approaches to learning Bayesian networks ⋮ The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A geometric view on learning Bayesian network structures
- Estimating the dimension of a model
- A characterization of Markov equivalence classes for acyclic digraphs
- A recovery algorithm for chain graphs
- Branching rules revisited
- Learning Bayesian networks: The combination of knowledge and statistical data
- Characteristic imsets for learning Bayesian network structure
- Polyhedral Approach to Statistical Learning Graphical Models
- On Polyhedral Approximations of Polytopes for Learning Bayesian Networks
- Computer Codes for Problems of Integer Programming
- A Computational Study of Search Strategies for Mixed Integer Programming
- 10.1162/153244303321897717
- CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
This page was built for publication: Learning Bayesian network structure: towards the essential graph by integer linear programming tools
