title: Learning topic models by belief propagation.
abstract: Latent Dirichlet allocation (LDA) is an important hierarchical Bayesian model for probabilistic topic modeling, which attracts worldwide interest and touches on many important applications in text mining, computer vision and computational biology. This paper represents the collapsed LDA as a factor graph, which enables the classic loopy belief propagation (BP) algorithm for approximate inference and parameter estimation. Although two commonly used approximate inference methods, such as variational Bayes (VB) and collapsed Gibbs sampling (GS), have gained great success in learning LDA, the proposed BP is competitive in both speed and accuracy, as validated by encouraging experimental results on four large-scale document datasets. Furthermore, the BP algorithm has the potential to become a generic scheme for learning variants of LDA-based topic models in the collapsed space. To this end, we show how to learn two typical variants of LDA-based topic models, such as author-topic models (ATM) and relational topic models (RTM), using BP based on the factor graph representations.
authors.affiliation: School of Computer Science and Technology, Soochow University, Suzhou 215006, China. j.zeng@ieee.org
authors.forename: Jia
authors.initials: J
authors.lastname: Zeng
authors.forename: William K
authors.initials: WK
authors.lastname: Cheung
authors.forename: Jiming
authors.initials: J
authors.lastname: Liu