Learning Bayesian network structure: towards the essential graph by integer linear programming tools
From MaRDI portal
(Redirected from Publication:2440188)
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
Cites work
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 2150792 (Why is no real title available?)
- 10.1162/153244303321897717
- A Computational Study of Search Strategies for Mixed Integer Programming
- A characterization of Markov equivalence classes for acyclic digraphs
- A geometric view on learning Bayesian network structures
- A recovery algorithm for chain graphs
- Branching rules revisited
- CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
- Characteristic imsets for learning Bayesian network structure
- Computer Codes for Problems of Integer Programming
- Efficient structure learning of Bayesian networks using constraints
- Estimating the dimension of a model
- Learning Bayesian networks: The combination of knowledge and statistical data
- 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
- On open questions in the geometric approach to structural learning Bayesian nets
- scientific article; zbMATH DE number 6419207 (Why is no real title available?)
- 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
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)
