Towards using the chordal graph polytope in learning decomposable models

DOI10.1016/j.ijar.2017.06.001zbMath1418.68180OpenAlexW2622142234MaRDI QIDQ2411269

James Cussens, Milan Studený

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

zbMATH Keywords

integer linear programminglearning decomposable modelsseparation problemchordal graph polytopeclutter inequalitiescharacteristic imset

Mathematics Subject Classification ID

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

Related Items (2)

Greedy Causal Discovery Is Geometric ⋮ The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture

Uses Software

• cdd

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A microscopic study of minimum entropy search in learning decomposable Markov networks
• Causation, prediction, and search
• Estimating the dimension of a model
• Learning Bayesian networks: The combination of knowledge and statistical data
• Polyhedral aspects of score equivalence in Bayesian network structure learning
• Characteristic imsets for learning Bayesian network structure
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools
• On Polyhedral Approximations of Polytopes for Learning Bayesian Networks
• Learning Maximum Weighted (k+1)-Order Decomposable Graphs by Integer Linear Programming
• Probabilistic Networks and Expert Systems
• 10.1162/153244303321897717
• Decomposable graphical Gaussian model determination

This page was built for publication: Towards using the chordal graph polytope in learning decomposable models