Using Linear Algebra for Intelligent Information Retrieval
From MaRDI portal
Publication:4870598
DOI10.1137/1037127zbMath0842.68026OpenAlexW2072773380MaRDI QIDQ4870598
Michael W. Berry, Gavin W. O'Brien, Susan T. Dumais
Publication date: 26 March 1996
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0265769b0fbf86bb0e700573c80e388bb54c3f7a
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Information storage and retrieval of data (68P20)
Related Items
Estimation of singular values of very large matrices using random sampling ⋮ Out-of-core SVD performance for document indexing ⋮ The uncovering of hidden structures by latent semantic analysis ⋮ Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation ⋮ A method for K-means seeds generation applied to text mining ⋮ Transfer learning in heterogeneous collaborative filtering domains ⋮ Latent semantic analysis and Fiedler retrieval ⋮ Restarted block Lanczos bidiagonalization methods ⋮ Stochastic Bounds with a Low Rank Decomposition ⋮ Fast computation of stationary joint probability distribution of sparse Markov chains ⋮ Dependency-Based Construction of Semantic Space Models ⋮ Optimal map of the modular structure of complex networks ⋮ Regularized orthogonal linear discriminant analysis ⋮ A new method to improve the efficiency and accuracy of incremental singular value decomposition ⋮ Learning system parameters from Turing patterns ⋮ Complexity-reduced implementations of complete and null-space-based linear discriminant analysis ⋮ Sampling based succinct matrix approximation ⋮ Clustering DTDs: An interactive two-level approach. ⋮ Identifying the effects of SVD and demographic data use on generalized collaborative filtering ⋮ On principal component analysis, cosine and Euclidean measures in information retrieval ⋮ Neural memories and search engines ⋮ Generalized low rank approximations of matrices ⋮ Low-Rank Binary Matrix Approximation in Column-Sum Norm. ⋮ A new vector field method for eigen-decomposition of symmetric matrices ⋮ A new and fast implementation for null space based linear discriminant analysis ⋮ Two uses for updating the partial singular value decomposition in latent semantic indexing ⋮ SVD-based incremental approaches for recommender systems ⋮ Nearest neighbours in least-squares data imputation algorithms with different missing patterns ⋮ Computable eigenvalue bounds for rank-\(k\) perturbations ⋮ Generalized low rank approximations of matrices ⋮ Genetic algorithm for text clustering based on latent semantic indexing ⋮ Block classical Gram–Schmidt-based block updating in low-rank matrix approximation ⋮ A new dual wing harmonium model for document retrieval ⋮ Extended Lanczos bidiagonalization algorithm for low rank approximation and its applications ⋮ Dynamical low-rank approximation: Applications and numerical experiments ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ Text mining in computational advertising ⋮ Updating the partial singular value decomposition in latent semantic indexing ⋮ RELIABILITY OF OPTIMAL LINEAR PROJECTION OF GROWING SCALE-FREE NETWORKS ⋮ Approximating dominant singular triplets of large sparse matrices via modified moments ⋮ Quantum structure in cognition ⋮ Solving total least-squares problems in information retrieval ⋮ Subspace Iteration Randomization and Singular Value Problems ⋮ Latent semantic indexing: A probabilistic analysis ⋮ Matrix computations for information retrieval and major and outlier cluster detection
Uses Software
