Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Top Cited Papers
- 1 June 2003
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 66 (4) , 671-687
- https://doi.org/10.1016/s0022-0000(03)00025-4
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Stable distributions, pseudorandom generators, embeddings and data stream computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Algorithmic derandomization via complexity theoryPublished by Association for Computing Machinery (ACM) ,2002
- Database-friendly random projectionsPublished by Association for Computing Machinery (ACM) ,2001
- Clustering for edge-cost minimization (extended abstract)Published by Association for Computing Machinery (ACM) ,2000
- Efficient Search for Approximate Nearest Neighbor in High Dimensional SpacesSIAM Journal on Computing, 2000
- Latent semantic indexingPublished by Association for Computing Machinery (ACM) ,1998
- Two algorithms for nearest-neighbor search in high dimensionsPublished by Association for Computing Machinery (ACM) ,1997
- The geometry of graphs and some of its algorithmic applicationsCombinatorica, 1995
- The Johnson-Lindenstrauss lemma and the sphericity of some graphsJournal of Combinatorial Theory, Series B, 1988
- Extensions of Lipschitz mappings into a Hilbert spacePublished by American Mathematical Society (AMS) ,1984