A geometric view on learning Bayesian network structures

DOI10.1016/J.IJAR.2010.01.014MaRDI QIDQ985149zbMATH OpenOpenAlexFDO

Authors Milan Studený, Jiří Vomlel, Raymond Hemmecke

Publication date 20 July 2010

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

Full work available at URL https://doi.org/10.1016/j.ijar.2010.01.014

zbMATH Keywords

standard imsetgeometric neighborhoodGES algorithminclusion neighborhoodlearning Bayesian networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On open questions in the geometric approach to structural learning Bayesian nets
• On polyhedral approximations of polytopes for learning Bayesian networks
• Characteristic imsets for learning Bayesian network structure
• Polyhedral approaches to learning Bayesian networks
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools

Cites work

• scientific article; zbMATH DE number 4174001 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (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 3804333 (Why is no real title available?)
• 10.1162/153244303321897717
• A characterization of Markov equivalence classes for acyclic digraphs
• A reconstruction algorithm for the essential graph
• Estimating the dimension of a model
• Lectures on Polytopes

Cited in

(19)

• Characterization of inclusion neighbourhood in terms of the essential graph
• Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
• VC dimension and inner product space induced by Bayesian networks
• The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
• Standard imsets for undirected and chain graphical models
• Characterization of inclusion neighbourhood in terms of the essential graph: upper neighbours
• On open questions in the geometric approach to structural learning Bayesian nets
• Generalized Permutohedra from Probabilistic Graphical Models
• Algebraic geometry of Bayesian networks
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools
• Decomposition of two classes of structural models
• An information-geometric approach to learning Bayesian network topologies from data
• On polyhedral approximations of polytopes for learning Bayesian networks
• Polyhedral approaches to learning Bayesian networks
• Characteristic imsets for learning Bayesian network structure
• Model selection and local geometry
• The characteristic imset polytope of Bayesian networks with ordered nodes
• Exact estimation of multiple directed acyclic graphs
• Polyhedral aspects of score equivalence in Bayesian network structure learning

Describes a project that uses

Uses Software

• cdd
• CPLEX
• 4ti2
• Convex

This page was built for publication: A geometric view on learning Bayesian network structures

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