Pith. sign in

REVIEW 1 cited by

Probabilistic Latent Semantic Analysis

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1301.6705 v1 pith:KJAUTCBL submitted 2013-01-23 cs.LG cs.IRstat.ML

classification cs.LGcs.IRstat.ML
keywords analysislatentsemanticapproachco-occurrencedecompositionmodelprobabilistic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SCPP: A Unified Python Library for Soft Clustering

    cs.LG 2026-07 conditional novelty 6.0 of 10

    SCPP provides a unified Python API, benchmarking suite, and 241 tests covering 40 soft clustering algorithms.

Pith tools