Equivalence between nonnegative tensor factorization and tensorial probabilistic latent semantic analysis

Authors:
Wei Peng
Affiliations:
Xerox, Webster, NY, USA
Venue:
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Year:
2009

Citing 5
Cited 1

Unsupervised learning by probabilistic latent semantic analysis

Machine Learning
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
On the equivalence between Non-negative Matrix Factorization and Probabilistic Latent Semantic Indexing

Computational Statistics & Data Analysis
Author-topic evolution analysis using three-way non-negative Paratucker

Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Probabilistic polyadic factorization and its application to personalized recommendation

Proceedings of the 17th ACM conference on Information and knowledge management

On the equivalence between nonnegative tensor factorization and tensorial probabilistic latent semantic analysis

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper establishes a connection between NMF and PLSA on multi-way data, called NTF and T-PLSA respectively. Two types of T-PLSA models are proven to be equivalent to non-negative PARAFAC and non-negative Tucker3. This paper also shows that by running NTF and T-PLSA alternatively, they can jump out of each other's local minima and achieve a better clustering solution.