Belief Updating in Bayesian Networks
In this chapter, we present an algorithm for probability updating. An efficient updating algorithm is fundamental to the applicability of Bayesian networks. As shown in Chapter 1, access to P(U, e) is sufficient for the calculations. However, because the joint probability table increases exponentially with the number of variables, we look for more efficient methods. Unfortunately, no method guarantees a tractable calculation task. However, the method presented here represents a substantial improvement, and it is among the most efficient methods known.
KeywordsBayesian Network Undirected Graph Time Slice Elimination Order Junction Tree
Unable to display preview. Download preview PDF.