Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition

SIAM Journal on Computing

Volumn 36, Issue 1, 2006, Pages 184-206

  Drineas, Petros ^a   Kannan, Ravi ^b   Mahoney, Michael W ^c  

^a Rensselaer Polytechnic Institute   (United States)

^b Yale University   (United States)

^c YALE UNIVERSITY   (United States)

Author keywords

CUR matrix decomposition; Massive data sets; Monte Carlo methods; Randomized algorithms

Indexed keywords

CUR MATRIX DECOMPOSITION; MASSIVE DATA SETS; RANDOMIZED ALGORITHMS;

ALGORITHMS; DATABASE SYSTEMS; ERROR ANALYSIS; MATRIX ALGEBRA; POLYNOMIALS; RANDOM ACCESS STORAGE;

MONTE CARLO METHODS;

EID: 33751097630     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704442702     Document Type: Article

References (29)

1. D. ACHLIOPTAS AND F. MCSHERRY, Fast computation of low rank matrix approximations, J. ACM, to appear.
2. D. ACHLIOPTAS AND F. MCSHERRY, Fast computation of low rank matrix approximations, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 611-618.
3. Z. BAR-YOSSEF, The Complexity of Massive Data Set Computations, Ph.D. thesis, University of California, Berkeley, 2002.
4. Z. BAR-YOSSEF, Sampling lower bounds via information theory, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 335-344.
5. M. W. BERRY, S. A. PULATOVA, AND G. W. STEWART, Computing Sparse Reduced-Rank Approximations to Sparse Matrices, Tech. Report UMIACS TR-2004-32 CMSC TR-4589, University of Maryland, College Park, MD, 2004.
6. R. BHATIA, Matrix Analysis, Springer-Verlag, New York, 1997.
7. E. COHEN AND D. D. LEWIS, Approximating matrix multiplication for pattern recognition tasks, J. Algorithms, 30 (1999), pp. 211-252.
8. P. DRINEAS, A. FRIEZE, R. KANNAN, S. VEMPALA, AND V. VINAY, Clustering in large graphs and matrices, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1999, pp. 291-299.
9. P. DRINEAS AND R. KANNAN, Pass efficient algorithms for approximating large matrices, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2003, pp. 223-232.
10. P. DRINEAS, R. KANNAN, AND M. W. MAHONEY, Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication, SIAM J. Comput., 36 (2006), pp. 132-157.
11. P. DRINEAS, R. KANNAN, AND M. W. MAHONEY, Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix, SIAM J. Comput., 36 (2006), pp. 158-183.
12. P. DRINEAS, R. KANNAN, AND M. W. MAHONEY, Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition, Tech. Report YALEU/DCS/TR-1271, Department of Computer Science, Yale University, New Haven, CT, 2004.
13. P. DRINEAS, R. KANNAN, AND M. W. MAHONEY, Sampling Sub-problems of Heterogeneous Max-Cut Problems and Approximation Algorithms, Tech. Report YALEU/DCS/TR-1283, Department of Computer Science, Yale University, New Haven, CT, 2004.
14. P. DRINEAS, I. KERENIDIS, AND P. RAGHAVAN, Competitive recommendation systems, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 82-90.
15. P. DRINEAS AND M. W. MAHONEY, Approximating a Gram matrix for improved kernel-based learning, in Proceedings of the 18th Annual Conference on Learning Theory, 2005, pp. 323-337.
16. P. DRINEAS AND M. W. MAHONEY, On the Nyström method for approximating a Gram matrix for improved kernel-based learning, 1. Machine Learning, 6 (2005), pp. 2153-2175.
17. P. DRINEAS AND M. W. MAHONEY, A Randomized Algorithm for a Tensor-Based Generalization of the Singular Value Decomposition, Tech. Report YALEU/DCS/TR-1327, Department of Computer Science, Yale University, New Haven, CT, 2005.
18. A. FRIEZE, R. KANNAN, AND S. VEMPALA, Fast Monte-Carlo algorithms for finding low-rank approximations, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 370-378.
19. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, Johns Hopkins University Press, Baltimore, MD, 1989.
20. S. A. GOREINOV AND E. E. TYRTYSHNIKOV, The maximum-volume concept in approximation by low-rank matrices, Contemp. Math., 280 (2001), pp. 47-51.
21. S. A. GOREINOV, E. E. TYRTYSHNIKOV, AND N. L. ZAMARASHKIN, A theory of pseudoskeleton approximations, Linear Algebra Appl., 261 (1997), pp. 1-21.
22. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, New York, 1985.
23. P. INDYK, Stable distributions, pseudorandom generators, embeddings and data stream computation, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 189-197.
24. J. KLEINBERG, Two algorithms for nearest-neighbor search in high dimensions, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 599-608.
25. K. V. MARDIA, J. T. KENT, AND J. M. BIBBY, Multivariate Analysis, Academic Press, London, 1979.
26. G. W. STEWART, Four algorithms for the efficient computation of truncated QR approximations to a sparse matrix, Numer. Math., 83 (1999), pp. 313-323.
27. G. W. STEWART, Error Analysis of the Quasi-Gram-Schmidt Algorithm, Tech. Report UMIACS TR-2004-17 CMSC TR-4572, University of Maryland, College Park, MD, 2004.
28. G. W. STEWART AND J. G. SUN, Matrix Perturbation Theory, Academic Press, New York, 1990.
29. S. VEMPALA, Random projection: A new approach to VLSI layout, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 389-395.