The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
Abstract
We introduce a new low-distortion embedding of $\ell_2^d$ into $\ell_p^{O(\log n)}$ ($p=1,2$) called the fast Johnson–Lindenstrauss transform (FJLT). The FJLT is faster than standard random projections and just as easy to implement. It is based upon the preconditioning of a sparse projection matrix with a randomized Fourier transform. Sparse random projections are unsuitable for low-distortion embeddings. We overcome this handicap by exploiting the “Heisenberg principle” of the Fourier transform, i.e., its local-global duality. The FJLT can be used to speed up search algorithms based on low-distortion embeddings in $\ell_1$ and $\ell_2$. We consider the case of approximate nearest neighbors in $\ell_2^d$. We provide a faster algorithm using classical projections, which we then speed up further by plugging in the FJLT. We also give a faster algorithm for searching over the hypercube.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Extensions of Lipschitz mappings into a Hilbert space
Johnson, W. B., & Lindenstrauss, J. (1984) · Contemporary Mathematics · doi:10.1090/conm/026/737400 · Cited by 2,523
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y. (1998) · Journal of the ACM · doi:10.1145/293347.293348 · Cited by 2,300
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Achlioptas, D. (2003) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(03)00025-4 · Cited by 1,392
Random projection in dimensionality reduction: applications to image and text data
Bingham, E., & Mannila, H. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502546 · Cited by 1,274
(1993) · doi:10.5555/313559.313789 · Cited by 998
The geometry of graphs and some of its algorithmic applications
Linial, N., London, E., & Rabinovich, Y. (1995) · Combinatorica · doi:10.1007/bf01200757 · Cited by 952
Latent semantic indexing: a probabilistic analysis
Papadimitriou, C. H., Tamaki, H., Raghavan, P., & Vempala, S. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275505 · Cited by 863
Extensions of Lipschitz mappings into a Hilbert space
Johnson, W. B. (1984) · Medical Entomology and Zoology · Cited by 661
Probability and Related Topics in Physical Sciences
Kac, M., Uhlenbeck, G. E., Hibbs, A. R., van der Pol, B., & Gillis, J. (1960) · Physics Today · doi:10.1063/1.3056918 · Cited by 655
Improved Approximation Algorithms for Large Matrices via Random Projections
Sarlos, T. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.37 · Cited by 646
Two algorithms for nearest-neighbor search in high dimensions
Kleinberg, J. M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258653 · Cited by 348
Approximate nearest neighbor queries in fixed dimensions
Arya, S., & Mount, D. M. (1993) · doi:10.5555/313559.313768 · Cited by 303
The Johnson-Lindenstrauss lemma and the sphericity of some graphs
Frankl, P., & Maehara, H. (1988) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(88)90043-3 · Cited by 299
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
Kushilevitz, E., Ostrovsky, R., & Rabani, Y. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539798347177 · Cited by 245
Stable distributions, pseudorandom generators, embeddings and data stream computation
Indyk, P. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892082 · Cited by 238
Nearest Neighbors in High-Dimensional Spaces
Indyk, P. (2004) · Discrete Mathematics and Its Applications · doi:10.1201/9781420035315.ch39 · Cited by 207
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes
Ailon, N., & Liberty, E. (2009) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9110-x · Cited by 194
Self-citationNolan, J. P. (2002) · Cited by 178
Sampling algorithms for l2 regression and applications
Drineas, P., Mahoney, M. W., & Muthukrishnan, S. (2006) · Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 · doi:10.1145/1109557.1109682 · Cited by 172
Nearest Neighbor Queries in Metric Spaces
Clarkson, K. L. (1999) · Discrete & Computational Geometry · doi:10.1007/pl00009449 · Cited by 169
On variants of the Johnson–Lindenstrauss lemma
Matoušek, J. (2008) · Random Structures & Algorithms · doi:10.1002/rsa.20218 · Cited by 167
A replacement for Voronoi diagrams of near linear size
Har-Peled, S. (2001) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959884 · Cited by 147
An algorithm for approximate closest-point queries
Clarkson, K. L. (1994) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/177424.177609 · Cited by 133
Low-Distortion Embeddings of Finite Metric Spaces
Indyk, P., & Matoušek, J. (2004) · doi:10.1201/9781315119601-8 · Cited by 129
High-dimensional computational geometry
Motwani, R., & Indyk, P. (2000) · Cited by 125
Lower bounds for high dimensional nearest neighbor search and related problems
Borodin, A., Ostrovsky, R., & Rabani, Y. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301330 · Cited by 105
Approximate closest-point queries in high dimensions
Bern, M. W. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90222-u · Cited by 83
Approximate Nearest Neighbor Queries Revisited
Chan, T. M. (1998) · Discrete & Computational Geometry · doi:10.1007/pl00009390 · Cited by 80
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
Chakrabarti, A., & Regev, O. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.12 · Cited by 60
Dimensionality reduction techniques for proximity problems
Indyk, P. (2000) · doi:10.5555/338219.338582 · Cited by 59
Bounds for Kac's Master Equation
Diaconis, P. W., & Saloff‐Coste, L. (2000) · Communications in Mathematical Physics · doi:10.1007/s002200050036 · Cited by 57
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)
Yianilos, P. N. (2000) · doi:10.5555/338219.338273 · Cited by 26
Using stopping times to bound mixing times
Pak, I. (1999) · Cited by 3
Cited by
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM · doi:10.1145/1327452.1327494 · Cited by 1,437
Compressed sensing with coherent and redundant dictionaries
Candès, E. J., Eldar, Y. C., Needell, D., & Randall, P. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.10.002 · Cited by 898
Computational Advertising: Techniques for Targeting Relevant Ads
Woodruff, D. P. (2014) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000060 · Cited by 866
User-Friendly Tail Bounds for Sums of Random Matrices
Tropp, J. A. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9099-z · Cited by 718
Randomized Algorithms for Matrices and Data
MAHONEY, M. (2012) · Chapman & Hall/CRC Data Mining and Knowledge Discovery Series · doi:10.1201/b11822-37 · Cited by 409
Metadata
- Authors
- Ailon, N., & Chazelle, B.
- Venue
- SIAM Journal on Computing
- Published
- 2009-01
- Volume
- 39
- Issue
- 1
- Pages
- 302-322
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2093813380
- Cited by
- 479
- References
- 36
- FWCI
- 22.21
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.