Aswani Kumar, Cherukuri; Srinivas, Suripeddi Latent semantic indexing using eigenvalue analysis for efficient information retrieval. (English) Zbl 1122.68047 Int. J. Appl. Math. Comput. Sci. 16, No. 4, 551-558 (2006). Summary: Text retrieval using Latent Semantic Indexing (LSI) with truncated Singular Value Decomposition (SVD) has been intensively studied in recent years. However, the expensive complexity involved in computing truncated SVD constitutes a major drawback of the LSI method. In this paper, we demonstrate how matrix rank approximation can influence the effectiveness of information retrieval systems. Besides, we present an implementation of the LSI method based on an eigenvalue analysis for rank approximation without computing truncated SVD, along with its computational details. Significant improvements in computational time while maintaining retrieval accuracy are observed over the tested document collections. Cited in 1 Document MSC: 68P20 Information storage and retrieval of data 68T35 Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence 68T05 Learning and adaptive systems in artificial intelligence 15A18 Eigenvalues, singular values, and eigenvectors Keywords:singular value decomposition; vector space method Software:Algorithm 844; svdpack PDFBibTeX XMLCite \textit{C. Aswani Kumar} and \textit{S. Srinivas}, Int. J. Appl. Math. Comput. Sci. 16, No. 4, 551--558 (2006; Zbl 1122.68047) Full Text: EuDML