Computing the partition function for graph homomorphisms.
Alexander I. BarvinokPablo SoberónPublished in: Comb. (2017)
Keyphrases
- partition function
- closed form
- upper bound
- approximate inference
- graph structure
- importance sampling
- upper and lower bounds
- markov random field
- belief propagation
- random fields
- probability density function
- graphical models
- lower bound
- message passing
- parameter estimation
- maximum likelihood estimation
- closed form solutions
- probabilistic model
- hidden markov models
- loopy belief propagation
- special case