Fast computation of low-rank matrix approximations

Journal of the ACM

Volumn 54, Issue 2, 2007, Pages

  Achlioptas, Dimitris ^a   McSherry, Frank ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Low rank approximation; Sampling; Singular value decomposition

Indexed keywords

LOW RANK APPROXIMATION; NONZERO ENTRIES; SPECTRAL FEATURES;

APPROXIMATION THEORY; MATRIX ALGEBRA; PROBABILITY; RANDOM VARIABLES; SAMPLING; SINGULAR VALUE DECOMPOSITION;

COMPUTATION THEORY;

EID: 34247228045     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1219092.1219097     Document Type: Article

References (14)

1. ALON, N., KRIVELEVICH, M., AND VU, V. H. 2002. Concentration of eigenvalues of random matrices. Israel Math. J. 131, 259-267.
2. AZAR, Y., FIAT, A., KARLIN, A., MCSHERRY, F., AND SAIA, J. 2001. Data mining through spectral analysis. In Proceedings of the 33rd Annual Symposium on Theory of Computing (Heraklion, Crete, Greece). ACM, New York, 619-626.
3. BELLHUMER, P. N., HESPANHA, J., AND KRIEGMAN, D. 1997. Eigenfaces vs. fisherfaces: Recognition using class specific linear projection. IEEE Trans. Pattern Anal. Mach. Intell. (Special Issue on Face Recognition) 17, 7, 711-720.
4. BERRY, M., DRMAČ, Z., AND JESSUP, E. 1999. Matrices, vector spaces, and information retrieval. SIAM Rev. 41, 2, 335-362.
5. BERRY, M., DUMAIS, S., AND O'BRIEN, O. 1995. Using linear algebra for intelligent information retrieval. SIAM Rev. 41, 4, 573-595.
6. DEERWESTER, S., DUMAIS, S., LANDAUER, T., FURNAS, G., AND HARSHMAN, R. 1990. Indexing by latent semantic analysis. J. Soc. Inf. Sci. 41, 6, 391-407.
7. DRINEAS, P., FRIEZE, A., KANNAN, R., VEMPALA, S., AND VINAY, V. 2004. Clustering large graphs via the singular value decomposition. Mach. Learn. 56, 1-3, 9-33.
8. DRINEAS, P., AND KANNAN, R. 2003. Pass efficient algorithms for approximating large matrices. In Proceedings of the 14th Annual Symposium on Discrete Algorithms (Baltimore, MD). ACM, New York, 223-232.
9. FRIEZE, A., KANNAN, R., AND VEMPALA, S. 2004. Fast Monte-Carlo algorithms for finding low-rank approximations. J. ACM 51, 6, 1025-1041.
10. FÜREDI, Z., AND KOMLÓS, J. 1981. The eigenvalues of random symmetric matrices. Combinatorica 1, 3, 233-241.
11. GEORGHIADES, A., BELHUMEUR, P., AND KRIEGMAN, D. 2001. From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intell. 23, 6, 643-660.
12. GOLUB, G., AND VAN LOAN, C. 1996. Matrix computations, 3rd ed. Johns Hopkins University Press, Baltimore, MD.
13. PAPADIMITRIOU, C., RAGHAVAN, P., TAMAKI, H., AND VEMPALA, S. 2000. Latent semantic indexing: A probabilistic analysis. J. Comput. Syst. Sci. 61, 2, 217-235.
14. VU, V. H. 2005. Spectral norm of random matrices. In Proceedings of the 37th Annual Symposium on Theory of Computing (Baltimore, MD). ACM, New York, 423-430.