<?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="Bayesian network - Page 23 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Bayesian_network&amp;p=22">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Bayesian_network&amp;p=24">3.Next</a>
</p>
<p>pursued within <a href="page.php?w=machine_learning">machine learning</a>. The basic idea goes back to a recovery algorithm developed by Rebane and <a href="page.php?w=Judea_Pearl">Pearl</a> and rests on the distinction between the three possible patterns allowed in a 3-node DAG:</p>

<p>The first 2 represent the same dependencies ( and  are independent given ) and are, therefore, indistinguishable. The collider, however, can be uniquely identified, since  and  are marginally independent and all other pairs are dependent. Thus, while the skeletons</p><p>
<a accesskey="1" href="page.php?w=Bayesian_network&amp;p=22">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Bayesian_network&amp;p=24">3.Next</a>
</p>

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

</card>
</wml>
