Maximal Prime Subgraph Decomposition of Bayesian Networks

A maximal prime subgraph decomposition junction tree (MPD-JT) is a useful computational structure that facilitates lazy propagation in 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.

• Type: Conference
• Year: 2001
• Where: FLAIRS
• Authors: Kristian G. Olesen, Anders L. Madsen
• Keywords: Artificial Intelligence, Decomposition Junction Tree, FLAIRS 2001, Maximal Prime Subgraph, Useful Computational Structure