Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
cs-401r:assignment-2.5 [2014/10/02 06:09]
ringger [Question 2]
cs-401r:assignment-2.5 [2014/10/02 06:09] (current)
ringger
Line 41: Line 41:
 * Assuming that the value of $S$ is known, list ''​all''​ independence relations between $T$ and other variables. ​ Be sure to consider all of the cases in which the other variables in the model have known values and when they do not. * Assuming that the value of $S$ is known, list ''​all''​ independence relations between $T$ and other variables. ​ Be sure to consider all of the cases in which the other variables in the model have known values and when they do not.
 ** As in the first bullet, there are 12 answers to be given here as well. ** As in the first bullet, there are 12 answers to be given here as well.
 +
 +''​2015'':​ '''​Note''':​ Assume that the CPTs in the model contain values such that if influence is possible between a pair of nodes -- given values of other variables in the model -- using the heuristics we have discussed, then conditional independence will not hold.  Under that assumption, the structure of the graph will be sufficient to tell you that a given conditional independence statement is false.
  
 === Question 4 === === Question 4 ===
cs-401r/assignment-2.5.txt ยท Last modified: 2014/10/02 06:09 by ringger
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0