Skip to main content

Efficient Computation of the Riemannian SVD in Total Least Squares Problems in Information Retrieval

  • Chapter
Total Least Squares and Errors-in-Variables Modeling

Abstract

Recently, a nonlinear generalization of the singular value decomposition (SVD), called the Riemannian-SVD (R-SVD), for solving full rank total least squares problems was extended to low rank matrices within the context of latent semantic indexing (LSI) in information retrieval. This new approach, called RSVD-LSI, is based on the full SVD of an m × n term-by-document matrix A and requires the dense m × m left singular matrix U and the n × n right singular matrix V. Here, m corresponds to the size of the dictionary and n corresponds to the number of documents. We dicuss this method along with an efficient implementation of the method that takes into account the sparsity of A.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, 1999.

    Google Scholar 

  2. M.W. Berry and R.D. Fierro. Low-rank Orthogonal Decompositions for Information Retrieval Applications. Num. Lin. Alg. with Applies., 3: 301–327, 1996.

    Article  MATH  Google Scholar 

  3. M.W. Berry and M. Browne. Understanding Search Engines: Mathematical Modeling and Text Retrieval. SIAM, Philadelphia, 1999.

    MATH  Google Scholar 

  4. M.W. Berry, Z. Drmac, and E. Jessup. Matrices, Vector Spaces, and Information Retrieval. SIAM Review, 41: 335–362, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  5. M.W. Berry, S.T. Dumais, and G.W. O’Brien. Using Linear Algebra for Intelligent Information Retrieval. SIAM Review, 37: 573–595, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  6. Christian H. Bischof. Fundamental Linear Algebra Computations on High-Performance Computers. Preprint MCS-P150–0490, Mathematics and Computer Science Division, Argonne National Laboratory, August 1990.

    Google Scholar 

  7. C.H. Bischoff and C. Van Loan. The WY Representation for Products of Householder Matrices. SIAM J. Sci. Comp., 8: s2 - s13, 1987.

    Article  Google Scholar 

  8. B. De Moor. Structured Total Least Squares and L2 Approximation Problems. Lin. Alg. Appl., 188 /189: 163–205, 1993.

    Article  Google Scholar 

  9. S. T. Dumais Improving the Retrieval from External Sources. Behay. Res. Meth. Intrum. Comput. 23: 229–236, 1991.

    Article  Google Scholar 

  10. S. Deerwester, S. Dumais, G. Furnas, T. Landauer and R. Harshman. Indexing by Latent Semantic Analysis. J. Amer. Soc. Info. Sci., 41: 391–407, 1990.

    Article  Google Scholar 

  11. R. Fierro. Lanczos, Householder Transformations, and Implicit Deflation for Fast and Reliable Dominant Singular Subspace Computation. Num. Lin. Alg. with Applies., 8: 245–264, 2001.

    Article  MathSciNet  MATH  Google Scholar 

  12. R.D. Fierro. Perturbation Analysis for Two-Sided (or Complete) Orthogonal Decompositions. SIAM J. Matrix Anal. Appl., 17: 383–400, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  13. G. Golub and C. V. Loan. Matrix Computations. John Hopkins University Press, 1996.

    Google Scholar 

  14. D. Harman, E.M. Voorhees. in: Proceedings of the Fifth Text Retrieval Conference (TREC-5), Department of Commerce, National Institute of Standards and Technology. Gaithersburg, MD, NISC Special Publication 500–238, 1997.

    Google Scholar 

  15. E.R. Jessup and J.H. Martin. Taking a New Look at the Latent Semantic Analysis Approach to Information Retrieval. in Computational Information Retrieval, M. Berry (Ed.), SIAM, Philadelpha, 2001, pp. 129–152.

    Google Scholar 

  16. E.P. Jiang. Information Retrieval and Filtering Using the Riemannian SVD, Ph.D. Thesis, Department of Computer Science, The University of Tennessee, Knoxville, TN, 1998.

    Google Scholar 

  17. E.P. Jiang and M. W. Berry. Solving Total Least Squares Problems in Information Retrieval. Lin. Alg. Appl., 316: 137–156, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  18. H. Park, M. Jeon, and J.B. Rosen, Lower Dimensional Representation of Text Data in Vector Space Based Information Retrieval. in Computational Information Retrieval, M. Berry (Ed.), SIAM, Philadelpha, 2001, pp. 3–23.

    Google Scholar 

  19. G. Salton. The SMART Retrieval System. Prentice Hall, 1971.

    Google Scholar 

  20. G. Salton and M.J. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, New York, 1983.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Fierro, R.D., Berry, M.W. (2002). Efficient Computation of the Riemannian SVD in Total Least Squares Problems in Information Retrieval. In: Van Huffel, S., Lemmerling, P. (eds) Total Least Squares and Errors-in-Variables Modeling. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-3552-0_31

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-3552-0_31

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5957-4

  • Online ISBN: 978-94-017-3552-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics