24.06.2015 Views

Review of Probability Theory - Sorry

Review of Probability Theory - Sorry

Review of Probability Theory - Sorry

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.

(7)<br />

Denominator p() is a normalization factor. It ensures that the sum <strong>of</strong> probabilities p(C l | )<br />

is equal to 1 when l varies.<br />

Some classes appear more frequently than others, and P(C l ) denotes the a priori probability <strong>of</strong><br />

meeting class C l .<br />

p( | C l ). denotes the conditional probability <strong>of</strong> meeting the element<br />

on class C l ( given that class C l is true).<br />

, given that we focus<br />

Parameters<br />

The use <strong>of</strong> a Bayesian classifier implies that we know:<br />

• the a priori probabilities P(C l ) that class C l appears;<br />

• and the conditional probability p( | C l ) <strong>of</strong> being in the presence <strong>of</strong> element ,<br />

given that the observation class is C l .<br />

1. A priori probability P(C l )<br />

If the examples used to sympl the system to recognize each sympl, are sufficiently<br />

numerous, then a priori probability P(C l ) can be estimated as the frequency <strong>of</strong><br />

appearance <strong>of</strong> this sympl in comparison with the other classes. This is the most <strong>of</strong>ten<br />

observed approach when the system is taught to recognize classes from symplex.<br />

2. Conditional probability p( | C l )<br />

The estimation <strong>of</strong> the conditional probability p( | C l ) represents the main problem.<br />

It is very difficult because it requires the estimation <strong>of</strong> the conditional probabilities for<br />

all the possible combinations <strong>of</strong> elements, given one particular class.<br />

In reality, it is impossible to calculate these estimations. Some assumptions <strong>of</strong><br />

simplification are <strong>of</strong>ten used in order to make the training <strong>of</strong> the system feasible. The<br />

assumption most frequently used is that <strong>of</strong> conditional independence which states that<br />

the probability <strong>of</strong> two elements 1 and 2 ,given that class is C l , is the product <strong>of</strong> the<br />

probabilities <strong>of</strong> each element taken separately, given that class is C l :

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

Saved successfully!

Ooh no, something went wrong!