Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood

DOI10.1007/S10618-010-0178-6zbMath1235.68152OpenAlexW1970687027MaRDI QIDQ408599

José M. Puerta, Juan L. 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

Mathematics Subject Classification ID

Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (13)

Partitioned hybrid learning of Bayesian network structures ⋮ Objective Bayesian Nets for Integrating Consistent Datasets ⋮ Estimation of Gaussian directed acyclic graphs using partial ordering information with applications to DREAM3 networks and dairy cattle data ⋮ Learning the structure of Bayesian networks with ancestral and/or heuristic partition ⋮ 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 ⋮ Penalized Estimation of Directed Acyclic Graphs From Discrete Data ⋮ Marginal information for structure learning ⋮ 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 ⋮ Unnamed Item ⋮ Greedy structure learning from data that contain systematic missing values ⋮ Quantum approximate optimization algorithm for Bayesian network structure learning

Uses Software

• TETRAD
• BENEDICT

Cites Work

• The max-min hill-climbing Bayesian network structure learning algorithm
• Towards scalable and data efficient learning of Markov boundaries
• On the choice of a model to fit data from an exponential family
• Causation, prediction, and search
• A Bayesian method for the induction of probabilistic networks from data
• Estimating the dimension of a model
• Adaptive probabilistic networks with hidden variables
• Ant colony optimization for learning Bayesian networks.
• Stratified exponential families: Graphical models and model selection
• Learning Bayesian networks: The combination of knowledge and statistical data
• Learning Bayesian networks in the space of structures by estimation of distribution algorithms
• 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

This page was built for publication: Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood