Learning topic models - Going beyond SVD

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2012, Pages 1-10

  Arora, Sanjeev ^a   Ge, Rong ^a   Moitra, Ankur ^b  

^a PRINCETON UNIVERSITY   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATION MODEL; APPLICATION AREA; CLASSIFICATION OF DATA; CONVEX COMBINATIONS; LATENT DIRICHLET ALLOCATION; NONNEGATIVE MATRIX FACTORIZATION; POLYNOMIAL-TIME ALGORITHMS; PROBABILISTIC MODELS; REAL LIFE DATA; REALISTIC MODEL; SIMILAR MODELS; THEMATIC STRUCTURES; THEORETICAL RESULT; THEORETICAL STUDY; TOPIC MODEL; TOPIC VECTOR;

ALGORITHMS; COMPUTER SCIENCE; INFORMATION RETRIEVAL SYSTEMS; PROBABILITY DISTRIBUTIONS; SINGULAR VALUE DECOMPOSITION; STATISTICS; VECTORS;

MODELS;

EID: 84871960604     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2012.49     Document Type: Conference Paper

References (35)

1. A. Anandkumar, D. Foster, D. Hsu, S. Kakade, Y. Liu Two SVDs Suffice: Spectral decompositions for probabilistic topic modeling and latent Dirichlet allocation Arxiv, 2012
2. A. Anandkumar, D. Hsu and S. Kakade. A method of moments for mixture models and hidden Markov models. Arxiv, 2012.
3. S. Arora, R. Ge, R. Kannan and A. Moitra. Computing a nonnegative matrix factorization - provably. STOC 2012.
4. Y. Azar, A. Fiat, A. Karlin, F. McSherry and J. Saia. Spectral analysis of data. STOC, pp. 619-626, 2001.
5. D. Blei. Introduction to probabilistic topic models. Communications of the ACM, pp. 77-84, 2012.
6. D. Blei. Personal communication.
7. D. Blei, A. Ng and M. Jordan. Latent Dirichlet Allocation. Journal of Machine Learning Research, pp. 993-1022, 2003. Preliminary version in NIPS 2001.
8. D. Blei and J. Lafferty. A correlated topic model of Science. Annals of Applied Statistics, pp. 17-35, 2007.
9. D. Blei and J. Lafferty. Dynamic topic models. ICML, pp. 113-120, 2006.
10. J. Cohen and U. Rothblum. Nonnegative ranks, decompositions and factorizations of nonnegative matices. Linear Algebra and its Applications, pp. 149-168, 1993.
11. S. Deerwester, S. Dumais, T. Landauer, G. Furnas and R. Harshman. Indexing by latent semantic analysis. JASIS, pp. 391-407, 1990.
12. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM Algorithm. J. Roy. Statist. Soc. Ser. B, pp. 1-38, 1977.
13. D. Donoho and V. Stodden. When does non-negative matrix factorization give the correct decomposition into parts? NIPS, 2003.
14. A. Frank, and A. Asuncion. UCI Machine Learning Repository http://archive.ics.uci.edu/ml. Irvine, CA: University of California, School of Information and Computer Science. 2010.
15. G. Golub and C. van Loan. Matrix Computations The Johns Hopkins University Press, 1996.
16. N. Gravin, J. Lasserre, D. Pasechnik and S. Robins. The inverse moment problem for convex polytopes. Discrete and Computation Geometry, 2012.
17. T. Hofmann. Probabilistic latent semantic analysis. UAI, pp. 289-296, 1999.
18. P. Hoyer. Non-negative matrix factorization with sparseness constraints. Journal of Machine Learning Research, pp. 1457-1469, 2004.
19. A. Hyvärinen, J. Karhunen and E. Oja. Independent Component Analysis. Wiley Interscience, 2001.
20. M. Jordan, Z. Ghahramani, T. Jaakola and L. Saul. Introduction to variational methods for graphical models. Machine Learning, pp. 183-233, 1999.
21. J. Kleinberg and M. Sandler. Using mixture models for collaborative filtering. JCSS, pp. 49-69, 2008. Preliminary version in STOC 2004.
22. J. Kleinberg and M. Sandler. Convergent algorithms for collaborative filtering. ACM EC, pp. 1-10, 2003.
23. R. Kumar, P. Raghavan, S. Rajagopalan and A. Tomkins. Recommendation systems: a probabilistic analysis. JCSS, pp. 42-61, 2001. Preliminary version in FOCS 1998.
24. D. Lee and H. Seung. Learning the parts of objects by nonnegative matrix factorization. Nature, pp. 788-791, 1999.
25. D. Lee and H. Seung. Algorithms for non-negative matrix factorization. NIPS, pp. 556-562, 2000.
26. W. Li and A. McCallum. Pachinko Allocation: DAG-structured mixture models of topic correlations. ICML, pp. 633-640, 2007.
27. J. Matousek. Lectures on Discrete Geometry. Springer, 2002.
28. A.K. McCallum. MALLET: A Machine Learning for Language Toolkit. http://mallet.cs.umass.edu. 2002.
29. F. McSherry. Spectral partitioning of random graphs. FOCS, pp. 529-537, 2001.
30. C. Papadimitriou, P. Raghavan, H. Tamaki and S. Vempala. Latent semantic indexing: a probabilistic analysis. JCSS, pp. 217-235, 2000. Preliminary version in PODS 1998.
31. R. A. Redner and H. F. Walker. Mixture densities, maximum likelihood and the EM Algorithm. SIAM Rev., pp. 195-239, 1984.
32. D. Sontag and D. Roy. Complexity of inference in Latent Dirichlet Allocation. NIPS, pp. 1008-1016, 2011.
33. W. Xu and X. Liu and Y. Gong. Document clustering based on non-negative matrix factorization. SIGIR, pp. 267-273, 2003.
34. S. Vavasis. On the complexity of nonnegative matrix factorization. SIAM Journal on Optimization, pp. 1364-1377, 2009.
35. M. Wainwright and M. Jordan. Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning, pp. 1-305, 2008.