next up previous
Next: Factor graphs: HMM model Up: MLA_Exercises_2011 Previous: d-separation [4+1* P]

Inference in Factor Graphs [2 P]

Consider a tree-structured factor graph, in which a given subset of the variable nodes form a connected subgraph (i.e., any variable node of the subset is connected to at least one of the other variable nodes via a single factor node). Show how the sum-product algorithm can be used to compute the marginal distribution over that subset.

Haeusler Stefan 2011-12-06