### Hierarchical Beam Search for Solving Most Relevant Explanation in Bayesian Networks

## Abstract

Most Relevant Explanation (MRE) is an inference problem in Bayesian networks that finds the most relevant partial instantiation of target variables as an explanation for given evidence. It has been shown in recent literature that it addresses the overspecification problem of existing methods, such as MPE and MAP. In this paper, we propose a novel hierarchical beam search algorithm for solving MRE. The main idea is to use a second-level beam to limit the number of successors generated by the same parent so as to limit the similarity between the solutions in the first-level beam and result in a more diversified population. Three pruning criteria are also introduced to achieve further diversity. Empirical results show that the new algorithm typically outperforms local search and regular beam search.

## Bibtex

@INPROCEEDINGS{Zhu15hierarchical,author = {Xiaoyuan Zhu and Changhe Yuan},

title = {Hierarchical Beam Search for Solving Most Relevant Explanation in Bayesian Networks},

booktitle = {In Proceedings of The 28th International FLAIRS Conference (FLAIRS-15)},

address = {Hollywood, Florida},

year = {2015}

}