<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Pattern recognition - Page 17 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=pattern_recognition&amp;p=16">1.Previous</a><br />
<a accesskey="3" href="page.php?w=pattern_recognition&amp;p=18">3.Next</a>
</p>
<p>the probability of all possible labels is output. Probabilistic algorithms have many advantages over non-probabilistic algorithms:<br/>
*They output a confidence value associated with their choice. (Note that some other algorithms may also output confidence values, but in general, only for probabilistic algorithms is this value mathematically grounded in <a href="page.php?w=probability_theory">probability theory</a>. Non-probabilistic confidence values can in general not be given any specific meaning, and only used to compare against other confidence</p><p>
<a accesskey="1" href="page.php?w=pattern_recognition&amp;p=16">1.Previous</a><br />
<a accesskey="3" href="page.php?w=pattern_recognition&amp;p=18">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
