Computing the Partition Function for Perfect Matchings in a Hypergraph.
Alexander I. BarvinokAlex SamorodnitskyPublished in: Comb. Probab. Comput. (2011)
Keyphrases
- partition function
- markov random field
- closed form
- random fields
- structured prediction
- belief propagation
- higher order
- high order
- probability density function
- approximate inference
- upper bound
- pairwise
- importance sampling
- bayesian framework
- upper and lower bounds
- maximum a posteriori
- maximum likelihood estimation
- graphical models
- prior knowledge