Location of Repository

Nested Junction Trees

By Uffe Kj&amp, U. Nested, Junction Trees, Proceedings Of The and Uffe Kjaerulff and Uffe Kjaerulff

Abstract

The efficiency of inference in both the Hugin and, most notably, the Shafer-Shenoy architectures can be improved by exploiting the independence relations induced by the incoming messages of a clique. That is, the message to be sent from a clique can be computed via a factorization of the clique potential in the form of a junction tree. In this paper we show that by exploiting such nested junction trees in the computation of messages both space and time costs of the conventional propagation methods may be reduced. The paper presents a structured way of exploiting the nested junction trees technique to achieve such reductions. The usefulness of the method is emphasized through a thorough empirical evaluation involving ten large real-world Bayesian networks and the Hugin inference algorithm. 1 INTRODUCTION Inference in Bayesian networks can be formulated as message passing in a junction tree corresponding to the network (Jensen, Lauritzen & Olesen 1990, Shafer & Shenoy 1990). More precis..

Year: 1997
OAI identifier: oai:CiteSeerX.psu:10.1.1.19.7652
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.auc.dk/research/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.