Polyhedral approaches to learning Bayesian networks
From MaRDI portal
Publication:2979652
DOI10.1090/conm/685/13751zbMath1365.52018OpenAlexW3092966209MaRDI QIDQ2979652
James Cussens, David C. Haws, 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
Computational learning theory (68Q32) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Core-based criterion for extreme supermodular functions
- Improved maximum likelihood reconstruction of complex multi-generational pedigrees
- On open questions in the geometric approach to structural learning Bayesian nets
- SCIP: solving constraint integer programs
- Learning Bayesian networks for discrete data
- A geometric view on learning Bayesian network structures
- Causation, prediction, and search
- A Bayesian method for the induction of probabilistic networks from data
- Estimating the dimension of a model
- A new approach for learning belief networks using independence criteria
- A recovery algorithm for chain graphs
- Branching rules revisited
- Learning Bayesian networks: The combination of knowledge and statistical data
- Polyhedral aspects of score equivalence in Bayesian network structure learning
- Characteristic imsets for learning Bayesian network structure
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
- Polyhedral Approach to Statistical Learning Graphical Models
- On Polyhedral Approximations of Polytopes for Learning Bayesian Networks
- Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity
- Integer Programming
- Graphical and Recursive Models for Contingency Tables
- Computer Codes for Problems of Integer Programming
- Facet of regular 0–1 polytopes
- Semimodular Functions and Combinatorial Geometries
- Lectures on Polytopes
- Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
- 10.1162/153244303321897717
- Bayesian Graphical Models for Discrete Data
- Decomposable graphical Gaussian model determination
- Approximating discrete probability distributions with dependence trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
