Characteristic imsets for learning Bayesian network structure

Redirect to:

• Characteristic imsets for learning Bayesian network structure

DOI10.1016/J.IJAR.2012.04.001MaRDI QIDQ2375330zbMATH OpenOpenAlexFDO

Authors Raymond Hemmecke, Silvia Lindner, Milan Studený

Publication date 13 June 2013

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

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

zbMATH Keywords

characteristic imsetessential graphlearning Bayesian network structureLP relaxation of a polytopestandard imset

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

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

Cites work

• 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
• Approximating discrete probability distributions with dependence trees
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Efficient algorithms for conditional independence inference
• Efficient structure learning of Bayesian networks using constraints
• Estimating the dimension of a model
• 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?)
• Learning Bayesian networks: The combination of knowledge and statistical data
• On open questions in the geometric approach to structural learning Bayesian nets
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• Polyhedral approach to statistical learning graphical models
• Two operations of merging and splitting components in a chain graph

Cited in

(19)

• An alternative characterization of a Bayesian network.
• Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
• BNC-PSO: structure learning of Bayesian networks by particle swarm optimization
• The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
• Polyhedral aspects of score equivalence in Bayesian network structure learning
• Towards using the chordal graph polytope in learning decomposable models
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools
• Signal propagation in Bayesian networks and its relationship with intrinsically multivariate predictive variables
• Structural Markov graph laws for Bayesian model uncertainty
• Standard imsets for undirected and chain graphical models
• On polyhedral approximations of polytopes for learning Bayesian networks
• Polyhedral approaches to learning Bayesian networks
• The characteristic imset polytope of Bayesian networks with ordered nodes
• Foundations of compositional models: structural properties
• Generalized Permutohedra from Probabilistic Graphical Models
• On open questions in the geometric approach to structural learning Bayesian nets
• Hyperplane representations of interventional characteristic imset polytopes
• A reconstruction algorithm for the essential graph
• A geometric view on learning Bayesian network structures

This page was built for publication: Characteristic imsets for learning Bayesian network structure

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