Relative-error cur matrix decompositions

SIAM Journal on Matrix Analysis and Applications

Volumn 30, Issue 2, 2008, Pages 844-881

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

^a Rensselaer Polytechnic Institute   (United States)

^b YAHOO RESEARCH   (United States)

^c YALE UNIVERSITY   (United States)

^d GOOGLE INC   (United States)

^e RUTGERS UNIVERSITY   (United States)

Author keywords

Approximate least squares; CUR matrix decomposition; Data analysis; Random sampling algorithms

Indexed keywords

APPROXIMATE LEAST SQUARES; CUR MATRIX DECOMPOSITION; DATA ANALYSIS; DATA MATRICES; DECONVOLUTING; EUCLIDEAN NORM; FROBENIUS NORM; GENERALIZED INVERSE; INPUT DATA; INPUT MATRICES; LINEAR COMBINATIONS; LOW-RANK MATRICES; MATRIX; MATRIX APPROXIMATION; MATRIX DECOMPOSITION; MOORE-PENROSE GENERALIZED INVERSE; N-MATRIX; NUMERICAL LINEAR ALGEBRA; POLYNOMIAL-TIME ALGORITHMS; RANDOM SAMPLING ALGORITHMS; RANDOMIZED ALGORITHMS; SAMPLING METHOD; SINGULAR VECTORS; THEORETICAL COMPUTER SCIENCE;

APPROXIMATION ALGORITHMS; CURVE FITTING; DECOMPOSITION; LEAST SQUARES APPROXIMATIONS; POLYNOMIAL APPROXIMATION; PROBABILITY; SAMPLING;

MATRIX ALGEBRA;

EID: 58849107202     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/07070471X     Document Type: Article

References (64)

