Relative errors for deterministic low-rank matrix approximations

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2014, Pages 707-717

  Ghashami, Mina ^a   Phillips, Jeff M ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

D MATRIXES; LINEAR COMBINATIONS; LOW-RANK MATRIX APPROXIMATIONS; MATRIX Q; PROCESSING TIME; RELATIVE ERRORS; UNIT VECTORS;

ALGORITHMS;

EID: 84902095954     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973402.53     Document Type: Conference Paper

References (31)

1. Dimitris Achlioptas and Frank McSherry. Fast computation of low rank matrix approximations. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. ACM, 2001.
2. Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, and Ke Yi. Mergeable summaries. In Proceedings 31st ACM Symposium on Principals of Database Systems, pages 23-34, 2012.
3. Radu Berinde, Graham Cormode, Piotr Indyk, and Martin J. Strauss. Space-optimal heavy hitters with strong error bounds. In Proceedings ACM Symposium on Principals of Database Systems, 2009.
4. Christos Boutsidis, Petros Drineas, and Malik Magdon- Ismail. Near optimal column-based matrix reconstruction. In Foundations of Computer Science, 2011 IEEE 52nd Annual Symposium on, pages 305-314. IEEE, 2011.
5. Matthew Brand. Incremental singular value decomposition of uncertain data with missing values. In Computer Vision- ECCV 2002, pages 707-720. Springer, 2002.
6. Kenneth L. Clarkson and David P. Woodruff. Numerical linear algebra in the streaming model. In Proceedings of the 41 st Annual ACM Symposium on Theory of Computing, pages 205-214. ACM, 2009.
7. Kenneth L. Clarkson and David P. Woodruff. Low rank approximation and regression in input sparsity time. In Proceedings of the 45th Annual ACM Symposium on Symposium on Theory of Computing, pages 81-90. ACM, 2013.
8. Graham Cormode. The continuous distributed monitoring model. SIGMOD Record, 42, 2013.
9. Erik D Demaine, Alejandro Lopez-Ortiz, and J. Ian Munro. Frequency estimation of internet packet streams with limited space. In Algorithms-ESA 2002, pages 348-360. Springer, 2002.
10. Amit Deshpande and Santosh Vempala. Adaptive sampling and fast low-rank matrix approximation. In Approximation, Randomization, and Combinatorial Optimization Algorithms and Techniques, pages 292-303. Springer, 2006.
11. Petros Drineas and Ravi Kannan. Pass efficient algorithms for approximating large matrices. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 2003.
12. Petros Drineas, Ravi Kannan, and Michael W. Mahoney. Fast monte carlo algorithms for matrices i: Approximating matrix multiplication. SIAM Journal on Computing, 36(1):132-157, 2006.
13. Petros Drineas, Ravi Kannan, and Michael W. Mahoney. Fast monte carlo algorithms for matrices ii: Computing a low- rank approximation to a matrix. SIAM Journal on Computing, 36(1):158-183, 2006.
14. Petros Drineas, Ravi Kannan, and Michael W. Mahoney. Fast monte carlo algorithms for matrices iii: Computing a compressed approximate matrix decomposition. SIAM Journal on Computing, 36(1): 184-206, 2006.
15. Petros Drineas, Michael W. Mahoney, and S. Muthukrishnan. Relative-error cur matrix decompositions. SIAM Journal on Matrix Analysis and Applications, 30(2):844-881, 2008.
16. Dan Feldman, Melanie Schmidt, and Christian Sohler. Turning big data into tiny data: Constant-size coresets for k- means, PCA and projective clustering. In Proceedings ACM- SIAM Symposium on Discrete Algorithms, 2013.
17. Alan Frieze, Ravi Kannan, and Santosh Vempala. Fast monte-carlo algorithms for finding low-rank approximations. Journal of the ACM (JACM), 51 (6): 1025-1041, 2004.
18. Lukasz Golab, David DeHaan, Erik D. Demaine, Alejandro Lopez-Ortiz, and J. Ian Munro. Identifying frequent items in sliding windows over on-line packet streams. In Proceedings of the 3rd ACM S1GCOMM Conference on Internet Measurement. ACM, 2003.
19. Gene H Golub and Charles F Van Loan. Matrix computations, volume 3. JHUP, 2012.
20. Peter Hall, David Marshall, and Ralph Martin. Incremental eigenanalysis for classification. In British Machine Vision Conference, volume 1. Citeseer, 1998.
21. Richard M. Karp, Scott Shenker, and Christos H. Papadimitriou. A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems, 28(l):51-55, 2003.
22. A Levey and Michael Lindenbaum. Sequential karhunen- loeve basis extraction and its application to images. Image Processing, IEEE Transactions on, 9(8): 1371 -1374, 2000.
23. Edo Liberty. Simple and deterministic matrix sketching. In Proceedings 19th ACM Conference on Knowledge Discovery and Data Mining, (arXiv: 1206.0594 in June 2012), 2013.
24. Michael W. Mahoney and Petros Drineas. Cur matrix decompositions for improved data analysis. Proceedings of the National Academy of Sciences, 106(3):697-702, 2009.
25. Ahmed Metwally, Divyakant Agrawal, and Amr El. Ab- badi. An integrated efficient solution for computing frequent and top-k elements in data streams. ACM Transactions on Database Systems, 31(3): 1095-1133, 2006.
26. J. Misra and D. Gries. Finding repeated elements. Sc. Comp. Prog., 2:143-152, 1982.
27. S. Muthukrishnan. Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science. Now publishers, 2005.
28. Jelani Nelson and Huy L. Nguyen. OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings. In Proceedings 54th IEEE Syposium on Foundations of Computer Science, 2013.
29. David A Ross, Jongwoo Lim, Ruei-Sung Lin, and Ming- Hsuan Yang. Incremental learning for robust visual tracking. International Journal of Computer Vision, 77(1-3): 125-141, 2008.
30. Mark Rudelson and Roman Vershynin. Sampling from large matrices: An approach through geometric functional analysis. Journal of the ACM, 54(4):21, 2007.
31. Tamas Sarlos. Improved approximation algorithms for large matrices via random projections. In Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium on. IEEE, 2006.