Download:
|
by Tamara G. Kolda, Dianne P. O'leary
ACM Transactions on Information Systems
http://csmr.ca.sandia.gov/~tgkolda/papers/umcp-cs-tr-3724.ps
Add To MetaCart
Abstract:
The vast amount of textual information available today is useless unless it can be effectively and efficiently searched. In information retrieval, we wish to match queries with relevant documents. Documents can be represented by the terms that appear within them, but literal matching of terms does not necessarily retrieve all relevant documents. Latent Semantic Indexing represents documents by approximations and tends to cluster documents on similar topics even if their term profiles are somewhat different. This approximate representation is usually accomplished using a low-rank singular value decomposition (SVD) approximation. In this paper, we use an alternate decomposition, the semi-discrete decomposition (SDD). In our tests, for equal query times, the SDD does as well as the SVD and uses less than one-tenth the storage. Additionally, we show how to update the SDD for a dynamically changing document collection. 1
Citations
|
1460
|
Indexing by latent semantic analysis
– Deerwester, Dumais, et al.
- 1990
|
|
881
|
Term-weighting approaches in automatic text retrieval
– Salton, Buckley
- 1998
|
|
754
|
The Algebraic Eigenvalue Problem
– Wilkinson
- 1965
|
|
563
|
Managing Gigabytes: Compressing and Indexing Documents and Images
– Witten, Moffat, et al.
- 1999
|
|
377
|
Using linear algebra for intelligent information retrieval
– Berry, Dumais, et al.
- 1995
|
|
364
|
Information Retrieval: Data Structures and Algorithms
– Frakes, Baeza-Yates
- 1992
|
|
172
|
Overview of the third text REtrieval conference (TREC-3), in Overview of the Third Text REtrieval Conference
– Harman
- 1995
|
|
170
|
Improving the Retrieval of Information from External Sources
– Dumais
- 1991
|
|
88
|
Stemming algorithms
– Frakes
- 1992
|
|
61
|
Ranking Algorithms, in
– Harman
- 1992
|
|
46
|
SVDPACKC (version 1.0) User's Guide
– Berry, Do, et al.
- 1993
|
|
40
|
Document retrieval and routing using the INQUERY system
– Broglio, Callan, et al.
- 1995
|
|
37
|
Low-rank orthogonal decompositions for information retrieval applications
– Berry, Fierro
- 1996
|
|
37
|
Latent semantic indexing (lsi): Trec-3 report
– Dumais
- 1995
|
|
28
|
Digital image compression by outer product expansion
– O�Leary, Peleg
- 1983
|
|
22
|
Approximating matrix multiplication for pattern recognition tasks
– Cohen, Lewis
- 1997
|
|
22
|
Information management tools for updating an SVD-encoded indexing scheme
– O’Brien
- 1994
|
|
20
|
Limited-memory matrix methods with applications
– KOLDA
- 1997
|
|
16
|
Frakes and Ricardo Baeza�Yates. Information Retrieval� Data Structures and Algorithms
– William
- 1992
|
|
9
|
Indexing by latent semantic analysis
– dauer�, Harshman
- 1990
|
|
8
|
Latent semantic indexing via a semi�discrete matrix decomposition
– Kolda, O�Leary
- 1997
|
|
6
|
Bidiagonalization of matrices and solution of linear equations
– Paige
- 1974
|
|
3
|
Improving the retrieval of infomation from external sources
– Dumais
- 1991
|
|
2
|
Latent sematic indexing (LSI): TREC-3 report
– Dumais
- 1995
|
|
1
|
A Semidiscrete Matrix Decomposition • 345
– BERRY, DO, et al.
- 1993
|
|
1
|
The 3rd Text
– HARMAN, ED
- 1995
|
|
1
|
Descent property and global convergence of the Fletcher-Reeves method with inexact line search
– Frakes
- 1992
|
|
1
|
Theresa Do� Gavin O�Brien� Vijay Krishna� and Sowmini Varadhan. SVDPACKC �Version 1.0� Users� Guide
– Berry�
- 1993
|
