Study of the most probable explanation in hybrid Bayesian networks
Wei Sun, KC Chang · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2011
In addition to computing the posterior distributions for hidden variables in Bayesian networks, one other important inference task is to find the most probable explanation (MPE). MPE provides the most likely configurations to explain away the evidence and helps to manage hypotheses for decision making. In recent years, researchers have proposed a few methods to find the MPE for discrete Bayesian networks. However, finding the MPE for hybrid networks remains challenging. In this paper, we first briefy review the current state-of-the-art in the literature regarding various explanation methods. We then present an algorithm by using a modified max-product clique tree to find the MPE for accommodating the needs in hybrid Bayesian networks. A detailed example is demonstrated to show the algorithm.