Efficient score-based Markov blanket discovery

DOI10.1016/J.IJAR.2016.09.009zbMATH Open1401.68263OpenAlexW2525748243MaRDI QIDQ2374530FDOQ2374530

Tian Gao, Qiang Ji

Publication date: 15 December 2016

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2016.09.009

zbMATH Keywords

Bayesian networklocal structure learningMarkov blanket discovery

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Learning Bayesian networks: The combination of knowledge and statistical data
• The max-min hill-climbing Bayesian network structure learning algorithm
• 10.1162/153244303321897717
• Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part I: Algorithms and empirical evaluation
• Towards scalable and data efficient learning of Markov boundaries
• Learning Bayesian network classifiers: Searching in a space of partially directed acyclic graphs

Cited In (5)

• Improving Bayesian network local structure learning via data-driven symmetry correction methods
• Mutual-information-inspired heuristics for constraint-based causal structure learning
• Learning Bayesian network structures using weakest mutual-information-first strategy
• Learning Moral Graphs in Construction of High-Dimensional Bayesian Networks for Mixed Data
• Scoring matching approach: Learning high order Markov random fields

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)