Latent semantic indexing: A probabilistic analysis

DOI10.1006/jcss.2000.1711zbMath0963.68063OpenAlexW2073414385WikidataQ57904561 ScholiaQ57904561MaRDI QIDQ1591153

Santosh Vempala, Hisao Tamaki, Christos H. Papadimitriou, Prabhakar Raghavan

Publication date: 19 December 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.2000.1711

zbMATH Keywords

information retrieval latent semantic indexing

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items

Randomized numerical linear algebra: Foundations and algorithms, Structural similarity: spectral methods for relaxed blockmodeling, Randomized Local Model Order Reduction, Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations, The uncovering of hidden structures by latent semantic analysis, On the complexity of decoding Boolean cube splitting into cube faces, A spectral algorithm for learning mixture models, A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics, Lower bounds for the low-rank matrix approximation, A randomized algorithm for the decomposition of matrices, Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation, A preconditioned iterative interior point approach to the conic bundle subproblem, Database-friendly random projections: Johnson-Lindenstrauss with binary coins., Practical Sketching Algorithms for Low-Rank Matrix Approximation, A separable surrogate function method for sparse and low-rank matrices decomposition, Linear classifiers are nearly optimal when hidden variables have diverse effects, Embedded topics in the stochastic block model, Learning Topic Models: Identifiability and Finite-Sample Analysis, Literature survey on low rank approximation of matrices, Second order accurate distributed eigenvector computation for extremely large matrices, Some results of Christos Papadimitriou on internet structure, network routing, and web information, Recovering Structured Probability Matrices, A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION, Generalized low rank approximations of matrices, Adversarial classification using signaling games with an application to phishing detection, Finding similar users in social networks, Generalized low rank approximations of matrices, Block classical Gram–Schmidt-based block updating in low-rank matrix approximation, A randomized method for solving discrete ill-posed problems, An Almost Optimal Algorithm for Computing Nonnegative Rank, Recommendation systems: A probabilistic analysis, The stochastic topic block model for the clustering of vertices in networks with textual edges, Tell me who I am: An interactive recommendation system, PTEM: a popularity-based topical expertise model for community question answering, Stochastic boundary methods of fundamental solutions for solving PDEs, Less is More: Sparse Graph Mining with Compact Matrix Decomposition, Frequent Directions: Simple and Deterministic Matrix Sketching, Group-Level Analysis and Visualization of Social Networks, Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation, Randomized block Krylov methods for approximating extreme eigenvalues, An asymptotic thin shell condition and large deviations for random multidimensional projections, Optimization problems for weighted graphs and related correlation estimates, Unnamed Item, Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization, Unnamed Item, A spectral algorithm for latent Dirichlet allocation, Single-pass randomized QLP decomposition for low-rank approximation

Uses Software

svdpack

Cites Work