wvbeaaoo

3 ms·

1. 1.▲
   by wvbeaaoo 10y ago

   the Christopher Bishop chapter on graphical models has a good section on junction trees IIRC
2. 2.▲
   by wvbeaaoo 10y ago

   http://www.psi.toronto.edu/~psi/pubs2/1999%20and%20before/13... I don't know about junction trees but it probably connects as junction trees are a generalization of factor graphs
3. 3.▲
   by wvbeaaoo 10y ago

   cycles can be handled in two ways: if you are happy with approximate solutions, loopy BP can give that (still linear, but may take longer and there's parameter tuning), for exact solutions you can rewrite the graph to "carry"
4. 4.▲
   by wvbeaaoo 10y ago

   by multiply connected graphs do you mean graphs with cycles ?
5. 5.▲
   by wvbeaaoo 10y ago

   by complexity of inference do you mean the complexity of learning the structure of a model ? because inference on an existing PGM is linear in the number of edges with belief-propagation isn't it ?