Parallel Svd Computation in Updating Problems of Latent Semantic Indexing *

Abstract

In latent semantic indexing, the addition of documents (or the addition of terms) to some already processed text collection leads to the updating of the best rank-k approximation of the term-document matrix. The computationally most intensive task in this updating is the computation of the singular value decomposition (SVD) of certain square matrix, which… (More)

Topics

3 Figures and Tables

Slides referencing similar topics