Cautious Propagation in Bayesian Networks
This work addresses a specific computational challenge in Bayesian network inference for researchers and practitioners, but it is incremental as it modifies existing propagation methods.
The paper tackles the problem of efficiently computing conditional probabilities for subsets of evidence in Bayesian networks, proposing cautious propagation as a method that provides easy access to these probabilities for many relevant subsets, though it is less efficient than HUGIN propagation.
Consider the situation where some evidence e has been entered to a Bayesian network. When performing conflict analysis, sensitivity analysis, or when answering questions like "What if the finding on X had been y instead of x?" you need probabilities P (e'| h), where e' is a subset of e, and h is a configuration of a (possibly empty) set of variables. Cautious propagation is a modification of HUGIN propagation into a Shafer-Shenoy-like architecture. It is less efficient than HUGIN propagation; however, it provides easy access to P (e'| h) for a great deal of relevant subsets e'.