A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
DOI10.1007/978-3-540-75256-1_52zbMATH Open1148.68514OpenAlexW1575390667MaRDI QIDQ3524969FDOQ3524969
Authors: José A. Gámez, J. Mateo, José M. Puerta 
Publication date: 16 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75256-1_52
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
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- Causation, prediction, and search
- A hybrid methodology for learning belief networks: BENEDICT
- Learning Bayesian networks: The combination of knowledge and statistical data
- Title not available (Why is that?)
- The max-min hill-climbing Bayesian network structure learning algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bayesian network classifiers
- 10.1162/153244303321897717
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- Ant colony optimization for learning Bayesian networks.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Title not available (Why is that?)
Cited In (8)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Inferring gene regulatory networks by an order independent algorithm using incomplete data sets
- Inferring gene regulatory networks by PCA-CMI using Hill climbing algorithm based on MIT score and SORDER method
- Mixture of Markov trees for Bayesian network structure learning with small datasets in high dimensional space
- Score-based methods for learning Markov boundaries by searching in constrained spaces
- The max-min hill-climbing Bayesian network structure learning algorithm
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- HPB: a model for handling BN nodes with high cardinality parents
Uses Software
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)
