On polyhedral approximations of polytopes for learning Bayesian networks

DOI10.18409/JAS.V4I1.19MaRDI QIDQ2819996zbMATH OpenOpenAlexFDO

Authors Milan Studený, David C. Haws

Publication date 13 September 2016

Published in Journal of Algebraic Statistics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/f417a540bd4c04463dbc21da28630536b69d36eb

zbMATH Keywords

Bayesian network structure learningcharacteristic imsetinteger programmingLP relaxationstandard imset

Mathematics Subject Classification ID

Matrices of integers (15B36) Multivariate analysis (62H99) Graph theory (including graph drawing) in computer science (68R10) Integer programming (90C10)

Recommendations

• Polyhedral approaches to learning Bayesian networks
• On open questions in the geometric approach to structural learning Bayesian nets
• A geometric view on learning Bayesian network structures
• Characteristic imsets for learning Bayesian network structure
• Polyhedral approach to statistical learning graphical models

Cited in

(8)

• Polyhedral aspects of score equivalence in Bayesian network structure learning
• Characteristic imsets for learning Bayesian network structure
• Towards using the chordal graph polytope in learning decomposable models
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools
• Exact estimation of multiple directed acyclic graphs
• Polyhedral approach to statistical learning graphical models
• Polyhedral approaches to learning Bayesian networks
• A geometric view on learning Bayesian network structures

This page was built for publication: On polyhedral approximations of polytopes for learning Bayesian networks

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