Improved approximation algorithms for large matrices via random projections

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 143-152

  Sarlós, Tamás ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; RANDOM PROCESSES; REGRESSION ANALYSIS; SINGULAR VALUE DECOMPOSITION;

LOW DIMENSIONAL EMBEDDINGS; MATRIX MULTIPLICATION; NON-ZERO ENTRIES;

APPROXIMATION ALGORITHMS;

EID: 35348901208     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.37     Document Type: Conference Paper

References (45)

1. D. Achlioptas. Database-friendly random projections: Johnson- Lindenstrauss with binary coins. Journal of Computer and System Sciences, 66(4):671-687, 2003.
2. D. Achlioptas, A. Fiat, A. R. Karlin, and F. McSherry. Web search via hub synthesis. In Proc. of the 42nd FOCS, pages 500-509, 2001.
3. D. Achlioptas and F. McSherry. Fast computation of low-rank approximations. To appear in the Journal of the ACM, 2003.
4. D. Achlioptas and F. McSherry. On spectral learning of mixtures of distributions. In Proc. of the 18th COLT, pages 458-469, 2005.
5. N. Ailon and B. Chazelle. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. In Proc. of the 38th STOC, 2006.
6. N. Alon, P. B. Gibbons, Y. Matias, and M. Szegedy. Tracking join and self-join sizes in limited storage. Journal of Computer and System Sciences, 64(3):719-747, 2002.
7. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1): 137-147, 1999.
8. R. I. Arriaga and S. Vempala. An algorithmic theory of learning: Robust concepts and random projection. In Proc. of the 40th FOCS, pages 616-623, 1999.
9. Y. Azar, A. Fiat, A. R. Karlin, F. McSherry, and J. Saia. Spectral analysis of data. In Proc. of the 33rd STOC, pages 619-626, 2001.
10. Z. Bar-Yossef. Sampling lower bounds via information theory. In Proc. of the 35th STOC, pages 335-344, 2003.
11. M. W. Berry, S. T. Dumais, and G. W. O'Brien. Using linear algebra for intelligent information retrieval. SIAM Review, 37(4):573-595, 1995.
12. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Proc. of the 29th ICALP, pages 693-703, 2002.
13. E. Cohen and D. D. Lewis. Approximating matrix multiplication for pattern recognition tasks. Journal of Algorithms, 30(2):211-252, 1999.
14. H. Cohn, R. Kleinberg, B. Szegedy, and C. Umans. Group-theoretic algorithms for matrix multiplication. In Proc. of the 46th FOCS, pages 379-388, 2005.
15. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251-280, 1990.
16. A. Dasgupta, R. Kumar, P. Raghavan, and A. Tomkins. Variable latent semantic indexing. In Proc. of the 11th KDD, pages 839-842, 2005.
17. S. Dasgupta and A. Gupta. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Structures and Algorithms, 22(1):60-65, 2003.
18. A. Deshpande, L. Rademacher, S. Vempala, and G. Wang. Matrix approximation and projective clustering via volume sampling. In Proc. of the 17th SODA, 2006.
19. A. Deshpande and S. Vempala. Adaptive sampling and fast low-rank matrix approximation. In Proc. of the 10th RANDOM, 2006.
20. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V Vinay. Clustering large graphs via the singular value decomposition. Machine Learning, pages 9-33, 2004.
21. P. Drineas, R. Kannan, and M. W. Mahoney. Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication. SIAM Journal on Computing, 36:132-157, 2006.
22. P. Drineas, R. Kannan, and M. W. Mahoney. Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition. SIAM Journal on Computing, 36:184-206, 2006.
23. P. Drineas, I. Kerenidis, and P. Raghavan. Competitive recommendation systems. In Proc. of the 34th STOC, pages 82-90, 2002.
24. P. Drineas and M. W. Mahoney. Approximating a Gram matrix for improved kernel-based learning. In Proc. of the 18th COLT, pages 323-337, 2005.
25. P. Drineas and M. W. Mahoney. A randomized algorithm for a tensor-based generalization of the SVD, 2005. To appear in Linear Algebra and Its Applications.
26. P. Drineas, M. W. Mahoney, and R. Kannan. Fast Monte Carlo algorithms for matrices II: Computing a low rank approximation to a matrix. SIAM Journal on Computing, 36:158-183, 2006.
27. 2 regression and applications. In Proc. of the 17th SODA, pages 1127-1136, 2006.
28. P. Drineas, M. W. Mahoney, and S. Muthukrishnan. Subspace sampling and relative-error matrix approximation: Column-based methods. In Proc. of the 10th RANDOM, 2006.
29. P. Drineas, M. W. Mahoney, and S. Muthukrishnan. Subspace sampling and relative-error matrix approximation: Column-row-based methods. In Proc. of the 14th ESA, 2006.
30. P. Frankl and H. Maehara. The Johnson-Lindenstrauss Lemma and the sphericity of some graphs. J. Combin. Theory Ser. B, 44:355-362, 1988.
31. R. Freivalds. Probabilistic machines can use less running time. In Proc. of the IFIP Congress 1977, 1977.
32. A. Frieze, R. Kannan, and S. Vempala. Fast Monte-Carlo algorithms for finding low rank approximations. In Proc. of the 39th FOCS, pages 370-378, 1998.
33. G. H. Golub and C. F. V. Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, 1983.
34. S. Har-Peled. Low rank matrix approximation in linear time, 2006. Manuscript.
35. M. R. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. In External Memory Algorithms, DIMACS Book Series vol. 50., pages 107-118. American Mathematical Society, 1999.
36. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. of the 30th STOC, pages 604-613, 1998.
37. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into Hilbert space. Contemporary Mathematics, 26:189-206, 1984.
38. R. Kannan, H. Salmasian, and S. Vempala. The spectral method for general mixture models. In Proc. of the 18th COLT, pages 444-457, 2005.
39. J. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5): 604-632, 1999.
40. J. Kuczynski and H. Wozniakowski. Estimating the largest eigenvalue by the power and Lanczos algorithms with a random start. SIAM J. Matrix Anal. Appl., 13(4):1094-1122, 1992.
41. P.-G. Martinsson, V. Rokhlin, and M. Tygert. A randomized algorithm for the approximation of matrices. Technical Report 1361, Yale University, 2006.
42. F. McSherry. Spectral partitioning of random graphs. In Proc. of the 42nd FOCS, pages 529-537, 2001.
43. C. H. Papadimitriou, H. Tamaki, P. Raghavan, and S. Vempala. Latent semantic indexing: A probabilistic analysis. Journal of Computer and System Sciences, 61(2):217-235, 2000.
44. M. Rudelson and R. Vershynin. Sampling from large matrices: An approach through geometric functional analysis, 2005. Submitted.
45. T. Sarlós, A. A. Benczúr, K. Csalogány, D. Fogaras, and B. Rácz. To randomize or not to randomize: Space optimal summaries for hyperlink analysis. In Proceedings of the 15th World Wide Web Conference (WWW), 2006.