# Probabilistic Latent Semantic Indexing

“Probabilistic Latent Semantic Indexing” (2017), by Thomas Frank Hofmann. Computer Science research paper. Original abstract below, unchanged. No free PDF was found.

- Authors: Thomas Frank Hofmann
- Published: August 2, 2017
- Field: Computer Science
- DOI: https://doi.org/10.1145/3130348.3130370
- Source: https://doi.org/10.1145/3130348.3130370

## Abstract

Probabilistic Latent Semantic Indexing is a novel approach to automated document indexing which is based on a statistical latent class model for factor analysis of count data. Fitted from a training corpus of text documents by a generalization of the Expectation Maximization algorithm, the utilized model is able to deal with domain{specific synonymy as well as with polysemous words. In contrast to standard Latent Semantic Indexing (LSI) by Singular Value Decomposition, the probabilistic variant has a solid statistical foundation and defines a proper generative data model. Retrieval experiments on a number of test collections indicate substantial performance gains over direct term matching methods as well as over LSI. In particular, the combination of models with different dimensionalities has proven to be advantageous.

Canonical page: https://nerdi.pages.dev/paper/W2107743791
Read three real papers a day in Nerdi (iPhone): https://apps.apple.com/app/apple-store/id6813826387?pt=128757794&ct=web-paper&mt=8