Maximal prime subgraph decomposition of Bayesian networks: A relational database perspective

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. [Copyright &y& Elsevier]