Searching for dense subsets in a graph via the partition function.
Alexander I. BarvinokAnthony Della PellaPublished in: CoRR (2018)
Keyphrases
- partition function
- approximate inference
- markov random field
- upper bound
- closed form
- belief propagation
- random fields
- graph structure
- upper and lower bounds
- importance sampling
- bayesian framework
- graphical models
- maximum likelihood estimation
- structure learning
- structured prediction
- probability density function
- higher order
- efficient learning
- pairwise