Fast updating algorithms for latent semantic indexing

DOI10.1137/130940414MaRDI QIDQ2936590zbMATH OpenOpenAlexFDO

Authors Eugene Vecharynski, Y. Saad

Publication date 17 December 2014

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.2008

zbMATH Keywords

latent semantic indexinglow-rank approximationMIN-MAX characterizationnumerical experimentRayleigh-Ritz procedureRitz singular valuesRitz singular vectorssingular value decompositionupdating algorithm

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Abstract: This paper discusses a few algorithms for updating the approximate Singular Value Decomposition (SVD) in the context of information retrieval by Latent Semantic Indexing (LSI) methods. A unifying framework is considered which is based on Rayleigh-Ritz projection methods. First, a Rayleigh-Ritz approach for the SVD is discussed and it is then used to interpret the Zha--Simon algorithms [SIAM J. Scient. Comput. vol. 21 (1999), pp. 782-791]. This viewpoint leads to a few alternatives whose goal is to reduce computational cost and storage requirement by projection techniques that utilize subspaces of much smaller dimension. Numerical experiments show that the proposed algorithms yield accuracies comparable to those obtained from standard ones at a much lower computational cost.

Recommendations

• On Updating Problems in Latent Semantic Indexing
• Downdating the Latent Semantic Indexing Model for Conceptual Information Retrieval
• Two uses for updating the partial singular value decomposition in latent semantic indexing
• Updating the partial singular value decomposition in latent semantic indexing
• Lanczos and the Riemannian SVD in information retrieval applications

Cited in

(9)

• Updating the partial singular value decomposition in latent semantic indexing
• Fast extraction of semantic features from a latent semantic indexed text corpus
• Two uses for updating the partial singular value decomposition in latent semantic indexing
• FLPI: an optimal algorithm for document indexing based on LPI
• Lanczos and the Riemannian SVD in information retrieval applications
• scientific article; zbMATH DE number 1746627 (Why is no real title available?)
• On Updating Problems in Latent Semantic Indexing
• Matrices with Low-Rank-Plus-Shift Structure: Partial SVD and Latent Semantic Indexing
• An incremental randomized algorithm for singular value decomposition of streaming data matrices

Describes a project that uses

Uses Software

• TMG
• svdpack

This page was built for publication: Fast updating algorithms for latent semantic indexing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936590)