Subspace sampling and relative-error matrix approximation: Column-based methods

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

Volumn 4110 LNCS, Issue , 2006, Pages 316-326

  Drineas, Petros ^a   Mahoney, Michael W ^b   Muthukrishnan, S ^c  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b YAHOO RESEARCH   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; DATA REDUCTION; OPTIMIZATION; VECTORS;

SAMPLING PROBABILITIES; SINGULAR VECTORS; SUBSPACE SAMPLING;

MATRIX ALGEBRA;

EID: 33750079844     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11830924_30     Document Type: Conference Paper

References (21)

1. R. Bhatia. Matrix Analysis. Springer-Verlag, New York, 1997.
2. A. Deshpande, L. Rademacher, S. Vempala, and G. Wang. Matrix approximation and projective clustering via volume sampling. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1117-1126, 2006.
3. A. Deshpande and S. Vempala. Adaptive sampling and fast low-rank matrix approximation. Technical Report TR06-042, Electronic Colloquium on Computational Complexity, March 2006.
4. 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, pages 291-299, 1999.
5. P. Drineas, R. Kannan, and M.W. Mahoney. Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication. To appear in: SIAM Journal on Computing.
6. P. Drineas, R. Kannan, and M.W. Mahoney. Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix. To appear in: SIAM Journal on Computing.
7. P. Drineas, R. Kannan, and M.W. Mahoney. Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition. To appear in: SIAM Journal on Computing.
8. P. Drineas, M.W. Mahoney, and S. Muthukrishnan. Polynomial time algorithm for column-row based relative-error low-rank matrix approximation. Technical Report 2006-04, DIMACS, March 2006.
9. 2 regression and applications. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1127-1136, 2006.
10. 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, pages 370-378. 1998.
11. A. Frieze, R. Kannan, and S. Vempala. Fast Monte-Carlo algorithms for finding low-rank approximations. Journal of the ACM, 51(6):1025-1041, 2004.
12. G.H. Golub and C.F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, 1989.
13. S. Har-Peled. Low rank matrix approximation in linear time. Manuscript. January 2006.
14. R.A. Horn and C.R. Johnson. Matrix Analysis. Cambridge University Press, New York, 1985.
15. F.G. Kuruvilla, P.J. Park, and S.L. Schreiber. Vector algebra in the analysis of genome-wide expression data. Genome Biology, 3:research0011.1-0011. 11, 2002.
16. Z. Lin and R.B. Altman. Finding haplotype tagging SNPs by use of principal components analysis. American Journal of Human Genetics, 75:850-861, 2004.
17. M.Z. Nashed, editor. Generalized Inverses and Applications, Academic Press, New York, 1976.
18. P. Paschou, M.W. Mahoney, J.R. Kidd, A.J. Pakstis, S. Gu, K.K. Kidd, and P. Drineas. Intra- and inter-population genotype reconstruction from tagging SNPs. Manuscript submitted for publication.
19. L. Rademacher. S. Vempala, and G. Wang. Matrix approximation and projective clustering via iterative sampling. Technical Report MIT-LCS-TR-983, Massachusetts Institute of Technology, Cambridge, MA, March 2005.
20. M. Rudelson and R. Vershynin. Approximation of matrices. Manuscript.
21. R. Vershynin. Coordinate restrictions of linear operators in 1%. Manuscript.