08.02.2013 Views

Bernal S D_2010.pdf - University of Plymouth

Bernal S D_2010.pdf - University of Plymouth

Bernal S D_2010.pdf - University of Plymouth

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

3,3. i^^lNITION AND MATHEMATICAL FORMVLATION<br />

dition established by converging nodes, described in Section 3.3.2, and matches our intuition<br />

regarding multiple causes. Without any information about the state <strong>of</strong> the Waves, data on the<br />

slate <strong>of</strong> Gales should not influence the state <strong>of</strong> Moon, as they are conditionally independent<br />

causes.<br />

3.3.3.10 Example <strong>of</strong> belief propagation with tree structure<br />

The previous examples are all based on a network with the same simple structure; a central node<br />

with two parents and two children node. Although this type <strong>of</strong> structure serves to demonstrate<br />

the main concepts behind belief propagation, it does not capture an inten2,sting effect <strong>of</strong> h^e-<br />

stnictured networks, which is therefore described in this subsection.<br />

In this case the network has three levels organized in a tree structure as shown in Figure 3.9. In<br />

the first step, evidence propagates from two <strong>of</strong> the child nodes in the lower level, leading to the<br />

update <strong>of</strong> the belief in the intcnnediaie nodes. In the second step, the belief at the top level is<br />

updated, together with the belief <strong>of</strong> the lower-lever child nodes that hadn't been instantiated.<br />

The crucial process occurs in step three when a message is sent downward from the top node.<br />

Note this didn't happen in the network <strong>of</strong> the previous examples, where Ihe propagation ended<br />

once the message reached the top nodes. The reason is that in this case the top node receives<br />

messages from the two intermediate child nodes (the left and the right branches <strong>of</strong> the tree), and<br />

therefore it must generate a top-down message for each node convcyinp the evidence collected<br />

from the other node. In other words the evidence from the left branch must be propagated to the<br />

nodes in the right branch and vice versa. This is depicted graphically in steps three and four.<br />

In the original example, an equivalent flow <strong>of</strong> evidence would happen, for example, if node<br />

Gales had a second child node, such as Fallen frees. Evidence originating in the node Surfing<br />

would propagate up the node Waves to the root node Gales and back down the opposite branch.<br />

'Caption for Figure 3.8. Cjtample <strong>of</strong> belief propagation wiih no evidence. When all the boltomup A messages<br />

received by a node show Hat ilistribuiions, as is ihe erase <strong>of</strong> node W, jnevKabiy all [he A messages sent to its parent<br />

nodes will also show flat distributions, regardless <strong>of</strong> the incoming n messages. The prior probability (or evidence)<br />

at Ihe top causal nodes 0 and M does not influence the other causal node, until their common child W gathers<br />

some diagnostic evidence. This reflects the d-separntion condiLioii established by converging nodes, described in<br />

Section 3.,^.2, and matches our intuition regarding multiple causes. Without iiny inlormaiiiin about the state <strong>of</strong> the<br />

Woven, data on the state <strong>of</strong> Gnies should not influence the stale <strong>of</strong> Moon, as they are conditionally independent<br />

causes,<br />

103

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!