Solving total least-squares problems in information retrieval (Q1587280)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving total least-squares problems in information retrieval |
scientific article; zbMATH DE number 1532997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving total least-squares problems in information retrieval |
scientific article; zbMATH DE number 1532997 |
Statements
Solving total least-squares problems in information retrieval (English)
0 references
17 May 2001
0 references
The Riemannian singular value decomposition (R-SVD) is modified and used to formulate an enhanced implementation of latent semantic indexing (LSI) for conceptual information retrieval. A new algorithm for computing the R-SVD is also described. In updating the LSI models, this R-SVD can be very effective. Experiments demonstrate that a 20\% improvement (in retrieval) over the current LSI model is possible.
0 references
information filtering
0 references
numerical experiments
0 references
Riemannian singular value decomposition
0 references
latent semantic indexing
0 references
information retrieval
0 references
algorithm
0 references
0.8612939715385437
0 references
0.8106956481933594
0 references
0.8106956481933594
0 references
