Learning Topic Models -- Going beyond SVD
暂无分享,去创建一个
[1] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[2] R. Redner,et al. Mixture densities, maximum likelihood, and the EM algorithm , 1984 .
[3] Richard A. Harshman,et al. Indexing by Latent Semantic Analysis , 1990, J. Am. Soc. Inf. Sci..
[4] Joel E. Cohen,et al. Nonnegative ranks, decompositions, and factorizations of nonnegative matrices , 1993 .
[5] Ravi Kumar,et al. Recommendation systems: a probabilistic analysis , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[6] Santosh S. Vempala,et al. Latent semantic indexing: a probabilistic analysis , 1998, PODS '98.
[7] Michael I. Jordan. Graphical Models , 1998 .
[8] H. Sebastian Seung,et al. Learning the parts of objects by non-negative matrix factorization , 1999, Nature.
[9] Thomas Hofmann,et al. Probabilistic Latent Semantic Analysis , 1999, UAI.
[10] Santosh S. Vempala,et al. Latent Semantic Indexing , 2000, PODS 2000.
[11] H. Sebastian Seung,et al. Algorithms for Non-negative Matrix Factorization , 2000, NIPS.
[12] Frank McSherry,et al. Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[13] Anna R. Karlin,et al. Spectral analysis of data , 2001, STOC '01.
[14] Ravi Kumar,et al. Recommendation Systems , 2001 .
[15] Jiri Matousek,et al. Lectures on discrete geometry , 2002, Graduate texts in mathematics.
[16] Xin Liu,et al. Document clustering based on non-negative matrix factorization , 2003, SIGIR.
[17] Jon M. Kleinberg,et al. Convergent algorithms for collaborative filtering , 2003, EC '03.
[18] Victoria Stodden,et al. When Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts? , 2003, NIPS.
[19] Michael I. Jordan,et al. Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..
[20] Michael I. Jordan,et al. An Introduction to Variational Methods for Graphical Models , 1999, Machine Learning.
[21] Jon M. Kleinberg,et al. Using mixture models for collaborative filtering , 2004, STOC '04.
[22] Patrik O. Hoyer,et al. Non-negative Matrix Factorization with Sparseness Constraints , 2004, J. Mach. Learn. Res..
[23] John D. Lafferty,et al. Dynamic topic models , 2006, ICML.
[24] Wei Li,et al. Pachinko allocation: DAG-structured mixture models of topic correlations , 2006, ICML.
[25] John D. Lafferty,et al. A correlated topic model of Science , 2007, 0708.3601.
[26] Michael I. Jordan,et al. Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..
[27] Stephen A. Vavasis,et al. On the Complexity of Nonnegative Matrix Factorization , 2007, SIAM J. Optim..
[28] David M. Blei,et al. Introduction to Probabilistic Topic Models , 2010 .
[29] David M. Blei,et al. Probabilistic topic models , 2012, Commun. ACM.
[30] Daniel M. Roy,et al. Complexity of Inference in Latent Dirichlet Allocation , 2011, NIPS.
[31] Robert H. Halstead,et al. Matrix Computations , 2011, Encyclopedia of Parallel Computing.
[32] Seungjin Choi,et al. Independent Component Analysis , 2009, Handbook of Natural Computing.
[33] Sanjeev Arora,et al. Computing a nonnegative matrix factorization -- provably , 2011, STOC '12.
[34] Nick Gravin,et al. The Inverse Moment Problem for Convex Polytopes , 2011, Discret. Comput. Geom..
[35] Anima Anandkumar,et al. Two SVDs Suffice: Spectral decompositions for probabilistic topic modeling and latent Dirichlet allocation , 2012, NIPS 2012.
[36] Anima Anandkumar,et al. A Method of Moments for Mixture Models and Hidden Markov Models , 2012, COLT.