The Community for Technology Leaders
Green Image
Issue No. 08 - August (2009 vol. 21)
ISSN: 1041-4347
pp: 1091-1103
Jie Chen , University of Minnesota, Minneapolis
Yousef Saad , University of Minnesota, Minneapolis
This paper takes an in-depth look at a technique for computing filtered matrix-vector (mat-vec) products which are required in many data analysis applications. In these applications, the data matrix is multiplied by a vector and we wish to perform this product accurately in the space spanned by a few of the major singular vectors of the matrix. We examine the use of the Lanczos algorithm for this purpose. The goal of the method is identical with that of the truncated singular value decomposition (SVD), namely to preserve the quality of the resulting mat-vec product in the major singular directions of the matrix. The Lanczos-based approach achieves this goal by using a small number of Lanczos vectors, but it does not explicitly compute singular values/vectors of the matrix. The main advantage of the Lanczos-based technique is its low cost when compared with that of the truncated SVD. This advantage comes without sacrificing accuracy. The effectiveness of this approach is demonstrated on a few sample applications requiring dimension reduction, including information retrieval and face recognition. The proposed technique can be applied as a replacement to the truncated SVD technique whenever the problem can be formulated as a filtered mat-vec multiplication.
Dimension reduction, SVD, Lanczos algorithm, information retrieval, latent semantic indexing, face recognition, PCA, eigenfaces.

J. Chen and Y. Saad, "Lanczos Vectors versus Singular Vectors for Effective Dimension Reduction," in IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 1091-1103, 2008.
92 ms
(Ver 3.3 (11022016))