Prev Up
Go backward to Solution to part (f)
Go up to 4 Variable Elimination Algorithm (Multiply Connected)

Solution to part (g)

This is sometimes called the moral graph, as we married the parents of each node. Note this is all you ever do to get this graph; draw arcs between all of the parents of each node, and drop the arc directions.
The variables on the intersections of the cliques correspond to the factors added in the VE algorithm. The last two factors of the VE algorithm are needed to get a factor on J from the HIJ clique.

As an extra exercise, draw the junction tree corresponding to the two variable elimination orderings in the solution to part (f).

Computational Intelligence online material, ©David Poole, Alan Mackworth and Randy Goebel, 1999

Prev Up