An exact algorithm for solving most relevant explanation in Bayesian networks

3Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

Most Relevant Explanation (MRE) is a new inference task in Bayesian networks that finds the most relevant partial instantiation of target variables as an explanation for given evidence by maximizing the Generalized Bayes Factor (GBF). No exact algorithm has been developed for solving MRE previously. This paper fills the void and introduces a breadth-first branch-and-bound MRE algorithm based on a novel upper bound on GBF. The bound is calculated by decomposing the computation of the score to a set of Markov blankets of subsets of evidence variables. Our empirical evaluations show that the proposed algorithm scales up exact MRE inference significantly.

Cite

CITATION STYLE

APA

Zhu, X., & Yuan, C. (2015). An exact algorithm for solving most relevant explanation in Bayesian networks. In Proceedings of the National Conference on Artificial Intelligence (Vol. 5, pp. 3649–3655). AI Access Foundation. https://doi.org/10.1609/aaai.v29i1.9686

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free