Characteristic imsets for learning Bayesian network structure
From MaRDI portal
Publication:2375330
DOI10.1016/J.IJAR.2012.04.001zbMATH Open1281.68183OpenAlexW2045723096MaRDI QIDQ2375330FDOQ2375330
Authors: Raymond Hemmecke, Silvia Lindner, Milan Studený 
Publication date: 13 June 2013
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2012.04.001
Recommendations
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
- On open questions in the geometric approach to structural learning Bayesian nets
- A geometric view on learning Bayesian network structures
- On polyhedral approximations of polytopes for learning Bayesian networks
- Polyhedral approaches to learning Bayesian networks
essential graphstandard imsetcharacteristic imsetlearning Bayesian network structureLP relaxation of a polytope
Cites Work
- Estimating the dimension of a model
- Title not available (Why is that?)
- 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?)
- Approximating discrete probability distributions with dependence trees
- Efficient algorithms for conditional independence inference
- Title not available (Why is that?)
- Efficient structure learning of Bayesian networks using constraints
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- 10.1162/153244303321897717
- On open questions in the geometric approach to structural learning Bayesian nets
- A reconstruction algorithm for the essential graph
- Title not available (Why is that?)
- A geometric view on learning Bayesian network structures
- On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
- Two operations of merging and splitting components in a chain graph
- Polyhedral approach to statistical learning graphical models
Cited In (18)
- Generalized Permutohedra from Probabilistic Graphical Models
- A geometric view on learning Bayesian network structures
- On open questions in the geometric approach to structural learning Bayesian nets
- An alternative characterization of a Bayesian network.
- A reconstruction algorithm for the essential graph
- On polyhedral approximations of polytopes for learning Bayesian networks
- BNC-PSO: structure learning of Bayesian networks by particle swarm optimization
- 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
- Signal propagation in Bayesian networks and its relationship with intrinsically multivariate predictive variables
- The characteristic imset polytope of Bayesian networks with ordered nodes
- Standard imsets for undirected and chain graphical models
- Structural Markov graph laws for Bayesian model uncertainty
- Foundations of compositional models: structural properties
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
- Towards using the chordal graph polytope in learning decomposable models
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
- Polyhedral approaches to learning Bayesian networks
This page was built for publication: Characteristic imsets for learning Bayesian network structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375330)
