Question: 1 Consider applying the variable elimination algorithm to the umbrella DBN unrolled for three slices, where the query is P(R3|u1, u2, u3). Show that the
1 Consider applying the variable elimination algorithm to the umbrella DBN unrolled for three slices, where the query is P(R3|u1, u2, u3). Show that the space complexity of the algorithm—the size of the largest factor—is the same, regardless of whether the rain variables are eliminated in forward or backward order.
Step by Step Solution
There are 3 Steps involved in it
To determine the space complexity when using the variable elimination algorithm on a discrete Bayesian Network DBN like the umbrella problem we need t... View full answer
Get step-by-step solutions from verified subject matter experts
