Swamping and masking in Markov boundary discovery
From MaRDI portal
Publication:1689549
DOI10.1007/s10994-016-5545-0zbMath1454.68123OpenAlexW2293199625MaRDI QIDQ1689549
Publication date: 12 January 2018
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-016-5545-0
Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)
Cites Work
- The max-min hill-climbing Bayesian network structure learning algorithm
- Towards scalable and data efficient learning of Markov boundaries
- Learning Bayesian networks from data: An information-theory based approach
- Conservative independence-based causal structure learning in absence of adjacency faithfulness
- An optimization-based approach for the design of Bayesian networks
- 10.1162/153244303322753616
- Elements of Information Theory
- Some Methods for Strengthening the Common χ 2 Tests
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Swamping and masking in Markov boundary discovery