Score-based methods for learning Markov boundaries by searching in constrained spaces
From MaRDI portal
Publication:1944976
DOI10.1007/S10618-011-0247-5zbMATH Open1260.68318OpenAlexW2156050561MaRDI QIDQ1944976FDOQ1944976
Authors: Silvia Acid, Moisés Fernández, Luis M. de Campos 
Publication date: 28 March 2013
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10618-011-0247-5
Recommendations
- Towards scalable and data efficient learning of Markov boundaries
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Analysis of Markov boundary induction in Bayesian networks: a new view from matroid theory
- Algorithms for discovery of multiple Markov boundaries
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Cites Work
- Causation, prediction, and search
- Selection of relevant features and examples in machine learning
- Wrappers for feature subset selection
- Estimating the dimension of a model
- 10.1162/153244303322753616
- Gene selection for cancer classification using support vector machines
- A new look at the statistical model identification
- 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?)
- 10.1162/153244302760200696
- The max-min hill-climbing Bayesian network structure learning algorithm
- Using Markov blankets for causal structure learning
- Probabilistic graphical models.
- Title not available (Why is that?)
- Bayesian network classifiers
- Adaptive probabilistic networks with hidden variables
- On discriminative Bayesian network classifiers and logistic regression
- Bayesian learning in social networks.
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- Bayesian network learning algorithms using structural restrictions
- Towards scalable and data efficient learning of Markov boundaries
- A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
- Learning Bayesian network classifiers: Searching in a space of partially directed acyclic graphs
- A new approach for learning belief networks using independence criteria
- Title not available (Why is that?)
Cited In (5)
- Algorithms for discovery of multiple Markov boundaries
- Combining gene expression data and prior knowledge for inferring gene regulatory networks via Bayesian networks using structural restrictions
- Towards scalable and data efficient learning of Markov boundaries
- Scoring matching approach: Learning high order Markov random fields
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Uses Software
This page was built for publication: Score-based methods for learning Markov boundaries by searching in constrained spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944976)
