Deterministic sparse column based matrix reconstruction via greedy approximation of SVD

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5369 LNCS, Issue , 2008, Pages 414-423

  Çivril, Ali ^a   Magdon Ismail, Malik ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION PROBLEMS; APPROXIMATION RATIOS; EXISTENCE RESULTS; FROBENIUS NORMS; PERFORMANCE GUARANTEES; RUNNING TIME; SINGULAR VECTORS;

ALGORITHMS; INFORMATION THEORY; PROGRAMMING THEORY; RESTORATION; SINGULAR VALUE DECOMPOSITION;

APPROXIMATION ALGORITHMS;

EID: 58549092634     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92182-0_38     Document Type: Conference Paper

References (23)

1. Chan, T.F.: Rank revealing QR factorizations. Linear Algebra Appl. (88/89), 67-82 (1987)
2. Chandrasekaran, S., Ipsen, I.C.F.: On rank-revealing factorizations. SIAM J. Matrix Anal. Appl. 15, 592-622 (1994)
3. Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Review 43(1), 129-159 (2001)
4. de Hoog, F.R., Mattheijb, R.M.M.: Subset selection for matrices. Linear Algebra and its Applications (422), 349-359 (2007)
5. Deshpande, A., Rademacher, L., Vempala, S., Wang, G.: Matrix approximation and projective clustering via volume sampling. In: SODA 2006, pp. 1117-1126. ACM Press, New York (2006)
6. Deshpande, A., Varadarajan, K.: Sampling-based dimension reduction for subspace approximation. In: STOC 2007: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp. 641-650. ACM, New York (2007)
7. Deshpande, A., Vempala, S.: Adaptive sampling and fast low-rank matrix approximation. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 292-303. Springer, Heidelberg (2006)
8. Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering in large graphs and matrices. In: SODA 1999: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, pp. 291-299. SIAM, Philadelphia (1999)
9. Drineas, P., Kannan, R., Mahoney, M.W.: Fast monte carlo algorithms for matrices II: Computing a low-rank approximation to a matrix. SIAM Journal on Computing 36(1), 158-183 (2006)
10. Drineas, P., Mahoney, M.W., Muthukrishnan, S.: Subspace sampling and relativeerror matrix approximation: column-row-based methods. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 304-314. Springer, Heidelberg (2006)
11. Friedman, J.H., Stuetzle, W.: Projection pursuit regressions. J. Amer. Statist. Soc. 76, 817-823 (1981)
12. Frieze, A., Kannan, R., Vempala, S.: Fast monte-carlo algorithms for finding lowrank approximations. Journal of the Association for Computing Machinery 51(6), 1025-1041 (2004)
13. Golub, G.H., Loan, C.V.: Matrix Computations. Johns Hopkins U. Press (1996)
14. Gu, M., Eisenstat, S.C.: Efficient algorithms for computing a strong rank-revealing QR factorization. SIAM Journal on Scientific Computing 17(4), 848-869 (1996)
15. Hong, Y.P., Pan, C.T.: Rank-revealing QR factorizations and the singular value decomposition. Mathematics of Computation 58, 213-232 (1992)
16. Kuruvilla, F.G., Park, P.J., Schreiber, S.L.: Vector algebra in the analysis of genome-wide expression data. Genome Biology (3) (2002)
17. Mallat, S., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Transactions on Signal Processing 41(12), 3397-3415 (1993)
18. Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM Journal on Computing 24(2), 227-234 (1995)
19. Pan, C.T., Tang, P.T.P.: Bounds on singular values revealed by QR factorizations. BIT Numerical Mathematics 39, 740-756 (1999)
20. Rudelson, M., Vershynin, R.: Sampling from large matrices: An approach through geometric functional analysis. J. ACM 54(4) (2007)
21. Sarlos, T.: Improved approximation algorithms for large matrices via random projections. In: FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 143-152. IEEE Computer Society Press, Los Alamitos (2006)
22. Shyamalkumar, N.D., Varadarajan, K.: Efficient subspace approximation algorithms. In: SODA 2007: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 532-540. Society for Industrial and Applied Mathematics, Philadelphia (2007)
23. Tropp, J.A.: Greed is good: algorithmic results for sparse approximation. IEEE Transactions on Information Theory 50(10), 2231-2242 (2004)