𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Latent Semantic Indexing: A Probabilistic Analysis

✍ Scribed by Christos H. Papadimitriou; Prabhakar Raghavan; Hisao Tamaki; Santosh Vempala


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
182 KB
Volume
61
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

✦ Synopsis


Latent semantic indexing (LSI) is an information retrieval technique based on the spectral analysis of the term-document matrix, whose empirical success had heretofore been without rigorous prediction and explanation. We prove that, under certain conditions, LSI does succeed in capturing the underlying semantics of the corpus and achieves improved retrieval performance. We propose the technique of random projection as a way of speeding up LSI. We complement our theorems with encouraging experimental results. We also argue that our results may be viewed in a more general framework, as a theoretical basis for the use of spectral methods in a wider class of applications such as collaborative filtering.


πŸ“œ SIMILAR VOLUMES


A probabilistic model for Latent Semanti
✍ Chris H.Q. Ding πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 183 KB πŸ‘ 1 views

## Abstract Latent Semantic Indexing (LSI), when applied to semantic space built on text collections, improves information retrieval, information filtering, and word sense disambiguation. A new dual probability model based on the similarity concepts is introduced to provide deeper understanding of

Using latent semantic indexing for liter
✍ Gordon, Michael D. ;Dumais, Susan πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 146 KB πŸ‘ 1 views

## Latent semantic indexing (LSI) is a statistical technique As described by Swanson, there are two basic literature for improving information retrieval effectiveness. Here, discovery processes. The first leads from the literature we use LSI to assist in literature-based discoveries. The (R) associ

Eigenvalue-based model selection during
✍ Miles Efron πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 252 KB πŸ‘ 1 views

## Abstract In this study amended parallel analysis (APA), a novel method for model selection in unsupervised learning problems such as information retrieval (IR), is described. At issue is the selection of __k__, the number of dimensions retained under latent semantic indexing (LSI). Amended paral

Determining the context of text using au
✍ Tom Rishel; Louise A. Perkins; Sumanth Yenduri; Farnaz Zand πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 232 KB πŸ‘ 1 views

## Abstract Latent semantic analysis has been used for several years to improve the performance of document library searches. We show that latent semantic analysis, augmented with a Part–of–Speech Tagger, may be an effective algorithm for classifying a textual document as well. Using Brille's Part–

Genetic algorithm for text clustering ba
✍ Wei Song; Soon Cheol Park πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 630 KB

## a b s t r a c t In this paper, we develop a genetic algorithm method based on a latent semantic model (GAL) for text clustering. The main difficulty in the application of genetic algorithms (GAs) for document clustering is thousands or even tens of thousands of dimensions in feature space which