On updating problems in latent semantic indexing

Citations Over Time

Abstract

The authors develop new SVD-updating algorithms for three types of updating problems arising from Latent Semantic Indexing (LSI) for information retrieval to deal with rapidly changing text document collections. They also provide theoretical justification for using a reduced-dimension representation of the original document collection in the updating process. Numerical experiments using several standard text document collections show that the new algorithms give higher (interpolated) average precisions than the existing algorithms and the retrieval accuracy is comparable to that obtained using the complete document collection.

Related Papers

• → Automatic essay grading with probabilistic latent semantic analysis(2005)57 cited
• Comparison of Latent Semantic Analysis and Probabilistic Latent Semantic Analysis for Documents Clustering(2015)
• → Feasible settings for the adaptive latent semantic analysis: Hk-LSA model(2017)2 cited
• → Comparing the Performance of Latent Semantic Analysis and Probability Latent Semantic Analysis Models on Autoscoring Essay Tasks(2017)1 cited
• → Latent Semantic Analysis(2023)