Integer linear programming for the Bayesian network structure learning problem
From MaRDI portal
(Redirected from Publication:511785)
Recommendations
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
- Efficient structure learning of Bayesian networks using constraints
- Bayesian network structure learning with integer programming: polytopes, facets and complexity
- Bayesian network structure learning: hybridizing complete search with independence tests
- Parallel globally optimal structure learning of Bayesian networks
Cites work
- A new look at the statistical model identification
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Edmonds polytopes and a hierarchy of combinatorial problems
- Efficient structure learning of Bayesian networks using constraints
- Estimating the dimension of a model
- Finding All the Elementary Circuits of a Directed Graph
- Improved maximum likelihood reconstruction of complex multi-generational pedigrees
- Learning optimal Bayesian networks: a shortest path perspective
- Min-BDeu and max-BDeu scores for learning Bayesian networks
- On the acyclic subgraph polytope
- Outline of an algorithm for integer solutions to linear programs
- Reducibility among combinatorial problems
- SCIP: solving constraint integer programs
- The traveling salesman problem. A computational study.
Cited in
(22)- Temporal state change Bayesian networks for modeling of evolving multivariate state sequences: model, structure discovery and parameter estimation
- Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach
- Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks
- Bayesian network structure learning with integer programming: polytopes, facets and complexity
- Learning Bayesian networks with local structure, mixed variables, and exact algorithms
- Bayesian network learning via topological order
- Statistical computational learning
- Studying the effective brain connectivity using multiregression dynamic models
- Entropy-based pruning for learning Bayesian networks using BIC
- Optimization problems for machine learning: a survey
- Learning a Bayesian network with multiple latent variables for implicit relation representation
- Corrected score methods for estimating Bayesian networks with error-prone nodes
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
- Learning the structure of Bayesian networks with ancestral and/or heuristic partition
- Hierarchical estimation of parameters in Bayesian networks
- Causal structure learning: a combinatorial perspective
- A Bayesian approach for learning Bayesian network structures
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
- Approximate structure learning for large Bayesian networks
- Revising the structure of Bayesian network classifiers in the presence of missing data
- Constraint learning: an appetizer
- Approximate credal network updating by linear programming with applications to decision making
This page was built for publication: Integer linear programming for the Bayesian network structure learning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511785)
