Solving total least-squares problems in information retrieval

DOI10.1016/S0024-3795(00)00030-6zbMATH Open0960.65043MaRDI QIDQ1587280FDOQ1587280

Authors: Eric P. Jiang, Michael W. Berry 

Publication date: 17 May 2001

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1748566
• Lanczos and the Riemannian SVD in information retrieval applications
• scientific article; zbMATH DE number 2069285
• On Updating Problems in Latent Semantic Indexing
• Two uses for updating the partial singular value decomposition in latent semantic indexing

zbMATH Keywords

algorithmnumerical experimentsinformation retrievalinformation filteringlatent semantic indexingRiemannian singular value decomposition

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Total Least Norm Formulation and Solution for Structured Problems
• Using Linear Algebra for Intelligent Information Retrieval
• SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
• The Restricted Singular Value Decomposition of Matrix Triplets
• Structured total least squares and \(L_ 2\) approximation problems

Cited In (6)

• An ensemble Kalman filter implementation based on modified Cholesky decomposition for inverse covariance matrix estimation
• Lanczos and the Riemannian SVD in information retrieval applications
• Lightweight relevance filtering for machine-generated resolution problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• svdpack
• VanHuffel
• Okapi

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)