| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 397197 | International Journal of Approximate Reasoning | 2007 | 12 Pages |
Abstract
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, a new method is presented from a relational database (RDB) perspective which sheds light on the semantic meaning of the previously proposed graphical algorithm.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
