A ring-based distributed algorithm for learning high-dimensional Bayesian networks
From MaRDI portal
Publication:6587912
Recommendations
Cites work
- 10.1162/153244303321897717
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- Bayesian Networks and Decision Graphs
- Bayesian Networks and Influence Diagrams: A Guide to Construction and Analysis
- Efficient structure learning of Bayesian networks using constraints
- Finding consensus Bayesian network structures
- Large-sample learning of Bayesian networks is NP-hard
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- Learning Bayesian networks: The combination of knowledge and statistical data
- Marginal information for structure learning
- Probabilistic graphical models.
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
- The max-min hill-climbing Bayesian network structure learning algorithm
This page was built for publication: A ring-based distributed algorithm for learning high-dimensional Bayesian networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587912)