A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
From MaRDI portal
Publication:3524969
DOI10.1007/978-3-540-75256-1_52zbMath1148.68514MaRDI QIDQ3524969
Juan L. Mateo, José A. Gámez, 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
68T05: Learning and adaptive systems in artificial intelligence
68T37: Reasoning under uncertainty in the context of artificial intelligence
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
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, Inferring gene regulatory networks by PCA-CMI using Hill climbing algorithm based on MIT score and SORDER method
Uses Software
Cites Work
- The max-min hill-climbing Bayesian network structure learning algorithm
- Causation, prediction, and search
- Bayesian network classifiers
- Ant colony optimization for learning Bayesian networks.
- Learning Bayesian networks: The combination of knowledge and statistical data
- 10.1162/153244303321897717
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- A hybrid methodology for learning belief networks: BENEDICT
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item