Numerical recipes in C: the art of scientific computing
Numerical recipes in C: the art of scientific computing
Automatic text processing: the transformation, analysis, and retrieval of information by computer
Automatic text processing: the transformation, analysis, and retrieval of information by computer
On Updating Problems in Latent Semantic Indexing
SIAM Journal on Scientific Computing
Matrices with Low-Rank-Plus-Shift Structure: Partial SVD and Latent Semantic Indexing
SIAM Journal on Matrix Analysis and Applications
Large-Scale SVD and Subspace-Based Methods for Information Retrieval
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
Distributed, large-scale latent semantic analysis by index interpolation
Proceedings of the 3rd international conference on Scalable information systems
Sequential Karhunen-Loeve basis extraction and its application to images
IEEE Transactions on Image Processing
Hi-index | 0.00 |
Modern applications of Latent Semantic Analysis (LSA) must deal with enormous (often practically infinite) data collections, calling for a single-pass matrix decomposition algorithm that operates in constant memory w.r.t. the collection size. This paper introduces a streamed distributed algorithm for incremental SVD updates. Apart from the theoretical derivation, we present experiments measuring numerical accuracy and runtime performance of the algorithm over several data collections, one of which is the whole of the English Wikipedia.