More influence means less work: Fast latent Dirichlet allocation by influence scheduling

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2011, Pages 2273-2276

  Wahabzada, Mirwaes ^a   Kersting, Kristian ^a   Pilz, Anja ^a   Bauckhage, Christian ^a  

^a FRAUNHOFER IAIS   (Germany)

Author keywords

latent dirichlet allocation; stochastic gradient

Indexed keywords

DOCUMENT COLLECTION; FAST INFERENCE; LATENT DIRICHLET ALLOCATION; LATENT DIRICHLET ALLOCATIONS; REAL-WORLD DATASETS; STOCHASTIC GRADIENT; STOCHASTIC OPTIMIZATIONS; TOPIC MODEL; WIKIPEDIA;

KNOWLEDGE MANAGEMENT; STATISTICS; STOCHASTIC SYSTEMS;

SCHEDULING;

EID: 83055186736     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2063576.2063944     Document Type: Conference Paper

References (8)

1. D.M. Blei, A. Ng, and M. Jordan. Latent dirichlet allocation. JMLR, 3:993-1022, 2003.
2. C. Ding, T. Li, and W. Peng. NMF and PLSI: Equivalence and a Hybrid Algorithm. In Proc. SIGIR, 2006.
3. A. Frieze, R. Kannan, and S. Vempala. Fast monte-carlo algorithms for finding low-rank approximations. Journal of the ACM, 51(6):1025-1041, 2004. (Pubitemid 40818314)
4. M. Girolami and A. Kaban. On an Equivalence between PLSI and LDA. In Proc. SIGIR, 2003.
5. M. Hoffman, D.M. Blei, and F. Bach. Online learning for latent dirichlet allocation. In Proc. NIPS, 2010.
6. M.W. Mahoney and P. Drineas. Cur matrix decompositions for improved data analysis. Proceedings of the National Academy of Sciences of the United States of America (PNAS), 106(3):697{703, 2009.
7. Y. Sun, D. Wierstra, T. Schaul, and J. Schmidhuber. Stochastic search using the natural gradient. In Proceedings of ICML, page 146, 2009.
8. M. Wahabzada and K. Kersting. Larger residuals, less work: Active document scheduling for latent dirichlet allocation. In Proceedings of ECML PKDD, 2011.