### An Exact Algorithm for Solving Most Relevant Explanation in Bayesian Networks

## 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 algorithms have 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 makes exact MRE inference tractable in Bayesian networks that could not be solved previously.## Bibtex

@INPROCEEDINGS{Zhu15exact,author = {Xiaoyuan Zhu, Changhe Yuan},

title = {An Exact Algorithm for Solving Most Relevant Explanation in Bayesian Networks},

booktitle = {In Proceedings of the 29th AAAI Conference (AAAI-15)},

address = {Austin, Texas},

year = {2015}

}