Cross Validated Asked by JonaSc on January 2, 2021
I’m working through exercises on Belief Propagation and the Junction Tree Algorithm and I’m stuck with the following problem. Consider the distribution P(A,B,C,D,E,F,G,H)=P(A)P(B)P(C)P(F) P(D|A,B)P(E|B,C)P(G|D,F)P(H|E,F), i.e.
The questions asked are:
Now, AFAIK this is a directed polytree (Nodes may have multiple parents, but there is at most a single path between any two nodes). Thus Belief Propagation should allow exact inference in this tree, which is why I would answer "Yes" to both 1) and 2). Is this correct? It seems like I’m missing something here. Why would conditioning change something about whether Belief Propagation can be used here?
Regarding 3, we note that B is cond. indep. of F given no other nodes, so P(B) = P(B|F), is this correct?
Get help from others!
Recent Questions
Recent Answers
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP