Non-negative Matrix Factorization (NMF, [5]) and Probabilistic Latent Semantic Analysis (PLSA, [4]) have been successfully applied to a number of text analysis tasks such as document clustering. Despite their different inspirations, both methods are instances of multinomial PCA [1]. We further explore this relationship and first show that PLSA solves the problem of NMF with KL divergence, and then explore the implications of this relationship.
No takes yet. Share an insight, caveat, or question.
Gaussier et al. (2005) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: