Towards scalable and data efficient learning of Markov boundaries
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 2150792 (Why is no real title available?)
- Causation, prediction, and search
- Kernel methods for measuring independence
- Statistical challenges in functional genomics. (With comments and a rejoinder).
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- The max-min hill-climbing Bayesian network structure learning algorithm
Cited in
(23)- Learning Bayesian networks based on bi-velocity discrete particle swarm optimization with mutation operator
- Feature selection for Bayesian network classifiers using the MDL-FS score
- Algorithms for discovery of multiple Markov boundaries
- Tabu search-enhanced graphical models for classification in high dimensions
- Extending greedy feature selection algorithms to multiple solutions
- Swamping and masking in Markov boundary discovery
- Belief graphical models for uncertainty representation and reasoning
- scientific article; zbMATH DE number 6982334 (Why is no real title available?)
- Joint Markov blankets in feature sets extracted from wavelet packet decompositions
- Score-based methods for learning Markov boundaries by searching in constrained spaces
- Discovering and orienting the edges connected to a target variable in a DAG via a sequential local learning approach
- The difficulty of being moral
- A greedy feature selection algorithm for big data of high dimensionality
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- Learning Gaussian graphical models with fractional marginal pseudo-likelihood
- scientific article; zbMATH DE number 7370579 (Why is no real title available?)
- Regularizing conjunctive features for classification
- Towards a fast and efficient algorithm for learning Bayesian network
- Efficient score-based Markov blanket discovery
- A novel feature selection using Markov blanket representative set and particle swarm optimization algorithm
- Structural learning for Bayesian networks by testing complete separators in prime blocks
- Domain knowledge-enhanced variable selection for biomedical data analysis
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)
