Coresets and sketches for high dimensional subspace approximation problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 630-649

  Feldman, Dan ^a   Monemizadeh, Morteza ^b   Sohler, Christian ^b   Woodruff, David P ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b TU DORTMUND UNIVERSITY   (Germany)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

DIMENSIONAL SUBSPACE; DIMENSIONALITY REDUCTION METHOD; HIGH DIMENSIONAL SPACES; MASSIVE DATA SETS; MATRIX APPROXIMATION; MULTIPLICATIVE FACTORS; STREAMING ALGORITHM; SUBSPACE APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 77951676610     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.53     Document Type: Conference Paper

References (26)

1. P. K. Agarwal, S. Har-Peled, and K.R. Varadarajan. Approximating extent measures of points, J. ACM, volume 51(4), pp. 606-635, 2004.
2. N. Alon and J. Spencer, The probabilistic method, J. Wiley & Sons, New York, 2nd edition, 2000.
3. M. Belkin and P. Niyogi, Laplacian eigenmaps for dimensionality reduction and data representation, Neural Computation, volume 15(6), pp. 1373-1396, 2003.
4. M. Belkin and P. Niyogi, Semi-supervised learning on riemannian manifolds, Machine Learning Journal, 56, 2004.
5. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar, An information statistics approach to data stream and communication complexity., In Proc. 43th Annu. IEEE Symp. Found. Comput. Sci. (FOCS), pp. 209-218, 2002.
6. A. Chakrabarti, S. Khot, and X. Sun, Near-optimal lower bounds on the multi-party communication complexity of set disjointness, In Proc. 18th Ann. IEEE Conf. on Computational Complexity (CCC), pp. 107-117, 2003.
7. K. Clarkson and D. Woodruff, Numerical linear algebra in the streaming model, Proc. 41th Annu. ACM Symp. Theory Comput. (STOC), 2009.
8. p regression. Siam J. Comput., 38(5), pp. 2060-2078, 2009.
9. A. Deshpande, L. Rademacher, S. Vempala, and G. Wang, Matrix approximation and projective clustering via volume sampling, Theory of Computing, volume 2(12), pp. 225-247, 2006.
10. A. Deshpande and K. Varadarajan, Sampling-based dimension reduction for subspace approximation, Proc. 39th Annu. ACM Symp. Theory Comput. (STOC), 2007.
11. D. Feldman, A. Fiat, and M. Sharir, Coresets for weighted facilities and their applications, Proc. 47th Annu. IEEE Symp. Found. Comput. Sci. (FOCS), 2006.
12. A. Frieze, R. Kannan, and S. Vempala, Fast monte-carlo algorithms for finding low-rank approximations, JACM, 32(2), pp. 269-288, 2004.
13. D. Feldman and M. Landberg, Algorithms for approximating subspaces by subspaces, 2007.
14. D. Feldman, M. Monemizadeh, and C. Sohler, A ptas for k-means clustering based on weak coresets, Proc. 23st Annu. ACM Sympos. Comput. Geom. (SOCG), pp. 11-18, 2007. (Pubitemid 47582035)
15. S. Har-Peled, How to get close to the median shape, CGTA, 36(1), pp. 39-51, 2007.
16. S. Har-Peled and S. Mazumdar, Coresets for k-means and k-median clustering and their applications, Proc. 36th Annu. ACM Sympos. Theory Comput. (STOC), pp. 291-300, 2004.
17. P. Indyk, Stable distributions, pseudorandom generators, embeddings, and data stream computation, J. ACM, 53(3), pp. 307-323, 2006.
18. T.S. Jayram and D. Woodruff, The data stream space complexity of cascaded norms, In Proc. 50th Annu. IEEE Symp. Found. Comput. Sci. (FOCS), FOCS, 2009.
19. D. Kane, J. Nelson, and D. Woodruff. On the Exact Space Complexity of Sketching and Streaming Small Norms. In Proc. 21th ACM-SIAM Symp. Discrete Algorithms (SODA), 2010.
20. J. Kleinberg and M. Sandler, Using mixture models for collaborative filtering, In Proc. 36th Annu. ACM Sympos. Theory Comput. (STOC), pp. 569-578, 2004.
21. D. Kuzmin and M. K. Warmuth, Online kernel PCA with entropic matrix updates, In Proc. 24th Intl. Conf. for Machine Learning , pp. 465-472, 2007. (Pubitemid 47275098)
22. A. Lakhina, M. Crovella, and C. Diot, Characterization of network-wide anomalies in traffic flows. In Proc. 4th ACM SIGCOMM Conf. on Internet measurement, pp. 201-206, 2004.
23. α (0 < α ≤ 2) using stable random projections. In SODA, pp. 10-19, 2008.
24. T. Sarlós. Improved approximation algorithms for large matrices via random projections. In Proc. 47th Annu. IEEE Symp. Found. Comput. Sci. (FOCS), pp. 143-152, 2006.
25. N.D. Shyamalkumar and K. Varadrajan. Efficient subspace approximation algorithms. In Proc. 18th ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 532-540, 2007.
26. M. Vose. A linear algorithm for generating random numbers with a given distribution. In IEEE Trans. Software Eng., 17:9, pp. 972-975, 1991.