Fully sparse topic models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7523 LNAI, Issue PART 1, 2012, Pages 490-505

  Than, Khoat ^a   Ho, Tu Bao ^a,b  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b VIETNAM NATIONAL UNIVERSITY   (Viet Nam)

Author keywords

[No Author keywords available]

Indexed keywords

INFERENCE ALGORITHM; LINEAR TIME; PARALLEL IMPLEMENTATIONS; PERFORMANCE MEASURE; RUNNING TIME; SPARSE MATRICES; TOPIC MODEL; TRADE OFF;

LEARNING SYSTEMS;

INFERENCE ENGINES;

EID: 84866872818     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33460-3_37     Document Type: Conference Paper

References (20)

1. Smola, A., Narayanamurthy, S.: An architecture for parallel topic models. Proceedings of the VLDB Endowment 3(1-2), 703-710 (2010)
2. Hoffman, M.D., Blei, D.M., Bach, F.: Online learning for latent dirichlet allocation. In: NIPS, vol. 23, pp. 856-864 (2010)
3. Newman, D., Asuncion, A., Smyth, P., Welling, M.: Distributed algorithms for topic models. The Journal of Machine Learning Research 10, 1801-1828 (2009)
4. Asuncion, A.U., Smyth, P., Welling, M.: Asynchronous distributed estimation of topic models for document analysis. Statistical Methodology 8(1), 3-17 (2011)
5. Wang, Q., Xu, J., Li, H., Craswell, N.: Regularized latent semantic indexing. In: SIGIR 2011, pp. 685-694. ACM (2011)
6. Wang, Y., Bai, H., Stanton, M., Chen,W.-Y., Chang, E.Y.: PLDA: Parallel Latent Dirichlet Allocation for Large-Scale Applications. In: Goldberg, A.V., Zhou, Y. (eds.) AAIM 2009. LNCS, vol. 5564, pp. 301-314. Springer, Heidelberg (2009)
7. Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent dirichlet allocation. Journal of Machine Learning Research 3(3), 993-1022 (2003)
8. Sontag, D., Roy, D.M.: Complexity of inference in latent dirichlet allocation. In: Advances in Neural Information Processing Systems, NIPS (2011)
9. Shashanka, M., Raj, B., Smaragdis, P.: Sparse overcomplete latent variable decomposition of counts data. In: NIPS (2007)
10. Zhu, J., Xing, E.P.: Sparse topical coding. In: UAI (2011)
11. Williamson, S., Wang, C., Heller, K.A., Blei, D.M.: The ibp compound dirichlet process and its application to focused topic modeling. In: ICML (2010)
12. Wang, C., Blei, D.M.: Decoupling sparsity and smoothness in the discrete hierarchical dirichlet process. In: NIPS, vol. 22, pp. 1982-1989 (2009)
13. Hofmann, T.: Unsupervised learning by probabilistic latent semantic analysis. Machine Learning 42, 177-196 (2001)
14. Clarkson, K.L.: Coresets, sparse greedy approximation, and the frank-wolfe algorithm. ACM Trans. Algorithms 6, 63:1-63:30 (2010)
15. Nesterov, Y.: Smooth minimization of non-smooth functions. Mathematical Programming 103(1), 127-152 (2005)
16. Lan, G.: An optimal method for stochastic composite optimization. Mathematical Programming, 1-33 (2011)
17. Murray, W., Gill, P., Wright, M.: Practical optimization. Academic Press (1981)
18. Forster, M.R.: Key concepts in model selection: Performance and generalizability. Journal of Mathematical Psychology 44(1), 205-231 (2000)
19. Fan, R., Chang, K., Hsieh, C., Wang, X., Lin, C.: Liblinear: A library for large linear classification. Journal of Machine Learning Research 9, 1871-1874 (2008)
20. Yu, H.F., Hsieh, C.J., Chang, K.W., Lin, C.J.: Large linear classification when data cannot fit in memory. ACM Trans. Knowl. Discov. Data 5(4), 23:1-23:23 (2012)