Probabilistic latent semantic analysis
From Wikipedia, the free encyclopedia
Probabilistic latent semantic analysis (PLSA), also known as probabilistic latent semantic indexing (PLSI, especially in information retrieval circles) is a statistical technique for the analysis of two-mode and co-occurrence data. PLSA evolved from Latent semantic analysis, adding a sounder probabilistic model. PLSA has applications in information retrieval and filtering, natural language processing, machine learning from text, and related areas. It was introduced in 1999 by Thomas Hofmann,[1] and it is related to non-negative matrix factorization.
Compared to standard latent semantic analysis which stems from linear algebra and downsizes the occurrence tables (usually via a singular value decomposition), probabilistic latent semantic analysis 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.
Considering observations in the form of co-occurrences (w,d) of words and documents, PLSA models the probability of each co-occurrence as a mixture of conditionally independent multinomial distributions:
| P(w,d) = | ∑ | P(c)P(d | c)P(w | c) = P(d) | ∑ | P(c | d)P(w | c) |
| c | c |
The first formulation is the symmetric formulation, where w and d are both generated from the latent class c in similar ways (using the conditional probabilities P(d | c) and P(w | c)), whereas the second formulation is the asymmetric formulation, where, for each document d, a latent class is chosen conditionally to the document according to P(c | d), and a word is then generated from that class according to P(w | c). Although we have used words and documents in this example, the co-occurrence of any couple of discrete variables may be modelled in exactly the same way.
It is reported that the aspect model used in the probabilistic latent semantic analysis has severe overfitting problems[2]. The number of parameters grows linearly with the number of documents. In addition, although PLSA is a generative model of the documents in the collection it is estimated on, it is not a generative model of new documents.
PLSA may be used in a discriminative setting, via Fisher kernels.[3]
[edit] Evolutions of PLSA
- Hierarchical extensions:
- Generative models: The following models have been developed to address an often-criticized shortcoming of PLSA, namely that it is not a proper generative model for new documents.
- Latent Dirichlet allocation - adds a Dirichlet prior on the per-document topic distribution
- Higher-order data: Although this is rarely discussed in the scientific literature, PLSA extends naturally to higher order data (three modes and higher), ie it can model co-occurrences over three or more variables. In the symmetric formulation above, this is done simply by adding conditional probability distributions for these additional variables. This is the probabilistic analogue to non-negative tensor factorisation.
[edit] References and notes
- ^ Thomas Hofmann, Probabilistic Latent Semantic Indexing, Proceedings of the Twenty-Second Annual International SIGIR Conference on Research and Development in Information Retrieval (SIGIR-99), 1999
- ^ Blei, David M.; Andrew Y. Ng, Michael I. Jordan (2003). "Latent Dirichlet Allocation". Journal of Machine Learning Research 3: 993–1022. doi:.
- ^ Thomas Hofmann, Learning the Similarity of Documents : an information-geometric approach to document retrieval and categorization, Advances in Neural Information Processing Systems 12, pp-914-920, MIT Press, 2000
- ^ Alexei Vinokourov and Mark Girolami, A Probabilistic Framework for the Hierarchic Organisation and Classification of Document Collections, in Information Processing and Management, 2002
- ^ Eric Gaussier, Cyril Goutte, Kris Popat and Francine Chen, A Hierarchical Model for Clustering and Categorising Documents, in "Advances in Information Retrieval -- Proceedings of the 24th BCS-IRSG European Colloquium on IR Research (ECIR-02)", 2002
