Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
From MaRDI portal
(Redirected from Publication:408599)
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
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 3585466 (Why is no real title available?)
- scientific article; zbMATH DE number 1946873 (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?)
- scientific article; zbMATH DE number 2200689 (Why is no real title available?)
- 10.1162/153244303321897717
- A Bayesian method for the induction of probabilistic networks from data
- A hybrid methodology for learning belief networks: BENEDICT
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- Adaptive probabilistic networks with hidden variables
- Ant colony optimization for learning Bayesian networks.
- Causation, prediction, and search
- Estimating the dimension of a model
- Learning Bayesian networks in the space of structures by estimation of distribution algorithms
- Learning Bayesian networks: The combination of knowledge and statistical data
- On the choice of a model to fit data from an exponential family
- Stratified exponential families: Graphical models and model selection
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- The max-min hill-climbing Bayesian network structure learning algorithm
- Towards scalable and data efficient learning of Markov boundaries
Cited in
(21)- 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
- scientific article; zbMATH DE number 7307465 (Why is no real title available?)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Gradient-based causal discovery with latent variables
- 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
- Distributed fusion-based algorithms for learning high-dimensional Bayesian networks: testing ring and star topologies
- 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
- FedGES: a federated learning approach for Bayesian network structure learning
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
- A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
- Estimation of Gaussian directed acyclic graphs using partial ordering information with applications to DREAM3 networks and dairy cattle data
- Marginal information for structure learning
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)
