Matrices with low-rank-plus-shift structure: Partial SVD and latent semantic indexing

SIAM Journal on Matrix Analysis and Applications

Volumn 21, Issue 2, 1999, Pages 522-536

  Zha, Hongyuan ^a   Zhang, Zhenyue ^b  

^a The Center for Nanotechnology Education and Utilization   (United States)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

Large sparse matrix; Latent semantic indexing; Low rank approximation; Perturbation analysis; Singular value decomposition

Indexed keywords

EID: 0033633266     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0895479898344443     Document Type: Article

References (18)

1. M. BERRY, Large scale singular value computations, Internat. J. Supercomputer Appl., 6 (1992), pp. 13-49.
2. M. W. BERRY, S. T. DUMAIS, AND G. W. O'BRIEN, Using linear algebra for intelligent information retrieval, SIAM Rev., 37 (1995), pp. 573-595.
3. CORNELL SMART SYSTEM, available from ftp://ftp.cs.cornell.edu/pub/smart.
4. CMU DATA, available from http://www.cs.cmu.edu/afs/cs/project/theo-11/www/naive-bayes. html.
5. S. DEERWESTER, S. T. DUMAIS, T. K. LANDAUER, G. W. FURNAS, AND R. A. HARSHMAN, Indexing by latent semantic analysis, J. Soc. Inform. Sci., 41 (1990), pp. 391-407.
6. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, MD, 1989.
7. G. KOWALSKI, Information Retrieval System: Theory and Implementation, Kluwer Academic Publishers, Boston, 1997.
8. R. KROVETZ AND W. B. CROFT, Lexical ambiguity and information retrieval, ACM Trans. Inform. Systems, 10 (1992), pp. 115-141.
9. B. N. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
10. G. SALTON, Automatic Text Processing, Addison-Wesley, New York, 1989.
11. H. SIMON AND H. ZHA, Low Rank Matrix Approximation Using the Lanczos Bidiagonalization Process, CSE Technical Report CSE-97-008, 1997; also LBNL Technical Report LBNL-40767-UC-405.
12. H. SIMON AND H. ZHA, Low Rank Matrix Approximation Using the Lanczos Bidiagonalization Process, CSE Technical Report CSE-97-008, 1997; also LBNL Technical Report LBNL-40767-UC-405.
13. G. XU AND T. KAILATH, Fast subspace decompsotion, IEEE Trans. Signal Processing, 42 (1994), pp. 539-551.
14. G. XU, H. ZHA, G. GOLUB, AND T. KAILATH, Fast algorithms for updating signal subspaces, IEEE Trans. Circuits and Systems, 41 (1994), pp. 537-549.
15. H. ZHA AND H. D. SIMON, On updating problems in latent semantic indexing, SIAM J. Sci. Comput., 21 (1999), pp. 782-791.
16. H. ZHA AND H. SIMON, A subspace-based model for latent semantic indexing in information retrieval, in Proceedings of the 30th Symposium on the Interface of Computer Science and Statistics, Berkeley, CA, Springer-Verlag, New York, 1998, pp. 315-320.
17. H. ZHA, O. MARQUES, AND H. SIMON, Large-scale SVD and subspace-based methods for information retrieval, in Proceedings of Irregular '98, Lecture Notes in Comput. Sci. 1457, 1998, pp. 29-42.
18. H. ZHA AND Z. ZHANG, A sorted partial Jacobi method and its convergence analysis, Linear Algebra Appl., 270 (1997), pp. 79-108.