Polyhedral approaches to learning Bayesian networks
From MaRDI portal
Publication:2979652
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
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (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 1860211 (Why is no real title available?)
- 10.1162/153244303321897717
- A Bayesian method for the induction of probabilistic networks from data
- A geometric view on learning Bayesian network structures
- A new approach for learning belief networks using independence criteria
- A recovery algorithm for chain graphs
- Approximating discrete probability distributions with dependence trees
- Bayesian Graphical Models for Discrete Data
- Bayesian network structure learning with integer programming: polytopes, facets and complexity
- Branching rules revisited
- Causation, prediction, and search
- Characteristic imsets for learning Bayesian network structure
- Computer Codes for Problems of Integer Programming
- Core-based criterion for extreme supermodular functions
- Decomposable graphical Gaussian model determination
- Efficient structure learning of Bayesian networks using constraints
- Estimating the dimension of a model
- Facet of regular 0–1 polytopes
- Graphical and Recursive Models for Contingency Tables
- Improved maximum likelihood reconstruction of complex multi-generational pedigrees
- Integer Programming
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
- Learning Bayesian networks for discrete data
- Learning Bayesian networks: The combination of knowledge and statistical data
- Lectures on Polytopes
- Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
- On open questions in the geometric approach to structural learning Bayesian nets
- 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
- Probabilistic graphical models.
- SCIP: solving constraint integer programs
- Semimodular Functions and Combinatorial Geometries
Cited in
(12)- scientific article; zbMATH DE number 5957295 (Why is no real title available?)
- 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
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)
