Towards scalable and data efficient learning of Markov boundaries
DOI10.1016/J.IJAR.2006.06.008zbMATH Open1122.68136OpenAlexW2013374740MaRDI QIDQ997045FDOQ997045
Jose M. Peña, Roland Nilsson, Jesper Tegnér, Johan Björkegren
Publication date: 19 July 2007
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2006.06.008
Recommendations
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Score-based methods for learning Markov boundaries by searching in constrained spaces
- Algorithms for discovery of multiple Markov boundaries
- Analysis of Markov boundary induction in Bayesian networks: a new view from matroid theory
- An Efficient Algorithm for Learning Bayesian Networks from Data
Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- Causation, prediction, and search
- The max-min hill-climbing Bayesian network structure learning algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Statistical challenges in functional genomics. (With comments and a rejoinder).
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Cited In (20)
- Joint Markov blankets in feature sets extracted from wavelet packet decompositions
- Discovering and orienting the edges connected to a target variable in a DAG via a sequential local learning approach
- Efficient score-based Markov blanket discovery
- Belief graphical models for uncertainty representation and reasoning
- Title not available (Why is that?)
- Structural learning for Bayesian networks by testing complete separators in prime blocks
- Feature selection for Bayesian network classifiers using the MDL-FS score
- Extending greedy feature selection algorithms to multiple solutions
- Domain knowledge-enhanced variable selection for biomedical data analysis
- Learning Bayesian networks based on bi-velocity discrete particle swarm optimization with mutation operator
- Score-based methods for learning Markov boundaries by searching in constrained spaces
- Swamping and masking in Markov boundary discovery
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Towards fast and efficient algorithm for learning Bayesian network
- A novel feature selection using Markov blanket representative set and particle swarm optimization algorithm
- Title not available (Why is that?)
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- A greedy feature selection algorithm for big data of high dimensionality
- Learning Gaussian graphical models with fractional marginal pseudo-likelihood
- The difficulty of being moral
Uses Software
This page was built for publication: Towards scalable and data efficient learning of Markov boundaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997045)
