Sampling-based dimension reduction for subspace approximation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 641-650

  Deshpande, Amit ^a   Varadarajan, Kasturi ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Subspace approximation

Indexed keywords

ERROR ANALYSIS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING;

K-DIMENSIONAL SUBSPACE; SUBSPACE APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 35448929865     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250884     Document Type: Conference Paper

References (13)

1. D. Achlioptas, F. McSherry. Fast Computation of Low Rank Approximations. Proc. of the 33rd ACM Symposium on Theory of Computing (STOC), 2001.
2. P. Drineas, R. Kannan, M. Mahoney. Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix. Yale University Technical R-eport, YALEU/DCS/TR-1270, 2004.
3. P. Drineas, M. Mahoney, S. Muthukrishnan. Polynomial time algorithm for column-row based relative error low-rank matrix approximation. DIMACS Technical Report 2006-04, 2006.
4. A. Deshpande, L. Rademacher, S. Vempala, G. Wang. Matrix Approximation and Projective Clustering via Volume Sampling. Proc. of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.
5. A. Deshpande, S. Vempala. Adaptive Sampling and Fast Low-Rank Matrix Approximation. Proc. of 10th International Workshop on Randomization and Computation (RANDOM), 2006.
6. D. Feldman, A. Fiat, and M. Sharir. Coresets for weighted facilities and their applications. Proc. of IEEE Symposium on Foundations of Computer Science (FOCS), 2006.
7. A. Frieze, R. Kannan, S. Vempala. Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. Proc. of IEEE Symposium on Foundations of Computer Science (FOCS), 1998.
8. S. Har-Peled. How to get close to the median shape. Proc. of ACM Symposium on Computational Geometry (SOCG), 2006.
9. S. Har-Peled. Low-Rank Matrix Approximation in Linear Time, manuscript.
10. S. Har-Peled and K. R. Varadarajan. Projective clustering in high dimensions using core-sets. Proc. of ACM Symposium on Computational Geometry (SOCG), 2002, pp. 312-318.
11. S. Har-Peled and K. Varadarajan. High-Dimensional Shape Fitting in Linear Time. Discrete & Computational Geometry, 32(2), 2004, pp. 269-288.
12. T. Sarlos. Improved Approximation Algorithms for Large Matrices via Random Projections. Proc. of IEEE Symposium on Foundations of Computer Science (FOCS), 2006.
13. N. D. Shyamalkumar and K. Varadarajan. Efficient Subspace Approximation Algorithms. Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007.