Computer Science 188 - Fall 1997 - Russell - Final Exam

B 2 which network has the fewest parameters c 3 write

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: l knowledge? (b) (2) Which network has the fewest parameters? (c) (3) Write down some reasonable CPT values for node C in network (i). 3 (d) (3) Using network (i), derive a symbolic expression for P(B jS) in terms of conditional probabilities available in the CPTs, by conditioning on one or more other variables. (Do not plug in any numbers.) (e) (4) Using network (i), derive a symbolic expression for P(LjB) in terms of conditional probabilities available in the CPTs. (You will need Bayes' Rule as well as conditioning here.) (f) (4) Suppose that, in a polytree network, X is an ancestor of Y and we wish to compute P(Y jX) in terms of the CPT entries of the network. Explain why conditioning operations su ce for this computation and describe in general terms the minimal set of conditioning operations that must be carried out. Hint: you may nd it useful to consider an example such as the following, although the speci c details of the example need not appear in your answer:] X Y 4...
View Full Document

This note was uploaded on 05/17/2009 for the course CS 188 taught by Professor Staff during the Spring '08 term at University of California, Berkeley.

Ask a homework question - tutors are online