Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
From MaRDI portal
Publication:408599
DOI10.1007/S10618-010-0178-6zbMATH Open1235.68152OpenAlexW1970687027MaRDI QIDQ408599FDOQ408599
José M. Puerta, J. Mateo, José A. Gámez
Publication date: 11 April 2012
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10618-010-0178-6
Recommendations
- A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
- The max-min hill-climbing Bayesian network structure learning algorithm
- Towards a fast and efficient algorithm for learning Bayesian network
- An efficient Bayesian network structure learning strategy
- Efficient parameter learning of Bayesian network classifiers
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Efficient learning of Bayesian networks with bounded tree-width
- Approximation methods for efficient learning of Bayesian networks.
- Efficient structure learning of Bayesian networks using constraints
Cites Work
- Causation, prediction, and search
- A hybrid methodology for learning belief networks: BENEDICT
- Estimating the dimension of a model
- A Bayesian method for the induction of probabilistic networks from data
- 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
- On the choice of a model to fit data from an exponential family
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adaptive probabilistic networks with hidden variables
- 10.1162/153244303321897717
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stratified exponential families: Graphical models and model selection
- Ant colony optimization for learning Bayesian networks.
- Towards scalable and data efficient learning of Markov boundaries
- Learning Bayesian networks in the space of structures by estimation of distribution algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Cited In (18)
- Scaling Up the Greedy Equivalence Search Algorithm by Constraining the Search Space of Equivalence Classes
- Greedy structure learning from data that contain systematic missing values
- Combining gene expression data and prior knowledge for inferring gene regulatory networks via Bayesian networks using structural restrictions
- Improving Bayesian network local structure learning via data-driven symmetry correction methods
- Objective Bayesian Nets for Integrating Consistent Datasets
- Quantum approximate optimization algorithm for Bayesian network structure learning
- Title not available (Why is that?)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Partitioned hybrid learning of Bayesian network structures
- A ring-based distributed algorithm for learning high-dimensional Bayesian networks
- Synergy-incorporated Bayesian Petri net: a method for mining ``and/or relation and synergy effect with application in probabilistic reasoning
- Learning a Bayesian network with multiple latent variables for implicit relation representation
- Learning the structure of Bayesian networks with ancestral and/or heuristic partition
- Penalized Estimation of Directed Acyclic Graphs From Discrete Data
- A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
- Estimation of Gaussian directed acyclic graphs using partial ordering information with applications to DREAM3 networks and dairy cattle data
- Marginal information for structure learning
Uses Software
This page was built for publication: Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408599)
