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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

.1,3. DEHNITION AND MATHEMATICAL FORMULATiON<br />

Note the example described is just a toy scenario which does not accurately reflect the physical<br />

factors affecting wave generation, or the effects waves may have on surhng and fishing activity.<br />

Any real life situation is practically impossible to capture using such a reduced number <strong>of</strong><br />

variables and states. However, the analogy with a real-world situation is useful to explain the<br />

different maihematicrtl constructs in this section.<br />

3,3.2.2 Directiunal separation and explainin|> away<br />

Graphical models can be divided into two categories: directed and undirected. Undirected<br />

graphical models, also called Markov random fields, have a simple definition <strong>of</strong> independence.<br />

Two sets <strong>of</strong> nodes A and B are conditionally independent given a third set, C, if all paths<br />

between the nodes in A and B are separated by a node in C. By contrast, directed graphical<br />

models (Bayesian networks), have a more complicated notion <strong>of</strong> independence, which lakes<br />

into account the directionality <strong>of</strong> the arcs. Directionality, however, has several advantages. The<br />

most imponanl is thai causality is clearly defined, such that an arc from A -> B indicates that<br />

A causes B. This facilitates the construction <strong>of</strong> the graph structure, and the parameter learning<br />

process or fitting to data. Not all causal relationships captured with directed graphical models<br />

can be represented using undirected graphical models, and vice versa (I'earl 1988, Murphy<br />

2002).<br />

Before describing directional separation in Bayesian networks, it is important lo define the<br />

concept and the different types o(evidence. An evidence function that assigns a zero probability<br />

lo all but one slate is <strong>of</strong>ten said to provide hard evidence; otherwise, it is said to provide s<strong>of</strong>t<br />

evidence (e.g. 90%probability <strong>of</strong> being true and 10% probability <strong>of</strong> being false). Hard evidence<br />

on a variable X is also <strong>of</strong>ten referred to as instantiation <strong>of</strong> X or lo X being observed or known.<br />

Note that, as s<strong>of</strong>t evidence is a more general kind <strong>of</strong> evidence, hard evidence can be considered<br />

a special type <strong>of</strong> s<strong>of</strong>t evidence. If the disiinciion is unimportiml we will leave out the hard or<br />

s<strong>of</strong>t qualifier, and simply talk about evidence.<br />

Due to the directionality <strong>of</strong> arcs, there are three ditTerent types <strong>of</strong> connections in Bayesian<br />

networks:<br />

80

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

Saved successfully!

Ooh no, something went wrong!