Local Propagation in Conditional Gaussian Bayesian Networks
The Journal of Machine Learning Research
Maximal prime subgraph decomposition of Bayesian networks: A relational database perspective
International Journal of Approximate Reasoning
A join tree probability propagation architecture for semantic modeling
Journal of Intelligent Information Systems
A model searching method based on marginal model structures
AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications
Critical remarks on the maximal prime decomposition of Bayesian networks
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Incremental compilation of bayesian networks
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Triangulation and clique separator decomposition of claw-free graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Mobile context inference using two-layered Bayesian networks for smartphones
Expert Systems with Applications: An International Journal
On the tree structure used by lazy propagation for inference in bayesian networks
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
| Hi-index | 0.00 |
The authors present a method for decomposition of Bayesian networks into their maximal prime subgraphs. The correctness of the method is proven and results relating the maximal prime subgraph decomposition (MPD) to the maximal complete subgraphs of the moral graph of the original Bayesian network are presented. The maximal prime subgraphs of a Bayesian network can be organized as a tree which can be used as the computational structure for LAZY propagation. We also identify a number of tasks performed on Bayesian networks that can benefit from MPD. These tasks are: divide and conquer triangulation, hybrid propagation algorithms combining exact and approximative inference techniques, and incremental construction of junction trees. We compare the proposed algorithm with standard algorithms for decomposition of undirected graphs into their maximal prime subgraphs. The discussion shows that the proposed algorithm is simpler, more easy to comprehend, and it has the same complexity as the standard algorithms