Learning maximum weighted (k+1)-order decomposable graphs by integer linear programming

DOI10.1007/978-3-319-11433-0_26MaRDI QIDQ2938422zbMATH OpenOpenAlexFDO

Authors Aritz Pérez, Christian Blum, José A. Lozano

Publication date 14 January 2015

Published in Probabilistic Graphical Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-11433-0_26

zbMATH Keywords

integer linear programmingbounded clique sizedecomposable graphmaximum weighted graph problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Integer programming (90C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Recommendations

• Towards using the chordal graph polytope in learning decomposable models
• Efficient approximation of probability distributions with \(k\)-order decomposable models
• Learning discrete decomposable graphical models via constraint optimization
• Learning Markov networks: Maximum bounded tree-width graphs
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools

Cited in

(3)

• The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
• Towards using the chordal graph polytope in learning decomposable models
• Learning discrete decomposable graphical models via constraint optimization

This page was built for publication: Learning maximum weighted \((k+1)\)-order decomposable graphs by integer linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938422)