On properties of the minimum entropy sub-tree to compute lower bounds on the partition function.

Mehdi Molkaraie Payam Pakzad

Published in: ISIT (2008)

Keyphrases

bayesian networks
lower bound
partition function
approximate inference
upper bound
graphical models
undirected graphical models
upper and lower bounds
closed form
structured prediction
objective function
markov random field
learning algorithm
special case
maximum likelihood estimation
loopy belief propagation