Learning Bayesian networks: The combination of knowledge and statistical data
From MaRDI portal
Publication:1900987
zbMATH Open0831.68096arXiv1302.6815MaRDI QIDQ1900987FDOQ1900987
Authors: David Heckerman, Dan Geiger, David Maxwell Chickering 
Publication date: 13 February 1996
Published in: Machine Learning (Search for Journal in Brave)
Abstract: We describe algorithms for learning Bayesian networks from a combination of user knowledge and statistical data. The algorithms have two components: a scoring metric and a search procedure. The scoring metric takes a network structure, statistical data, and a user's prior knowledge, and returns a score proportional to the posterior probability of the network structure given the data. The search procedure generates networks for evaluation by the scoring metric. Our contributions are threefold. First, we identify two important properties of metrics, which we call event equivalence and parameter modularity. These properties have been mostly ignored, but when combined, greatly simplify the encoding of a user's prior knowledge. In particular, a user can express her knowledge-for the most part-as a single prior Bayesian network for the domain. Second, we describe local search and annealing algorithms to be used in conjunction with scoring metrics. In the special case where each node has at most one parent, we show that heuristic search can be replaced with a polynomial algorithm to identify the networks with the highest score. Third, we describe a methodology for evaluating Bayesian-network learning algorithms. We apply this approach to a comparison of metrics and search procedures.
Full work available at URL: https://arxiv.org/abs/1302.6815
Recommendations
Cited In (only showing first 100 items - show all)
- Learning tractable Bayesian networks in the space of elimination orders
- Greedy structure learning from data that contain systematic missing values
- Effective and efficient structure learning with pruning and model averaging strategies
- 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
- Adaptive cascade
- A model for automatic identification of human pulse signals
- Quantum approximate optimization algorithm for Bayesian network structure learning
- Title not available (Why is that?)
- Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach
- Learning structures of Bayesian networks for variable groups
- A review on evolutionary algorithms in Bayesian network learning and inference tasks
- Learning recursive Bayesian multinets for data clustering by means of constructive induction
- Finding consensus Bayesian network structures
- Quantifying the uncertainty of a belief net response: Bayesian error-bars for belief net inference
- Title not available (Why is that?)
- Structure space of Bayesian networks is dramatically reduced by subdividing it in sub-networks
- Analysing organic food buyers' perceptions with Bayesian networks: a case study in Turkey
- \(\mathsf{PenPC}\): a two-step approach to estimate the skeletons of high-dimensional directed acyclic graphs
- Equivalence class selection of categorical graphical models
- Structure learning of Bayesian networks using global optimization with applications in data classification
- Same-decision probability: a confidence measure for threshold-based decisions
- Efficient score-based Markov blanket discovery
- Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
- The Impact of Exact Probabilistic Learning Algorithms in EDAs Based on Bayesian Networks
- Learning Bayesian networks from big data with greedy search: computational complexity and efficient implementation
- Hybrid semiparametric Bayesian networks
- Minimum description length revisited
- A constraint-based algorithm for the structural learning of continuous-time Bayesian networks
- The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
- Score-based methods for learning Markov boundaries by searching in constrained spaces
- Who learns better Bayesian network structures: accuracy and speed of structure learning algorithms
- Learning with imprecise probabilities as model selection and averaging
- 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
- Towards using the chordal graph polytope in learning decomposable models
- Conjugate and conditional conjugate Bayesian analysis of discrete graphical models of marginal independence
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
- Title not available (Why is that?)
- Structured Sparsity: Discrete and Convex Approaches
- Title not available (Why is that?)
- Learning multi-linear representations of distributions for efficient inference
- Inductive transfer for learning Bayesian networks
- Data mining of association structures to model consumer behaviour.
- Marginal information for structure learning
- A Bayesian hierarchical score for structure learning from related data sets
- Knowledge transfer for causal discovery
- Bayesian network structure learning with permutation tests
- Revising the structure of Bayesian network classifiers in the presence of missing data
- Characteristic imsets for learning Bayesian network structure
- Conservative independence-based causal structure learning in absence of adjacency faithfulness
- Synthetic data generation with probabilistic Bayesian networks
- Upper-lower bounds candidate sets searching algorithm for Bayesian network structure learning
- On using Bayesian networks for complexity reduction in decision trees
- 10.1162/153244303321897717
- Chain event graphs for informed missingness
- Exact Bayesian structure discovery in Bayesian networks
- Large-sample learning of Bayesian networks is NP-hard
- Learning causal Bayesian networks using minimum free energy principle
- Graph embedding using tree edit-union
- \textit{Graph\_sampler}: a simple tool for fully Bayesian analyses of DAG-models
- Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models
- A conditional independence algorithm for learning undirected graphical models
- Inexact graph matching by means of estimation of distribution algorithms
- A hybrid random field model for scalable statistical learning
- Partitioned hybrid learning of Bayesian network structures
- Learning parameters of Bayesian networks from incomplete data via importance sampling
- Refining a Bayesian network using a chain event graph
- MARLEDA: effective distribution estimation through Markov random fields
- A new prior for discrete DAG models with a restricted set of directions
- A linear Bayesian stochastic approximation to update project duration estimates
- Bayesian network classifiers
- Discrete Bayesian Network Classifiers
- Learning Bayesian networks from data: An information-theory based approach
- Knowledge representation and inference in similarity networks and Bayesian multinets
- Bayesian network learning algorithms using structural restrictions
- An information theoretic approach to pedigree reconstruction
- Short-term plasticity as cause-effect hypothesis testing in distal reward learning
- Inference of structures of models of probabilistic dependences from statistical data
- Formulas for counting acyclic digraph Markov equivalence classes
- Bayesian parameter learning with an application
- An analytical framework for supply network risk propagation: a Bayesian network approach
- Support vector machines with applications
- Minimax regret spanning arborescences under uncertain costs
- Learning Bayesian networks from datasets joining continuous and discrete variables
- Integrating Bayesian networks and decision trees in a sequential rule-based transportation model
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- Learning Causal Bayesian Network Structures From Experimental Data
- Learning Bounded Tree-Width Bayesian Networks via Sampling
- Feature subset selection by Bayesian networks: A comparison with genetic and sequential algorithms
- Efficient learning of Bayesian networks with bounded tree-width
- Penalized Estimation of Directed Acyclic Graphs From Discrete Data
- A methodology for developing Bayesian networks: an application to information technology (IT) implementation
- Evaluation of neural networks and data mining methods on a credit assessment task for class imbalance problem
- Learning Bayesian Networks Does Not Have to Be NP-Hard
- Title not available (Why is that?)
- Bayesian network modeling for evolutionary genetic structures
- Parameter priors for directed acyclic graphical models and the characterization of several probability distributions
- A Tutorial on Learning with Bayesian Networks
- Method of probabilistic inference from learning data in Bayesian networks
This page was built for publication: Learning Bayesian networks: The combination of knowledge and statistical data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900987)
