Clustered SVD strategies in latent semantic indexing
نویسندگان
چکیده
منابع مشابه
Clustered SVD strategies in latent semantic indexing
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 collect...
متن کاملClustered SVD strategies in latent semantic indexing q
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 collect...
متن کاملParallel Svd Computation in Updating Problems of Latent Semantic Indexing ∗
In latent semantic indexing, the addition of documents (or the addition of terms) to some already processed text collection leads to the updating of the best rank-k approximation of the term-document matrix. The computationally most intensive task in this updating is the computation of the singular value decomposition (SVD) of certain square matrix, which is upper or lower triangular, and conta...
متن کاملSparsification Strategies in Latent Semantic Indexing
The text retrieval method using Latent Semantic Indexing (LSI) with the truncated Singular Value Decomposition (SVD) has been intensively studied in recent years. The term-document matrices after SVD are full matrices, although the rank is reduced substantially. To reduce memory consumption, we examine some strategies to sparsify the truncated SVD matrices. After applying the sparsification str...
متن کاملLatent Semantic Indexing
In the previous lecture, we discussed the Singular Value Decomposition (SVD) of the term-document matrix D ∈ <m× n where n is the number of documents in the corpus and m is the number of terms in the vocabulary. With the help of SVD (which is unique up to sign if the singular values are distinct), we can decompose an m×n term-document matrix into three special smaller matrices. The result is fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing & Management
سال: 2005
ISSN: 0306-4573
DOI: 10.1016/j.ipm.2004.10.005