Deterministic single-pass algorithm for LDA

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Sato, Issei ^a   Kurihara, Kenichi ^b   Nakagawa, Hiroshi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b Google Inc   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BATCH ALGORITHMS; DETERMINISTICS; LATENT DIRICHLET ALLOCATION; SINGLE-PASS ALGORITHM; TEXT STREAMS;

STATISTICS;

EID: 85161976784     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Loulwah Alsumait, Daniel Barbara, and Carlotta Domeniconi. On-line lda: Adaptive topic models for mining text streams with applications to topic detection and tracking. IEEE International Conference on Data Mining, 0:3-12, 2008. ISSN 1550-4786.
2. A. Asuncion, M. Welling, P. Smyth, and Y. W. Teh. On smoothing and inference for topic models. In Proceedings of the International Conference on Uncertainty in Artificial Intelligence, 2009.
3. Arindam Banerjee and Sugato Basu. Topic models over text streams: A study of batch and online unsupervised learning. In SIAM International Conference on Data Mining, 2007.
4. D. P. Bertsekas and J. N. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, 1996.
5. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent Dirichlet allocation. Journal of Machine Learning Research, 3:993-1022, 2003.
6. Eric Brochu, Nando de Freitas, and Kejie Bao. Owed to a martingale: A fast bayesian on-line em algorithm for multinomial models, 2004.
7. Kevin R. Canini, Lei Shi, and Thomas L. Griffiths. Online inference of topics with latent dirichlet allocation. In Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics, 2009.
8. H.Robbins and S.Monro. A stochastic approximation method. In Annals of Mathematical Statistics, pages 400-407, 1951.
9. Thomas P. Minka. Estimating a dirichlet distribution. Technical report, Microsoft, 2000. URL http://research.microsoft.com/-minka/papers/dirichlet/ minka-dirichlet.pdf.
10. Thomas P. Minka. Using lower bounds to approximate integrals. Technical report, Microsoft, 2001. URL http://research.microsoft.com/en-us/um/people/ minka/papers/rem.html.
11. R. Neal and G. Hinton. A view of the EM algorithm that justifies incremental, sparse, and other variants. In M. I. Jordan, editor, Learning in Graphical Models. Kluwer, 1998. URL http://citeseerx.ist.psu.edu/viewdoc/ summary?doi=10.1.1.33.2557.
12. Masa A. Sato and Shin Ishii. On-line em algorithm for the normalized gaussian network. Neural Computation, 12(2):407-432, 2000. URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.3704.
13. Yee Whye Teh, David Newman, and MaxWelling. A collapsed variational Bayesian inference algorithm for latent Dirichlet allocation. In Advances in Neural Information Processing Systems 19, 2007.
14. Hanna Wallach, David Mimno, and Andrew McCallum. Rethinking lda: Why priors matter. In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, editors, Advances in Neural Information Processing Systems 22, pages 1973-1981. 2009.
15. Limin Yao, David Mimno, and Andrew McCallum. Efficient methods for topic model inference on streaming document collections. In KDD '09: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 937-946, New York, NY, USA, 2009. ACM. ISBN 978-1-60558-495-9.