Based on libdai implementation, I think before doing inference we need to convert the graphs into an array of factors (represented as .fg files). For example:

1) In Bayesian networks, a factor would be the D-separated distribution.

2) In Markov networks, a factor would be an element of the Gibbs distribution, or often called energy in Ising model.

Does it mean that we can write the same inference implementation for both types of networks?

If yes, what is the official algorithm that convert Bayesian networks into the array of factors? Or is there more than one way to convert it?

asked Jul 09 '14 at 13:31

Dzung%20Nguyen's gravatar image

Dzung Nguyen
2681013

edited Jul 09 '14 at 14:09


One Answer:

Please search for Factor Graphs.

answered Jul 10 '14 at 08:16

Yun%20Zhou's gravatar image

Yun Zhou
712

One more question, is cluster graph and clique tree just an instatiation of the general factor graph?

(Jul 13 '14 at 11:36) Dzung Nguyen
Your answer
toggle preview

powered by OSQA

User submitted content is under Creative Commons: Attribution - Share Alike; Other things copyright (C) 2010, MetaOptimize LLC.