A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
From MaRDI portal
Publication:3524969
Recommendations
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- The max-min hill-climbing Bayesian network structure learning algorithm
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Efficient structure learning of Bayesian networks using constraints
- Who learns better Bayesian network structures: accuracy and speed of structure learning algorithms
Cites work
- scientific article; zbMATH DE number 1634667 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 1946873 (Why is no real title available?)
- scientific article; zbMATH DE number 1974024 (Why is no real title available?)
- scientific article; zbMATH DE number 2013541 (Why is no real title available?)
- scientific article; zbMATH DE number 1844474 (Why is no real title available?)
- 10.1162/153244303321897717
- A hybrid methodology for learning belief networks: BENEDICT
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- Ant colony optimization for learning Bayesian networks.
- Bayesian network classifiers
- Causation, prediction, and search
- Learning Bayesian networks: The combination of knowledge and statistical data
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- The max-min hill-climbing Bayesian network structure learning algorithm
Cited in
(8)- HPB: a model for handling BN nodes with high cardinality parents
- Inferring gene regulatory networks by an order independent algorithm using incomplete data sets
- Score-based methods for learning Markov boundaries by searching in constrained spaces
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- Mixture of Markov trees for Bayesian network structure learning with small datasets in high dimensional space
- The max-min hill-climbing Bayesian network structure learning algorithm
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Inferring gene regulatory networks by PCA-CMI using Hill climbing algorithm based on MIT score and SORDER method
This page was built for publication: A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524969)
