arXiv (Cornell University) · 2013 · 2.1K citations · 12 references
ComputingComputer ScienceInformation RetrievalMachine LearningNatural Language ProcessingLanguage ModelingLanguage ModelsLatent Variable ModelingLatent Variable ModelsCo-occurrence AnalysisCo-occurrence ModelingLatent Semantic AnalysisMixture Models For TextSingular Value Decomposition
Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of two-mode and co-occurrence data, which has applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. Compared to standard Latent Semantic Analysis which stems from linear algebra and performs a Singular Value Decomposition of co-occurrence tables, the proposed method is based on a mixture decomposition derived from a latent class model. This results in a more principled approach which has a solid foundation in statistics. In order to avoid overfitting, we propose a widely applicable generalization of maximum likelihood model fitting by tempered EM. Our approach yields substantial and consistent improvements over Latent Semantic Analysis in a number of experiments.
12
Indexing by latent semantic analysis
Scott Deerwester, Susan Dumais, George W. Furnas et al. · Journal of the American Society for Information Science · 1990 · 12.8K citations
Probabilistic Latent Semantic Indexing
Thomas Hofmann · ACM SIGIR Forum · 2017 · 4.1K citations
Unsupervised Learning by Probabilistic Latent Semantic Analysis
Thomas Hofmann · Machine Learning · 2001 · 2.5K citations · Full text