Fetching the paper…
Reading the bibliography…
Latent Dirichlet allocation (LDA) is a widely-used probabilistic topic modeling paradigm, and recently finds many applications in computer vision and computational biology.
G. K. Zipf, Human behavior and the principle of least effort . Cambridge, Massachusetts: Addison-Wesley, 1949
1949
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.
L. Bottou, Online learning and stochastic approximations . Cambridge University Press, 1998
1998
Earlier work this paper cites.
B. Thiesson, C. Meek, and D. Heckerman, “Accelerating EM for large databases,” Machine Learning , vol. 45, pp. 279–299, 2001
2001
Earlier work this paper cites.
F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Transactions on Inform. Theory , vol. 47, no. 2, pp. 498–519, 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.
L. Bottou and Y. L. Cun, “Large scale online learning,” in NIPS , 2004, pp. 217–224
2004
Earlier work this paper cites.
J. Winn and C. M. Bishop, “Variational message passing,” J. Mach. Learn. Res. , vol. 6, pp. 661–694, 2005
2005
Earlier work this paper cites.
C. M. Bishop, Pattern recognition and machine learning . Springer, 2006
2006
Earlier work this paper cites.
G. Elidan, I. McGraw, and D. Koller, “Residual belief propagation: Informed scheduling for asynchronous message passing,” in UAI , 2006, pp. 165–173
2006
Earlier work this paper cites.
A. Banerjee and S. Basu, “Topic models over text streams: A study of batch and online unsupervised learning,” in SIAM Data Mining , 2007, pp. 437–442
2007
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.
L. AlSumait, D. Barbará, and C. Domeniconi, “On-line LDA: Adaptive topic models for mining text streams with applications to topic detection and tracking,” in ICDM , 2008, pp. 3–12
2008
Cited alongside, same era.
G. Heinrich, “Parameter estimation for text analysis,” University of Leipzig, Tech. Rep., 2008
2008
Cited alongside, same era.
A. Asuncion, M. Welling, P. Smyth, and Y. W. Teh, “On smoothing and inference for topic models,” in UAI , 2009, pp. 27–34
2009
Cited alongside, same era.
L. Yao, D. Mimno, and A. McCallum, “Efficient methods for topic model inference on streaming document collections,” in KDD , 2009, pp. 937–946
2009
Cited alongside, same era.
K. R. Canini, L. Shi, and T. L. Griffths, “Online inference of topics with latent Dirichlet allocation,” in AISTATS , 2009, pp. 65–72
2009
Cited alongside, same era.
H.-F. Yu, C.-J. Hsieh, K.-W. Chang, and C.-J. Lin, “Large linear classification when data cannot fit in memory,” in KDD , 2010, pp. 833–842
2010
Later among the works it cites.
M. Wahabzada and K. Kersting, “Larger residuals, less work: Active document scheduling for latent Dirichlet allocation,” in ECML/PKDD , 2011, pp. 475–490
2011
Later among the works it cites.
Z. Liu, Y. Zhang, E. Chang, and M. Sun, “Plda+: Parallel latent Dirichlet allocation with data placement and pipeline processing,” ACM Transactions on Intelligent Systems and Technology , p. 26, 2011
2011
Later among the works it cites.
D. M. Blei, “Introduction to probabilistic topic models,” Communications of the ACM , pp. 77–84, 2012
2012
Closest in time.
D. Mimno, M. D. Hoffman, and D. M. Blei, “Sparse stochastic inference for latent Dirichlet allocation,” in ICML , 2012
2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
Y. Wang, H. Bai, M. Stanton, W. Y. Chen, and E. Chang, “Plda: Parallel latent Dirichlet allocation for large-scale applications,” in Algorithmic Aspects in Information and Management , 2009, pp. 301–314
2009
Cited alongside, same era.
F. Yan, N. Xu, and Y. Qi, “Parallel inference for latent Dirichlet allocation on graphics processing units,” in NIPS , 2009, pp. 2134–2142
2009
Cited alongside, same era.
J. Chang, J. Boyd-Graber, S. Gerris, C. Wang, and D. Blei, “Reading tea leaves: How humans interpret topic models,” in NIPS , 2009, pp. 288–296
2009
Cited alongside, same era.
M. Hoffman, D. Blei, and F. Bach, “Online learning for latent Dirichlet allocation,” in NIPS , 2010, pp. 856–864
2010
Cited alongside, same era.
A. Smola and S. Narayanamurthy, “An architecture for parallel topic models,” in PVLDB , 2010, pp. 703–710
2010
Cited alongside, same era.
A. S. Foundation et al. , “Apache Mahout,” 2010, http://mloss.org/software/view/144/
2010
Cited alongside, same era.
Closest in time.
K. Zhai, J. Boyd-Graber, N. Asadi, and M. Alkhouja, “Mr. LDA: A flexible large scale topic modeling package using variational inference in mapreduce,” in WWW , 2012
2012
Closest in time.
J. Zeng, X.-Q. Cao, and Z.-Q. Liu, “Residual belief propagation for topic modeling,” in ADMA , 2012, pp. 739–752
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
J. Zeng, “A topic modeling toolbox using belief propagation,” J. Mach. Learn. Res. , vol. 13, pp. 2233–2236, 2012
2012
Closest in time.
J. Ousterhout et al. , “The case for RAMClouds: Scalable high-performance storage entirely in DRAM,” SIGOPS Operating Systems Review , vol. 43, no. 4, pp. 92–105, 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. 33, no. 5, pp. 1121–1134, 2013
2013
Closest in time.