Analysis of Markov boundary induction in Bayesian networks: a new view from matroid theory

DOI10.3233/FI-2011-409MaRDI QIDQ2895772zbMATH OpenOpenAlexFDO

Authors Dingcheng Feng, Feng Chen, Wenli Xu

Publication date 4 July 2012

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2011-409

zbMATH Keywords

conditional independencematroidMarkov boundarygreedy learning algorithm

Mathematics Subject Classification ID

Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• scientific article; zbMATH DE number 2015563
• Markov equivalence in Bayesian networks
• The marginal factorization of Bayesian networks and its application
• Analysis of Bayesian networks via prob-solvable loops
• Exact Bayesian structure discovery in Bayesian networks
• Toward a generalized Bayesian network
• Bayesian networks: the minimal triangulations of a graph
• Margins of discrete Bayesian networks

Cited in

(7)

• Algorithms for discovery of multiple Markov boundaries
• Towards scalable and data efficient learning of Markov boundaries
• Efficient score-based Markov blanket discovery
• An effective Markov based approach for calculating the limit matrix in the analytic network process
• Score-based methods for learning Markov boundaries by searching in constrained spaces
• Swamping and masking in Markov boundary discovery
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty

This page was built for publication: Analysis of Markov boundary induction in Bayesian networks: a new view from matroid theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895772)