Fetching the paper…
Reading the bibliography…
The expectation-maximization (EM) algorithm can compute the maximum-likelihood (ML) or maximum a posterior (MAP) point estimate of the mixture models or latent variable models such as latent Dirichlet allocation (LDA), which has been one of the most popular probabilistic topic modeling methods in the past decade.
H. Robbins and S. Monro, “A stochastic approximation method,” The Annals of Mathematical Statistics , vol. 22, no. 3, pp. 400–407, 1951
1951
Earlier work this paper cites.
A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” Journal of the Royal Statistical Society, Series B , vol. 39, pp. 1–38, 1977
1977
Earlier work this paper cites.
R. M. Neal and G. E. Hinton, “A view of the EM algorithm that justifies incremental, sparse, and other variants,” vol. 89, pp. 355–368, 1998
1998
Earlier work this paper cites.
M. Sato and S. Ishii, “On-line EM algorithm for the normalized gaussian network,” Neural Computation , vol. 12, pp. 407–432, 2000
2000
Earlier work this paper cites.
N. de Freitas and K. Barnard, “Bayesian latent semantic analysis of multimedia databases,” University of British Columbia, Tech. Rep., 2001
2001
Earlier work this paper cites.
T. Hofmann, “Unsupervised learning by probabilistic latent semantic analysis,” Machine Learning , vol. 42, pp. 177–196, 2001
2001
Earlier work this paper cites.
D. M. Blei, A. Y. Ng, and M. I. Jordan, “Latent Dirichlet allocation,” J. Mach. Learn. Res. , vol. 3, pp. 993–1022, 2003
2003
Earlier work this paper cites.
T. L. Griffiths and M. Steyvers, “Finding scientific topics,” Proc. Natl. Acad. Sci. , vol. 101, pp. 5228–5235, 2004
2004
Earlier work this paper cites.
Y. W. Teh, D. Newman, and M. Welling, “A collapsed variational Bayesian inference algorithm for latent Dirichlet allocation,” in NIPS , 2007, pp. 1353–1360
2007
Earlier work this paper cites.
I. Porteous, D. Newman, A. Ihler, A. Asuncion, P. Smyth, and M. Welling, “Fast collapsed Gibbs sampling for latent Dirichlet allocation,” in KDD , 2008, pp. 569–577
2008
Earlier work this paper cites.
A. Asuncion, M. Welling, P. Smyth, and Y. W. Teh, “On smoothing and inference for topic models,” in UAI , 2009, pp. 27–34
2009
Earlier work this paper cites.
L. Yao, D. Mimno, and A. McCallum, “Efficient methods for topic model inference on streaming document collections,” in KDD , 2009, pp. 937–946
2009
Earlier work this paper cites.
D. Newman, A. Asuncion, P. Smyth, and M. Welling, “Distributed algorithms for topic models,” J. Mach. Learn. Res. , vol. 10, pp. 1801–1828, 2009
2009
Cited alongside, same era.
O. Cappé and E. Moulines, “Online expectation-maximization algorithm for latent data models,” Journal of the Royal Statistical Society: Series B , vol. 71, no. 3, pp. 593–613, 2009
2009
Cited alongside, same era.
P. Liang and D. Klein, “Online EM for unsupervised models,” in Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the ACL , 2009, pp. 611–619
2009
Cited alongside, same era.
H. M. Wallach, I. Murray, R. Salakhutdinov, and D. M. Mimno, “Evaluation methods for topic models,” in ICML , 2009, pp. 139–146
2009
Cited alongside, same era.
M. Hoffman, D. Blei, and F. Bach, “Online learning for latent Dirichlet allocation,” in NIPS , 2010, pp. 856–864
2012
Closest in time.
——, “Online belief propagation for topic modeling,” arXiv:1210.2179 [cs.LG] , 2012
2012
Closest in time.
K. P. Murphy, Machine Learning: A Probabilistic Perspective . The MIT Press, 2012
2012
Closest in time.
J. Zeng, W. K. Cheung, and J. Liu, “Learning topic models by belief propagation,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 35, no. 5, pp. 1121–1134, 2013
2013
Closest in time.
J. R. Foulds, L. Boyles, C. DuBois, P. Smyth, and M. Welling, “Stochastic collapsed variational Bayesian inference for latent Dirichlet allocation,” in KDD , 2013, pp. 446–454
2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
M. Wahabzada and K. Kersting, “Larger residuals, less work: Active document scheduling for latent Dirichlet allocation,” in ECML/PKDD , 2011, pp. 475–490
2011
Cited alongside, same era.
C. Wang and D. M. Blei, “Collaborative topic modeling for recommending scientific articles,” in KDD , 2011
2011
Cited alongside, same era.
D. M. Blei, “Introduction to probabilistic topic models,” Communications of the ACM , pp. 77–84, 2012
2012
Cited alongside, same era.
J. Zeng, “A topic modeling toolbox using belief propagation,” J. Mach. Learn. Res. , vol. 13, pp. 2233–2236, 2012
2012
Cited alongside, same era.
J. Zeng, X.-Q. Cao, and Z.-Q. Liu, “Residual belief propagation for topic modeling,” in ADMA , 2012, pp. 739–752
2012
Cited alongside, same era.
D. Mimno, M. D. Hoffman, and D. M. Blei, “Sparse stochastic inference for latent Dirichlet allocation,” in ICML , 2012
2012
Cited alongside, same era.
A. Ahmed, M. Aly, J. Gonzalez, S. Narayanamurthy, and A. Smola, “Scalable inference in latent variable models,” in WSDM , 2012, pp. 123–132
2012
Cited alongside, same era.
Closest in time.
K. Zhai and J. Boyd-Graber, “Online latent Dirichlet allocation with infinite vocabulary,” in ICML , 2013, pp. 561–569
2013
Closest in time.
2013
Closest in time.
S. Mandt and D. M. Blei, “Smoothed gradients for stochastic variational inference,” in NIPS , 2014, pp. 2438–2446
2014
Closest in time.
A. Q. Li, A. Ahmed, S. Ravi, and A. J. Smola, “Reducing the sampling complexity of topic models,” in KDD , 2014
2014
Closest in time.
Y. Wang, X. Zhao, Z. Sun, H. Yan, L. Wang, Z. Jin, L. Wang, Y. Gao, C. Law, and J. Zeng, “Peacock: Learning long-tail topic features for industrial applications,” ACM Transactions on Intelligent Systems and Technology , vol. 6, no. 4, p. 47, 2015
2015
Closest in time.
X. Liu, J. Zeng, X. Yang, J. Yan, and Q. Yang, “Scalable parallel EM algorithms for latent Dirichlet allocation in multi-core systems,” in WWW , 2015, pp. 669–679
2015
Closest in time.
Y. Huang, F. Zhu, M. Yuan, K. Deng, Y. Li, B. Ni, W. Dai, Q. Yang, and J. Zeng, “Telco churn prediction with big data,” in SIGMOD , 2015, pp. 607–618
2015
Closest in time.