On Updating Problems in Latent Semantic Indexing

DOI10.1137/S1064827597329266zbMath0952.65034MaRDI QIDQ4702408

Horst D. Simon, Hongyuan Zha

Publication date: 24 November 1999

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmscomputational complexitysingular value decompositionnumerical experimentsinformation retrievallatent semantic indexingreduced-dimension representationupdating problems

Mathematics Subject Classification ID

Searching and sorting (68P10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (13)

Fast low-rank modifications of the thin singular value decomposition ⋮ Incremental learning of discriminant common vectors for feature extraction ⋮ Online Principal Component Analysis in High Dimension: Which Algorithm to Choose? ⋮ Incremental complete LDA for face recognition ⋮ A new method to improve the efficiency and accuracy of incremental singular value decomposition ⋮ EVD dualdating based online subspace learning ⋮ Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning ⋮ Two uses for updating the partial singular value decomposition in latent semantic indexing ⋮ SVD-based incremental approaches for recommender systems ⋮ Adaptive representation of dynamic 3D meshes for low-latency applications ⋮ Dynamical low-rank approximation: Applications and numerical experiments ⋮ Updating the partial singular value decomposition in latent semantic indexing ⋮ A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks

This page was built for publication: On Updating Problems in Latent Semantic Indexing