Rapid mixing of Gibbs sampling on graphs that are sparse on average.
Elchanan MosselAllan SlyPublished in: SODA (2008)
Keyphrases
- gibbs sampling
- markov chain
- approximate inference
- topic models
- latent dirichlet allocation
- em algorithm
- belief networks
- expectation maximization
- parameter estimation
- markov chain monte carlo
- exact inference
- graphical models
- data mining
- sparse representation
- latent variables
- co occurrence
- high dimensional
- bayesian networks
- information retrieval