Polyhedral approaches to learning Bayesian networks

DOI10.1090/CONM/685/13751zbMATH Open1365.52018OpenAlexW3092966209MaRDI QIDQ2979652FDOQ2979652

Authors: David C. Haws, James Cussens, Milan Studený 

Publication date: 25 April 2017

Published in: Algebraic and Geometric Methods in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/conm/685/13751

Recommendations

• On polyhedral approximations of polytopes for learning Bayesian networks
• Bayesian network structure learning with integer programming: polytopes, facets and complexity
• Polyhedral approach to statistical learning graphical models
• Polyhedral aspects of score equivalence in Bayesian network structure learning
• A geometric view on learning Bayesian network structures
• Construction and methods of learning of Bayesian networks
• scientific article; zbMATH DE number 5158933
• Approximation methods for efficient learning of Bayesian networks.
• A review of Bayesian networks and structure learning
• Learning Sets of Bayesian Networks

zbMATH Keywords

Bayesian networksinteger linear programmingfaces and facets of polytopes

Mathematics Subject Classification ID

Linear programming (90C05) Computational learning theory (68Q32) Combinatorial optimization (90C27) Integer programming (90C10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Cites Work

• SCIP: solving constraint integer programs
• Causation, prediction, and search
• Estimating the dimension of a model
• Title not available (Why is that?)
• A Bayesian method for the induction of probabilistic networks from data
• Learning Bayesian networks: The combination of knowledge and statistical data
• Title not available (Why is that?)
• Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
• Title not available (Why is that?)
• Bayesian Graphical Models for Discrete Data
• Approximating discrete probability distributions with dependence trees
• Probabilistic graphical models.
• Title not available (Why is that?)
• Bayesian network structure learning with integer programming: polytopes, facets and complexity
• Efficient structure learning of Bayesian networks using constraints
• Lectures on Polytopes
• Title not available (Why is that?)
• Branching rules revisited
• Facet of regular 0–1 polytopes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 10.1162/153244303321897717
• Decomposable graphical Gaussian model determination
• Polyhedral aspects of score equivalence in Bayesian network structure learning
• Core-based criterion for extreme supermodular functions
• Semimodular Functions and Combinatorial Geometries
• On open questions in the geometric approach to structural learning Bayesian nets
• Improved maximum likelihood reconstruction of complex multi-generational pedigrees
• Learning Bayesian networks for discrete data
• Integer Programming
• Computer Codes for Problems of Integer Programming
• A geometric view on learning Bayesian network structures
• Graphical and Recursive Models for Contingency Tables
• A new approach for learning belief networks using independence criteria
• A recovery algorithm for chain graphs
• Characteristic imsets for learning Bayesian network structure
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools
• On polyhedral approximations of polytopes for learning Bayesian networks
• Polyhedral approach to statistical learning graphical models

Cited In (12)

• Title not available (Why is that?)
• Bayesian network structure learning with integer programming: polytopes, facets and complexity
• A geometric view on learning Bayesian network structures
• On open questions in the geometric approach to structural learning Bayesian nets
• Learning Moral Graphs in Construction of High-Dimensional Bayesian Networks for Mixed Data
• On polyhedral approximations of polytopes for learning Bayesian networks
• Polyhedral approach to statistical learning graphical models
• Polyhedral aspects of score equivalence in Bayesian network structure learning
• The characteristic imset polytope of Bayesian networks with ordered nodes
• Towards using the chordal graph polytope in learning decomposable models
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools
• Characteristic imsets for learning Bayesian network structure

Uses Software

• SCIP
• UCI-ml
• CPLEX
• TETRAD
• GOBNILP

This page was built for publication: Polyhedral approaches to learning Bayesian networks

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