Inference in Multiply Sectioned Bayesian Networks with Extended Shafer-Shenoy and Lazy Propagation
This work addresses scalability issues in probabilistic modeling for complex domains, though it is incremental as it builds on existing MSBN and lazy propagation methods.
The paper tackles the problem of performing exact inference in very large Bayesian networks by combining Multiply Sectioned Bayesian Networks (MSBNs) with lazy propagation, resulting in reduced runtime space complexity and enabling inference in larger domains with the same resources.
As Bayesian networks are applied to larger and more complex problem domains, search for flexible modeling and more efficient inference methods is an ongoing effort. Multiply sectioned Bayesian networks (MSBNs) extend the HUGIN inference for Bayesian networks into a coherent framework for flexible modeling and distributed inference.Lazy propagation extends the Shafer-Shenoy and HUGIN inference methods with reduced space complexity. We apply the Shafer-Shenoy and lazy propagation to inference in MSBNs. The combination of the MSBN framework and lazy propagation provides a better framework for modeling and inference in very large domains. It retains the modeling flexibility of MSBNs and reduces the runtime space complexity, allowing exact inference in much larger domains given the same computational resources.