1. D. ACHLIOPTAS AND F. MCSHERRY, Fast computation of low rank matrix approximations, J. ACM, 54 (2007).
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-6181.
3. P. K. AGARWAL, S. HAR-PELED, and K. R. VARADARAJAN, Approximating extent measures of points, J. ACM, 51 (2004), pp. 606-635.
4. P. K. AGARWAL, S. HAR-PELED, and K. R. VARADARAJAN, Geometric approximation via coresets survey, in Current Trends in Combinatorial and Computational Geometry, E. Welzl, ed., Cambridge University Press, Cambridge, 2006.
5. N. AILON and B. CHAZELLE, Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, pp. 557-563.
6. A. BEN-ISRAEL and T. N. E. GREVILLE, Generalized Inverses: Theory and Applications, Springer-Verlag, New York, 2003.
7. Y. BENGIO, J. F. PAIEMENT, P. VINCENT, O. DELALLEAU, N. LE ROUX, and M. OUIMET, Out-of-sample extensions for LLE, Isomap, MDS, eigenmaps, and spectral clustering, in Annual Advances in Neural Information Processing Systems 16: Proceedings of the 2003 Conference, 2004, pp. 177-184.
8. M. W. BERRY, S. A. PULATOVA, and G. W. STEWART, Computing sparse reduced-rank approximations to sparse matrices, ACM Trans. Math. Software, 31 (2005), pp. 252-269.
9. R. BHATIA, Matrix Analysis, Springer-Verlag, New York, 1997.
10. A. L. BLUM and P. LANGLEY, Selection of relevant features and examples in machine learning, Artif. Intell., 97 (1997), pp. 245-271.
11. P. BUSINGER AND G. H. GOLUB, Linear least squares solutions by Householder transformations, Numer. Math., 7 (1965), pp. 269-276.
12. T. F. CHAN and P. C. HANSEN, Computing truncated singular value decomposition least squares solutions by rank revealing QR-factorizations, SIAM J. Sci. Stat. Comput., 11 (1990), pp. 519-530.
13. T. F. CHAN and P. C. HANSEN, Some applications of the rank revealing QR factorization, SIAM J. Sci. Stat. Comput., 13 (1992), pp. 727-741.
14. M. CHARIKAR, V. GURUSWAMI, R. KUMAR, S. RAJAGOPALAN. and A. SAHAI, Combinatorial feature selection problems, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 631-642.
15. THE INTERNATIONAL HAPMAP CONSORTIUM, A haplotype map of the human genome. Nature. 437 (2005), pp. 1299-1320.
16. A. DASGUPTA, P. DRINEAS, B. HARB. V. JOSIFOVSKI. and M. W. MAHONEY, Feature selection methods for text classification, in Proceedings of the 13th Annual ACM SIGKDD Conference, 2007, pp. 230-239.
17. 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, 2006, pp. 1117-1126.
18. A. DESHPANDE and S. VEMPALA, Adaptive sampling and fast low-rank matrix approximation, Technical report TR06-042, Electronic Colloquium on Computational Complexity, 2006.
19. 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, 1999, pp. 291-299.
20. P. DRINEAS AND R. KANNAN, Pass efficient algorithms for approximating large matrices, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. 2003, pp. 223-232.
21. 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.
22. 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.
23. P. DRINEAS, R. KANNAN, and M. W. MAHONEY, Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition, SIAM J. Comput., 36 (2006), pp. 184-206.
24. 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.
25. P. DRINEAS and M. W. MAHONEY, On the Nystrom method for approximating a Gram matrix for improved kernel-based learning, J. Mach. Learn. Res., 6 (2005), pp. 2153-2175.
26. P. DRINEAS and M. W. MAHONEY, A randomized algorithm for a tensor-based generalization of the Singular Value Decomposition, Linear Algebra Appl., 420 (2007), pp. 553-571.
27. P. DRINEAS, M. W. MAHONEY, and S. M UTHUKRISHNAN, Polynomial time algorithm for column-row based relative-error low-rank matrix approximation, manuscript, 2005.
28. P. DRINEAS, M. W. MAHONEY, and S. M UTHUKRISHNAN, Polynomial time algorithm for column-row based relative-error low-rank matrix approximation, Technical report 2006-04, DIMACS, 2006.
29. 2 regression and applications, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 1127-1136.
30. P. DRINEAS, M. W. MAHONEY, and S. M UTHUKRISHNAN, Subspace sampling and relative-error matrix approximation: Column-based methods, in Proceedings of the 10th International Workshop on Randomization and Computation, 2006, pp. 316-326.
31. P. DRINEAS, M. W. MAHONEY, and S. M UTHUKRISHNAN, Subspace sampling and relative-error matrix approximation: Column-row-based methods, in Proceedings of the 14th Annual European Symposium on Algorithms, 2006, pp. 304-314.
32. C. FOWLKES, S. BELONGIE, F. CHUNG, and J. MALIK, Spectral grouping using the Nyström method, IEEE Trans. Pattern Anal. Mach. Intell., 26 (2004), pp. 214-225.
33. 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.
34. A. FRIEZE, R. KANNAN, and S. VEMPALA, Fast Monte-Carlo algorithms for finding low-rank approximations, J. ACM, 51 (2004), pp. 1025-1041.
35. K. GOLDBERG, T. ROEDER, D. GUPTA, and C. PERKINS, Eigentaste: A constant time collaborative filtering algorithm, Inform. Retrieval, 4 (2001), pp. 133-151.
36. G. GOLUB, Numerical methods for solving linear least squares problems, Numer. Math., 7 (1965), pp. 206-216.
37. G. H. GOLUB and C. F. VAN LOAN, Matrix Computations, Johns Hopkins University Press, Baltimore, 1996.
38. S. A. GOREINOV and E. E. TYRTYSHNIKOV, The maximum-volume concept in approximation by low-rank matrices, Contemp. Math., 280 (2001), pp. 47-51.
39. S. A. GOREINOV, E. E. TYRTYSHNIKOV, and N. L. ZAMARASHKIN, A theory of pseudoskeleton approximations. Linear Algebra Appl., 261 (1997), pp. 1-21.
40. M. GU AND S. C. EISENSTAT, Efficient algorithms for computing a strong rank-revealing QR factorization, SIAM J. Sci. Comput., 17 (1996), pp. 848-869.
41. I. GUYON and A. ELISSEEFF, An introduction to variable and feature selection, J. Mach. Learn. Res., 3 (2003), pp. 1157-1182.
42. S. HAR-PELED, Low rank matrix approximation in linear time, manuscript, 2006.
43. R. A. HORN and C. R. JOHNSON, Matrix Analysis, Cambridge University Press, New York, 1985.
44. F. G. KURUVILLA, P. J. PARK, and S. L. SCHREIBER, Vector algebra in the analysis of genomewide expression data, Genome Biol., 3 (2002), research0011.1-0011.11.
45. S. LAFON, Diffusion Maps and Geometric Harmonics, Ph.D. thesis, Yale University, 2004.
46. D. D. LEWIS, Y. YANG, T. G. ROSE, and F. LI, RCV1: A new benchmark collection for text categorization research, J. Mach. Learn. Res., 5 (2004), pp. 361-397.
47. Z. LIN and R. B. ALTMAN, Finding haplotype tagging SNPs by use of principal components analysis, Amer. J. Human Genetics, 75 (2004), pp. 850-861.
48. M. W. MAHONEY, M. MAGGIONI, and P. DRINEAS, Tensor-CUR decompositions for tensorbased data, in Proceedings of the 12th Annual ACM SIGKDD Conference, 2006, pp. 327-336.
49. P.-G. MARTINSSON, V. ROKHLIN, and M. TYGERT, A randomized algorithm for the approximation of matrices, Technical report YALEU/DCS/TR-1361, Yale University Department of Computer Science, New Haven, CT, 2006.
50. M. Z. NASHED, ED., Generalized Inverses and Applications, Academic Press, New York, 1976.
51. B. N. PARLETT, The Symmetric Eigenvalue Problem, Classics in Applied Mathematics, SIAM, Philadelphia, 1998.
52. P. PASCHOU, M. W. MAHONEY, A. JAVED, J. R. KIDD, A. J. PAKSTIS, S. GU, K. K. KIDD, and P. DRINEAS, Intra-and interpopulation genotype reconstruction from tagging SNPs, Genome Res., 17 (2007), pp. 96-107.
53. 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, 2005.
54. M. RUDELSON, Random vectors in the isotropic position, J. Funct. Anal., 164 (1999), pp. 60-72.
55. M. RUDELSON and R. VERSHYNIN, Approximation of matrices, manuscript.
56. M. RUDELSON and R. VERSHYNIN, Sampling from large matrices: An approach through geometric functional analysis, J. ACM, 54 (2007).
57. T. SARLOS, Improved approximation algorithms for large matrices via random projections, in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006, pp. 143-152.
58. G. W. STEWART, Four algorithms for the efficient computation of truncated QR approximations to a sparse matrix, Numer. Math., 83 (1999), pp. 313-323.
59. G. W. STEWART, Error analysis of the quasi-Gram-Schmidt algorithm, Technical report UMI-ACS TR-2004-17 CMSC TR-4572, University of Maryland, College Park, MD, 2004.
60. G. W. STEWART and J. G. SUN, Matrix Perturbation Theory, Academic Press, New York, 1990.
61. E. TYRTYSHNIKOV, Incomplete cross approximation in the mosaic-skeleton method, Comput., 64 (2000), pp. 367-380.
62. 2, manuscript.
63. C. K. I. WILLIAMS, C. E. RASMUSSEN, A. SCHWAIGHOFER, and V. TRESP, Observations on the Nystrom method for Gaussian process prediction, Technical report, University of Edinburgh, 2002.
64. C. K. I. WILLIAMS and M. SEEGER, Using the Nystrom method to speed up kernel machines, in Annual Advances in Neural Information Processing Systems 13: Proceedings of the 2000 Conference, 2002, pp. 682-688.