Solving total least-squares problems in information retrieval

From MaRDI portal





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.





Describes a project that uses

Uses Software






This page was built for publication: Solving total least-squares problems in information retrieval

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587280)