Swamping and masking in Markov boundary discovery
From MaRDI portal
Publication:1689549
Recommendations
- scientific article; zbMATH DE number 6982334
- Algorithms for discovery of multiple Markov boundaries
- Efficient score-based Markov blanket discovery
- Analysis of Markov boundary induction in Bayesian networks: a new view from matroid theory
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Cites work
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- 10.1162/153244303322753616
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- Algorithms for discovery of multiple Markov boundaries
- An optimization-based approach for the design of Bayesian networks
- Conservative independence-based causal structure learning in absence of adjacency faithfulness
- Elements of Information Theory
- Improving the reliability of causal discovery from small data sets using argumentation
- Learning Bayesian networks from data: An information-theory based approach
- Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part I: Algorithms and empirical evaluation
- Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part II: Analysis and extensions
- Some Methods for Strengthening the Common χ 2 Tests
- 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
This page was built for publication: Swamping and masking in Markov boundary discovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689549)
