Exercise 10.3 - Markov blanket for a DGM

Answers

The trick in the required reduction is to partition all variables into:

p ( 𝒳 ) = p ( 𝒜 ) p ( X i | Pa ( X i ) ) Y j ch ( X i ) p ( Y j | Pa ( Y j ) ) p ( B | 𝒜 , 𝒴 ) ,

where 𝒴 = ch ( X i ) , 𝒜 contains the collection of all variable that are topological smaller than X i , hence Pa ( X i ) 𝒜 . Moreover, we have 𝒜 incorporate:

Y j ch ( X i ) Pa ( Y j ) { X i } Y j ch ( X i ) Pa { Y j } .

So all elements of 𝒜 can be safely evaluated before X i . Then all X i ’s children can be computed according to a topological order. Finally, the rest variables B can be evaluated.

We have:

p ( X i | X i ) = p ( 𝒳 ) p ( X i ) = p ( 𝒳 ) x i p ( 𝒳 , X i = x i ) .

Eliminating the terms p ( 𝒜 ) and p ( B | 𝒜 , 𝒴 ) from both the numerator and the denominator we have (10.58).

User profile picture
2021-03-24 13:42
Comments