31 citations · 125 across the 11 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2010★ 7 cited
Discrete geometric analysis of message passing algorithm on graphs
Yusuke Watanabe
We often encounter probability distributions given as unnormalized products of non-negative functions. The factorization structures are represented by hypergraphs called factor gra…
cs.DM2009★ 2 cited
Graph polynomials and approximation of partition functions with Loopy Belief Propagation
Yusuke Watanabe, Kenji Fukumizu
The Bethe approximation, or loopy belief propagation algorithm is a successful method for approximating partition functions of probabilistic models associated with a graph. Chertko…