Efficient score-based Markov blanket discovery
From MaRDI portal
Publication:2374530
Recommendations
- scientific article; zbMATH DE number 6982334
- Using Markov blankets for causal structure learning
- Blankets joint posterior score for learning Markov network structures
- Analysis of Markov boundary induction in Bayesian networks: a new view from matroid theory
- Sparse sufficient dimension reduction for Markov blanket discovery
Cites work
- 10.1162/153244303321897717
- Exact Bayesian structure discovery in Bayesian networks
- Learning Bayesian network classifiers: Searching in a space of partially directed acyclic graphs
- Learning Bayesian networks: The combination of knowledge and statistical data
- Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part I: Algorithms and empirical evaluation
- Statistical comparisons of classifiers over multiple data sets
- The max-min hill-climbing Bayesian network structure learning algorithm
- Towards scalable and data efficient learning of Markov boundaries
- Using Markov blankets for causal structure learning
Cited in
(7)- Improving Bayesian network local structure learning via data-driven symmetry correction methods
- Learning Bayesian network structures using weakest mutual-information-first strategy
- Swamping and masking in Markov boundary discovery
- Scoring matching approach: Learning high order Markov random fields
- Mutual-information-inspired heuristics for constraint-based causal structure learning
- Using Markov blankets for causal structure learning
- Learning Moral Graphs in Construction of High-Dimensional Bayesian Networks for Mixed Data
This page was built for publication: Efficient score-based Markov blanket discovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374530)
