On open questions in the geometric approach to structural learning Bayesian nets

DOI10.1016/J.IJAR.2010.09.004MaRDI QIDQ541844zbMATH OpenOpenAlexFDO

Authors Milan Studený, Jiří Vomlel

Publication date 8 June 2011

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.09.004

zbMATH Keywords

polyhedral combinatoricslearning and adaptive systemsBayesian netsspecial polytope

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Recommendations

• Characteristic imsets for learning Bayesian network structure
• Polyhedral aspects of score equivalence in Bayesian network structure learning
• A geometric view on learning Bayesian network structures
• 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 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 1857870 (Why is no real title available?)
• 10.1162/153244303321897717
• A characterization of Markov equivalence classes for acyclic digraphs
• A geometric view on learning Bayesian network structures
• A reconstruction algorithm for the essential graph
• Bayesian network learning algorithms using structural restrictions
• Efficient algorithms for conditional independence inference
• Estimating the dimension of a model
• On the Applications of Mobius Inversion in Combinatorial Analysis
• Three Counter-Examples on Semi-Graphoids

Cited in

(13)

• Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
• Coincidence of the sets of minimal and irreducible join graphs over primary structure of algebraic Bayesian networks
• Polyhedral approach to statistical learning graphical models
• Core-based criterion for extreme supermodular functions
• A geometric view on learning Bayesian network structures
• Spectral Bayesian network theory
• scientific article; zbMATH DE number 1983174 (Why is no real title available?)
• On polyhedral approximations of polytopes for learning Bayesian networks
• Polyhedral approaches to learning Bayesian networks
• Characteristic imsets for learning Bayesian network structure
• The characteristic imset polytope of Bayesian networks with ordered nodes
• Polyhedral aspects of score equivalence in Bayesian network structure learning
• Algebraic Bayesian networks: checking backbone connectivity

This page was built for publication: On open questions in the geometric approach to structural learning Bayesian nets

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