This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Z . Provide a transformation G of G such that we can test whether P B 1 ( X | Y ) = P B 2 ( X | Y ) using a single d-separation query on G . Note that Z may be the same as X , and that Z may also belong to Y . Your criterion should always be sound, but only be complete in the same sense that d-separation is complete, i.e., for “generic” CPDs. Hint: Although it is possible to do this problem using laborious case analysis, it is signi±-cantly easier to think of how a d-separation query on a transformed graph G can be used to detect whether a perturbation on the CPD P ( Z | Pa Z ) makes a diFerence to P ( X | Y )....
View Full Document
This note was uploaded on 02/05/2010 for the course CS CS229 taught by Professor Eransegal during the Fall '07 term at École Normale Supérieure.
- Fall '07