A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
From MaRDI portal
Publication:3174036
zbMATH Open1222.62036MaRDI QIDQ3174036FDOQ3174036
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v7/decampos06a.html
Recommendations
- scientific article
- Methods of constructing Bayesian networks based on scoring functions
- Min-BDeu and max-BDeu scores for learning Bayesian networks
- Learning Bayesian networks: The combination of knowledge and statistical data
- A decomposition algorithm for learning Bayesian networks based on scoring function
Statistical aspects of information-theoretic topics (62B10) Bayesian inference (62F15) Nonparametric hypothesis testing (62G10) Artificial intelligence (68T99)
Cited In (31)
- Model-based exception mining for object-relational data
- Inferring dynamic gene regulatory networks with low-order conditional independencies -- an evaluation of the method
- Nonlinear Causal Discovery with Confounders
- Title not available (Why is that?)
- Structure learning of Bayesian networks by continuous particle swarm optimization algorithms
- Credit risk modeling using bayesian networks
- Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers
- Alleviating conditional independence assumption of naive Bayes
- Causal learning with Occam's razor
- A ring-based distributed algorithm for learning high-dimensional Bayesian networks
- Analysing organic food buyers' perceptions with Bayesian networks: a case study in Turkey
- Inferring gene regulatory networks by an order independent algorithm using incomplete data sets
- Bayesian parameter learning with an application
- Inferring gene regulatory networks by PCA-CMI using Hill climbing algorithm based on MIT score and SORDER method
- Mathematical modeling for active and dynamic diagnosis of crop diseases based on Bayesian networks and incremental learning
- Learning Bayesian networks from datasets joining continuous and discrete variables
- Automatic emergence detection in complex systems
- Hybrid learning of Bayesian multinets for binary classification
- Additive noise model structure learning based on rank correlation
- Mind change optimal learning of Bayes net structure from dependency and independency data
- Score-based methods for learning Markov boundaries by searching in constrained spaces
- Multi-class ℓ2-Boost with the scoring coding
- Swamping and masking in Markov boundary discovery
- A decomposition algorithm for learning Bayesian networks based on scoring function
- 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
- Title not available (Why is that?)
- Testing conditional independence and homogeneity in large sparse three-way tables using conditional distance covariance
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- Methods of constructing Bayesian networks based on scoring functions
- Strongly consistent nonparametric tests of conditional independence
Uses Software
This page was built for publication: A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174036)
