Computing the partition function for graph homomorphisms with multiplicities.
Alexander I. BarvinokPablo SoberónPublished in: J. Comb. Theory, Ser. A (2016)
Keyphrases
- partition function
- upper bound
- belief propagation
- markov random field
- closed form
- graph structure
- importance sampling
- approximate inference
- random fields
- parameter estimation
- bayesian framework
- maximum likelihood estimation
- linear combination
- lower bound
- probability density function
- bayesian networks
- conditional random fields
- structure learning
- dynamic programming
- structured prediction