Database-friendly random projections: Johnson-Lindenstrauss with binary coins

Journal of Computer and System Sciences

Volumn 66, Issue 4, 2003, Pages 671-687

  Achlioptas, Dimitris ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; MATRIX ALGEBRA; PROJECTION SYSTEMS; VECTORS;

PROJECTION MATRIX;

DATABASE SYSTEMS;

EID: 0038166193     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00025-4     Document Type: Conference Paper

References (16)

1. D. Achlioptas, Database-friendly random projections, 20th Annual Symposium on Principles of Database Systems, Santa Barbara, CA, 2001, pp. 274-281.
2. R.I. Arriaga, S. Vempala, An algorithmic theory of learnings: robust concepts and random projection, 40th Annual Symposium on Foundations of Computer Science, New York, NY, 1999, IEEE Computer Society Press, Los Alamitos, CA, 1999, pp. 616-623.
3. S. Arora, R. Kannan, Learning mixtures of arbitrary Gaussians, 33rd Annual ACM Symposium on Theory of Computing, Creete, Greece, ACM, New York, 2001, pp. 247-257.
4. S. Dasgupta, Learning mixtures of Gaussians, 40th Annual Symposium on Foundations of Computer Science, New York, NY, 1999, IEEE Computer Society Press, Los Alamitos, CA, 1999, pp. 634-644.
5. S. Dasgupta, A. Gupta, An elementary proof of the Johnson-Lindenstrauss lemma. Technical Report 99-006, UC Berkeley, March 1999.
6. P. Frankl, H. Maehara, The Johnson-Lindenstrauss lemma and the sphericity of some graphs, J. Combin. Theory Ser. B 44 (3) (1988) 355-362.
7. P. Indyk, Stable distributions, pseudorandom generators, embeddings and data stream computation, 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, IEEE Computer Society Press, Los Alamitos, CA, 2000, pp. 189-197.
8. P. Indyk, R. Motwani, Approximate nearest neighbors: towards removing the curse of dimensionality, 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, ACM, New York, 1998, pp. 604-613.
9. W.B. Johnson, J. Lindenstrauss, Extensions of Lipschitz mappings into a Hilbert space, Conference in modern analysis and probability, New Haven, CI, 1982, Amer. Math. Soc., Providence, RI, 1984, pp. 189-206.
10. J. Kleinberg, Two algorithms for nearest-neighbor search in high dimensions, 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, ACM, New York, 1997, pp. 599-608.
11. E. Kushilevitz, R. Ostrovsky, Y. Rabani, Efficient search for approximate nearest neighbor in high dimensional spaces, SIAM J. Comput. 30 (2) (2000) 457-474.
12. N. Linial, E. London, Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica 15 (2) (1995) 215-245.
13. C.H. Papadimitriou, P. Raghavan, H. Tamaki, S. Vempala, Latent semantic indexing: a. probabilistic analysis, 17th Annual Symposium on Principles of Database Systems, Seattle, WA, 1998, pp. 159-168.
14. L.J. Schulman, Clustering for edge-cost minimization, 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, 2000, ACM, New York, 2000, pp. 547-555.
15. D. Sivakumar, Algorithmic derandomization via complexity theory, 34th Annual ACM Symposium on Theory of Computing, Montreal, QC, 2002, ACM, New York, 2002, pp. 619-626.
16. S. Vempala, A random sampling based algorithm for learning the intersection of half-spaces, 38th Annual Symposium on Foundations of Computer Science, Miami, FL, 1997, IEEE Computer Society Press, Los Alamitos, CA, 1997, pp. 508-513.