Towards using the chordal graph polytope in learning decomposable models
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5968958
- Learning discrete decomposable graphical models via constraint optimization
- Polyhedral approach to statistical learning graphical models
- Decomposition of structural learning about directed acyclic graphs
- A new algorithm for decomposition of graphical models
- Characterizations and algorithmic applications of chordal graph embeddings
- A decomposition-based algorithm for learning the structure of multivariate regression chain graphs
- Chordal Graphs to Identify Graphical Model Solutions of Maximum of Entropy Under Constraints on Marginals
- On polyhedral approximations of polytopes for learning Bayesian networks
- Polyhedral approaches to learning Bayesian networks
Cites work
- 10.1162/153244303321897717
- A microscopic study of minimum entropy search in learning decomposable Markov networks
- Causation, prediction, and search
- Characteristic imsets for learning Bayesian network structure
- Decomposable graphical Gaussian model determination
- Estimating the dimension of a model
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 2150792 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
- Learning Bayesian networks: The combination of knowledge and statistical data
- Learning maximum weighted (k+1)-order decomposable graphs by integer linear programming
- On polyhedral approximations of polytopes for learning Bayesian networks
- Polyhedral aspects of score equivalence in Bayesian network structure learning
- Probabilistic Networks and Expert Systems
Cited in
(7)- Chordal graph models of contingency tables
- Learning chordal extensions
- The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
- Learning maximum weighted (k+1)-order decomposable graphs by integer linear programming
- scientific article; zbMATH DE number 5968958 (Why is no real title available?)
- Greedy Causal Discovery Is Geometric
- Hyperplane representations of interventional characteristic imset polytopes
This page was built for publication: Towards using the chordal graph polytope in learning decomposable models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2411269)
