Relation between PLSA and NMF and implications

Abstract

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.

DOI: 10.1145/1076034.1076148

Extracted Key Phrases

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=1076148.

Showing 1-10 of 163 extracted citations
02040'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

295 Citations

Semantic Scholar estimates that this publication has received between 224 and 389 citations based on the available data.

See our FAQ for additional information.