A sparse Johnson-Lindenstrauss transform

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 341-350

  Dasgupta, Anirban ^a   Kumar, Ravi ^a   Sarlos, Tamás ^a  

^a YAHOO RESEARCH   (United States)

Author keywords

dimensionality reduction; Johnson Lindenstrauss transform

Indexed keywords

ALGORITHMIC TOOLS; APPROXIMATE PROJECTION; COMPRESSED SENSING; DIMENSION REDUCTION; DIMENSIONALITY REDUCTION; FUNDAMENTAL TOOLS; LARGE CLASS; LOWER BOUNDS; NEAREST NEIGHBOR SEARCH; PROJECTION MATRIX; RUNNING TIME; SPARSE VECTORS; STREAMING MODEL; WORST CASE;

COMPUTATION THEORY; WAVELET TRANSFORMS;

MATRIX ALGEBRA;

EID: 77954786104     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806737     Document Type: Conference Paper

References (33)

1. D. Achlioptas. Database-friendly random projections: Johnson- Lindenstrauss with with binary coins. Journal of Computer and System Sciences, 66(4):671-687, 2003.
2. N. Ailon and B. Chazelle. The fast Johnson-Lindenstrauss transform and approximate nearest neighbors. SIAM Journal on Computing, 39(1):302-322, 2009.
3. N. Ailon and E. Liberty. Fast dimension reduction using Rademacher series on dual BCH codes. Discrete and Computational Geometry, 42(4):615-630, 2009.
4. N. Alon. Problems and results in extremal combinatorics, Part I. Discrete Math, 273:31-53, 2003.
5. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
6. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley-Interscience, 2nd edition, 2000.
7. R. I. Arriaga and S. Vempala. An algorithmic theory of learning: Robust concepts and random and random projection. In Proc. 40th IEEE Symposium on Foundations of Computer Science, pages 616-623, 1999.
8. M. F. Balcan, A. Blum, and S. Vempala. Kernels as features: On kernels, margins, and low-dimensional mappings. Machine Learning, 65(1):79-94, 2006.
9. B. Berger. The fourth moment method. SIAM Journal on Computing, 26(4):1188-1207, 1997.
10. R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss. Combining geometry and combinatorics: A unified approach to sparse signal recovery. In 46th Annual Allerton Conference, pages 798-805, 2008.
11. E. J. Candes and T. Tao. Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Transactions on Information Theory, 52(12):5406-5425, 2006.
12. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. Theoretical Computer Science, 312(1):3-15, 2004.
13. K. L. Clarkson. Tighter bounds for random projections of manifolds. In Proc. 24th Annual Symposium on Computational geometry, pages 39-48, 2008.
14. K. L. Clarkson and D. P. Woodruff. Numerical linear algebra in the streaming model. In Proc. 41st Annual ACM Symposium on Theory of Computing, pages 205-214, 2009.
15. G. Cormode and M. Garofalakis. Sketching streams through the net: Distributed approximate query tracking. In Proc. 31st International Conference on Very Large Data Bases, pages 13-24, 2005.
16. S. Dasgupta and A. Gupta. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Structures and Algorithms, 22(1):60-65, 2003.
17. P. Drineas, M. W. Mahoney, S. Muthukrishnan, and T. Sarlós. Faster least squares approximation. Arxiv preprint arXiv:0710.1435, 2007.
18. Z. Füredi and Z. Katona. Multiply intersecting families of sets. Journal of Combinatorial Theory, Series A, 106(2):315-326, 2004.
19. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. 20th Annual ACM Symposium on Theory of Computing, pages 604-613, 1998.
20. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. Contemporary Mathematics, 26:189-206, 1984.
21. J. Langford, L. Li, and A. Strehl. Vowpal wabbit online learning project. Technical report, http://hunch.net/?p=309, 2007.
22. E. Liberty, N. Ailon, and A. Singer. Dense fast random projections and lean Walsh transforms. In Proc. 12th International Workshop on Randomization and Approximation Techniques in Computer Science, pages 512-522, 2008.
23. J. Matousek. On variants of the Johnson-Lindenstrauss lemma. Random Structures and Algorithms, 33(2):142-156, 2008.
24. C. McDiarmid. Concentration. In M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors, Probabilistic Methods for Algorithmic Discrete Mathematics, volume 16, pages 195-248. Springer, 1998.
25. N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
26. V. Rokhlin, A. Szlam, and M. Tygert. A randomized algorithm for principal component analysis. SIAM Journal on Matrix Analysis and Application, 31(3):1100-1124, 2009.
27. P. Sanders. On the competitive analysis of randomized static load balancing. In Proc. 1st Workshop on Randomized Parallel Algorithms, 1996.
28. T. Sarlós. Improved approximation algorithms for large matrices via random projections. In Proc.47th IEEE Symposium on Foundations of Computer Science, pages 143-152, 2006.
29. Q. Shi, J. Petterson, G. Dror, J. Langford, A. J. Smola, A. Strehl, and V. Vishwanathan. Hash kernels. In D. van Dyk and M. Welling, editors, AISTATS 12, 2009.
30. D. A. Spielman and N. Srivastava. Graph sparsification by effective resistances. In Proc. 40th Annual ACM Symposium on Theory of Computing, pages 563-568, 2008.
31. M. Thorup and Y. Zhang. Tabulation based 4-universal hashing with applications to second moment estimation. In Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 615-624, 2004.
32. S. Vempala. The random projection method. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 65. American Mathematical Society, Providence, RI, 2004.
33. K. Weinberger, A. Dasgupta, J. Attenberg, J. Langford, and A. Smola. Feature hashing for large scale multitask learning. In Proc. 26th International Conference on Machine Learning, page 140, 2009.