A geometric view on learning Bayesian network structures
From MaRDI portal
Publication:985149
DOI10.1016/J.IJAR.2010.01.014zbMATH Open1205.68319OpenAlexW2115395277MaRDI QIDQ985149FDOQ985149
Authors: Milan Studený, Jiří Vomlel, Raymond Hemmecke 
Publication date: 20 July 2010
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2010.01.014
Recommendations
- On open questions in the geometric approach to structural learning Bayesian nets
- On polyhedral approximations of polytopes for learning Bayesian networks
- Characteristic imsets for learning Bayesian network structure
- Polyhedral approaches to learning Bayesian networks
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
Cites Work
- Estimating the dimension of a model
- Title not available (Why is that?)
- A characterization of Markov equivalence classes for acyclic digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lectures on Polytopes
- Title not available (Why is that?)
- 10.1162/153244303321897717
- A reconstruction algorithm for the essential graph
- Title not available (Why is that?)
Cited In (18)
- An information-geometric approach to learning Bayesian network topologies from data
- Generalized Permutohedra from Probabilistic Graphical Models
- Characterization of inclusion neighbourhood in terms of the essential graph
- Algebraic geometry of Bayesian networks
- On open questions in the geometric approach to structural learning Bayesian nets
- VC dimension and inner product space induced by Bayesian networks
- Characterization of inclusion neighbourhood in terms of the essential graph: upper neighbours
- Exact estimation of multiple directed acyclic graphs
- On polyhedral approximations of polytopes for learning Bayesian networks
- 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
- Decomposition of two classes of structural models
- The characteristic imset polytope of Bayesian networks with ordered nodes
- Standard imsets for undirected and chain graphical models
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
- Characteristic imsets for learning Bayesian network structure
- Polyhedral approaches to learning Bayesian networks
Uses Software
This page was built for publication: A geometric view on learning Bayesian network structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985149)
