ACM Computing Surveys (CSUR)
Matrices with Low-Rank-Plus-Shift Structure: Partial SVD and Latent Semantic Indexing
SIAM Journal on Matrix Analysis and Applications
Concept decompositions for large sparse text data using clustering
Machine Learning
Structure and Perturbation Analysis of Truncated SVDs for Column-Partitioned Matrices
SIAM Journal on Matrix Analysis and Applications
On the use of the singular value decomposition for text retrieval
Computational information retrieval
A semantic retrieval framework for engineering domain knowledge
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
DLPR: a distributed locality preserving dimension reduction algorithm
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
Hi-index | 0.00 |
The text retrieval method using latent semantic indexing (LSI) technique with truncated singular value decomposition (SVD) has been intensively studied in recent years. The SVD reduces the noise contained in the original representation of the term-document matrix and improves the information retrieval accuracy. Recent studies indicate that SVD is mostly useful for small homogeneous data collections. For large inhomogeneous datasets, the performance of the SVD based text retrieval technique may deteriorate. We propose to partition a large inhomogeneous dataset into several smaller ones with clustered structure, on which we apply the truncated SVD. Our experimental results show that the clustered SVD strategies may enhance the retrieval accuracy and reduce the computing and storage costs.