On-Demand Thrifty Propagation for Belief Updating in Bayesian Networks–A Preliminary Report

Dan Wu, University of Windsor

A maximal prime subgraph decomposition junction tree (MPD-JT) is a useful computational structure that facilitates lazy propagationin Bayesian networks (BNs). A graphical method was proposed to construct an MPD-JT from a BN. In this paper, we present a new method from a relational database (RDB) perspective which sheds light on the semantic meaning of the previously proposed graphical algorithm.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.