A unified framework for approximating and clustering data

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 569-578

  Feldman, Dan ^a   Langberg, Michael ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

approximating; clustering; coresets; cur; epsilon approximation; epsilon nets; k means; k median; pac learning; pca; regression; svd

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; CURING; OPTIMIZATION; SINGULAR VALUE DECOMPOSITION;

APPROXIMATING; CLUSTERING; CORE SET; EPSILON-APPROXIMATION; EPSILON-NETS; K-MEANS; K-MEDIAN; PAC LEARNING; REGRESSION;

K-MEANS CLUSTERING;

EID: 79959744443     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993712     Document Type: Conference Paper

References (40)

1. N.K. Vishnoi A. Deshpande, M. Tulsiani. Algorithms and hardness for subspace approximation. to appear in proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2011.
2. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Geometric approximations via coresets. Combinatorial and Computational Geometry - MSRI Publications, 52:1-30, 2005.
3. A. Bagchi, A. Chaudhary, D. Eppstein, and M. T. Goodrich. Deterministic sampling and range counting in geometric data streams. ACM Transactions on Algorithms, 3(2):16:1-16, May 2007.
4. J.D. Batson, D.A. Spielman, and N. Srivastava. Twice-ramanujan sparsifiers. In Proceedings of the 41st annual ACM symposium on Theory of computing, pages 255-262. ACM, 2009.
5. C. Boutsidis, P. Drineas, and M. Magdon-Ismail. Near-optimal column-based matrix reconstruction, March 04 2011. Comment: working paper.
6. H. Brönnimann and M.T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete and Computational Geometry, 14(1):463-479, 1995.
7. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. In Proc. 12th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 642-651, 2001.
8. Chazelle, Edelsbrunner, Grigni, Guibas, Sharir, and Welzl. Improved bounds on weak epsilon-nets for convex sets. GEOMETRY: Discrete & Computational Geometry, 13, 1995.
9. B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. COMBINAT: Combinatorica, 10, 1990.
10. K. Chen. On k-median clusteing in high dimensions. In Proc. 17th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 1177-1185, 2006.
11. K. Chen. A constant factor approximation algorithm for k -median clustering with outliers. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pages 826-835. SIAM, 2008.
12. 1-regression. In Proc. 16th Annu. ACM-SIAM Symp. on Discrete algorithms (SODA), pages 257-266, 2005.
13. K. L. Clarkson and David P. Woodruff. Numerical linear algebra in the streaming model. In Michael Mitzenmacher, editor, STOC, pages 205-214. ACM, 2009.
14. A. Czumaj and C. Sohler. Sublinear-time approximation algorithms for clustering via random sampling. Random Struct. Algorithms (RSA), 30(1-2):226-256, 2007.
15. p-regression. In Proc. 19th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 932-941, 2008.
16. A. Deshpande and K. R. Varadarajan. Sampling-based dimension reduction for subspace approximation. In Proc. 39th Annu. ACM Symp. on Theory of Computing (STOC), pages 641-650, 2007.
17. P. Drineas, M. W. Mahoney, and S. Muthukrishnan. Sampling algorithms for l2 regression and applications. In Proc. 17th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 1127-1136. ACM Press, 2006.
18. M. Feigin, D. Feldman, and Nir Sochen. From high definition image to low space optimization. In Proc. 3rd Inter. Conf. on Scale Space and Variational Methods in Computer Vision (SSVM 2011), 2011.
19. D. Feldman, A. Fiat, H. Kaplan, and K. Nissim. Private coresets. In Proc. 41st Annu. ACM Symp. on Theory of Computing (STOC), pages 361-370, 2009.
20. D. Feldman, A. Fiat, D. Segev, and M. Sharir. Bi-criteria linear-time approximations for generalized k-mean/median/center. In Proc. 23rd ACM Symp. on Computational Geometry (SOCG), pages 19-26, 2007.
21. D. Feldman, A. Fiat, and M. Sharir. Coresets for weighted facilities and their applications. In Proc. 47th IEEE Annu. Symp. on Foundations of Computer Science (FOCS), pages 315-324, 2006.
22. D. Feldman and M. Langberg. A unified framework for approximating and clustering data. Manuscript available at arXiv.org, 2011.
23. D. Feldman, M. Monemizadeh, and C. Sohler. A PTAS for k-means clustering based on weak coresets. In Proc. 23rd ACM Symp. on Computational Geometry (SoCG), pages 11-18, 2007.
24. D. Feldman, M. Monemizadeh, C. Sohler, and D. P. Woodruff. Coresets and sketches for high dimensional subspace approximation problems. In Proc. 21th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2010.
25. S. Har-Peled. No coreset, no cry. In Proc. 24th Int. Conf. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 3328 of Lecture Notes in Computer Science, pages 324-335. Springer, 2004.
26. S. Har-Peled. Coresets for discrete integration and clustering. In Proc. 26th Int. Conf. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 4337 of Lecture Notes in Computer Science, pages 33-44. Springer, 2006.
27. S. Har-Peled and A. Kushal. Smaller coresets for k-median and k-means clustering. Discrete & Computational Geometry, 37(1):3-19, 2007.
28. S. Har-Peled and S. Mazumdar. On coresets for k-means and k-median clustering. In Proc. 36th Annu. ACM Symp. on Theory of Computing (STOC), pages 291-300, 2004.
29. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. In Annu. ACM Symp. on Computational Geometry (SoCG), 1986.
30. P. Indyk. Sublinear time algorithms for metric space problems. In Proc. 31st Annu. ACM Symp. on Theory of Computing (STOC), pages 428-434, 1999.
31. M. Langberg and L. J. Schulman. Universal ε approximators for integrals. proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010.
32. Y. Li, P. M. Long, and A. Srinivasan. Improved bounds on the sample complexity of learning. Journal of Computer and System Sciences (JCSS), 62, 2001.
33. Yi Li, Philip M. Long, and Aravind Srinivasan. Improved bounds on the sample complexity of learning. In Symp. on Discrete Algorithms, pages 309-318, 2000.
34. M.W. Mahoney and P. Drineas. CUR matrix decompositions for improved data analysis. Proceedings of the National Academy of Sciences, 106(3):697, 2009.
35. J. Matousek. Approximations and optimal geometric divide-an-conquer. J. Comput. Syst. Sci, 50(2):203-208, 1995.
36. N. Meggido and A. Tamir. Finding least-distance lines. SIAM J. on Algebric and Discrete Methods, 4:207-211, 1983.
37. A. Naor. Sparse quadratic forms and their geometric applications (after Batson, Spielman and Srivastava). Arxiv preprint arXiv:1101.4324, 2011.
38. T. Sarlós. Improved approximation algorithms for large matrices via random projections. In Proc. 47th IEEE Annu. Symp. on Foundations of Computer Science (FOCS), pages 143-152, 2006.
39. N. D. Shyamalkumar and K. R. Varadarajan. Efficient subspace approximation algorithms. In Proc. 18th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 532-540, 2007.
40. V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2):264-280, 1971.