Consider doing inference in an m x n lattice Bayes net, as shown in Figure S13.43. The

Question:

Consider doing inference in an m x n lattice Bayes net, as shown in Figure S13.43. The network consists of mn binary variables Vi,j , and you have observed that Vm,n = +vm,n.

You wish to calculate P(V1,1 | + vm,n) using variable elimination. To maximize computational efficiency, you wish to use a variable elimination ordering for which the size of the largest generated factor is as small as possible. 

a. First consider the special case where m = 4 and n = 5. What is the optimal elimination order? 

b. Now consider the general case (assume m > 2 and n > 2). What is the size of the largest factor generated under the most efficient elimination ordering?

Figure S13.43

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: