Towards using the chordal graph polytope in learning decomposable models

DOI10.1016/J.IJAR.2017.06.001zbMATH Open1418.68180OpenAlexW2622142234MaRDI QIDQ2411269FDOQ2411269

Authors: Milan Studený, James Cussens 

Publication date: 20 October 2017

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://eprints.whiterose.ac.uk/118254/1/cussensstud.pdf

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

zbMATH Keywords

integer linear programminglearning decomposable modelsseparation problemchordal graph polytopeclutter inequalitiescharacteristic imset

Mathematics Subject Classification ID

Multivariate analysis (62H99) Learning and adaptive systems in artificial intelligence (68T05) Applications of graph theory (05C90) Integer programming (90C10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Cites Work

• Causation, prediction, and search
• Estimating the dimension of a model
• Learning Bayesian networks: The combination of knowledge and statistical data
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic Networks and Expert Systems
• Title not available (Why is that?)
• 10.1162/153244303321897717
• Decomposable graphical Gaussian model determination
• Title not available (Why is that?)
• Polyhedral aspects of score equivalence in Bayesian network structure learning
• Title not available (Why is that?)
• A microscopic study of minimum entropy search in learning decomposable Markov networks
• Characteristic imsets for learning Bayesian network structure
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools
• Learning maximum weighted \((k+1)\)-order decomposable graphs by integer linear programming
• On polyhedral approximations of polytopes for learning Bayesian networks

Cited In (5)

• Greedy Causal Discovery Is Geometric
• Title not available (Why is that?)
• Learning chordal extensions
• Learning maximum weighted \((k+1)\)-order decomposable graphs by integer linear programming
• The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture

Uses Software

• cdd

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)