The fast johnson-lindenstrauss transform and approximate nearest neighbors

SIAM Journal on Computing

Volumn 39, Issue 1, 2009, Pages 302-322

  Ailon, Nir ^a   Chazelle, Bernard ^b  

^a GOOGLE INC   (United States)

^b Princeton University   (United States)

Author keywords

Approximate nearest neighbors; Dimension reduction; Random matrices

Indexed keywords

APPROXIMATE NEAREST NEIGHBOR; APPROXIMATE NEAREST NEIGHBORS; DIMENSION REDUCTION; HEISENBERG PRINCIPLES; HYPERCUBE; LOW-DISTORTION; LOW-DISTORTION EMBEDDINGS; PROJECTION MATRIX; RANDOM MATRICES; RANDOM PROJECTIONS; SEARCH ALGORITHMS; SPEED-UP;

COMPUTATION THEORY; LEARNING ALGORITHMS;

FOURIER TRANSFORMS;

EID: 67650105330     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060673096     Document Type: Conference Paper

References (43)

1. D. ACHLIOPTAS, Database-friendly random projections: Johnson-Lindenstrauss with binary coins, J. Comput. System Sci., 66 (2003), pp. 671-687.
2. N. AILON AND E. LIBERTY, Fast dimension reduction using rademacher series on dual bch codes, Discrete Comput. Geom., to appear.
3. N. ALON, Problems and results in extremal combinatorics- I, Discrete Math., 273 (2003), pp. 31-53.
4. N. ALON AND J. SPENCER, The Probabilistic Method, 2nd ed., John Wiley and Sons, New York, 2000.
5. S. ARYA AND D. M. MOUNT, Approximate nearest neighbor queries in fixed dimensions, in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Austin, TX, ACM, New York, 1993, pp. 271-280.
6. S. ARYA, D. M. MOUNT, N. S. NETANYAHU, R. SILVERMAN, AND A. Y. Wu, An optimal algorithm for approximate nearest neighbor searching fixed dimensions, J. ACM, 45 (1998), pp. 891-923.
7. M. W. BERN, Approximate closest-point queries in high dimensions, Inform. Process. Lett., 45 (1993), pp. 95-99.
8. E. BINGHAM AND H. MANNILA, Random projection in dimensionality reduction: Applications to image and text data, in Knowledge Discovery and Data Mining, ACM, New York, 2001, pp. 245-250.
9. A. BORODIN, R. OSTROVSKY, AND Y. RABANI, Lower bounds for high dimensional nearest neighbor search and related problems, in Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (STOC), ACM, New York, 1999, pp. 312-321.
10. E. A. CARLEN, M. C. CARVALHO, AND M. LOSS, Determination of the spectral gap for Kac's master equation and related stochastic evolution, Acta Math., 191 (2003), pp. 1-54.
11. A. CHAKRABARTI AND O. REGEV, An optimal randomised cell probe lower bound for approximate nearest neighbour searching, in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, Washington, D.C., 2004, pp. 473-482.
12. T. M. CHAN, Approximate nearest neighbor queries revisited, Discrete Comput. Geom., 20 (1998), pp. 359-373.
13. K. L. CLARKSON, An algorithm for approximate closest-point queries, in Proceedings of the 10th Annual ACM Symposium on Computational Geometry (SoCG), ACM, New York, 1994, pp. 160-164.
14. K. L. CLARKSON, Nearest neighbor queries in metric spaces, Discrete Comput. Geom., 22 (1999), pp. 63-93.
15. S. DASGUPTA AND A. GUPTA, An Elementary Proof of the Johnson-Lindenstrauss Lemma, Technical report 99-006, UC Berkeley, Berkeley, CA, 1999.
16. P. DIACONIS AND L. SALOFF-COSTE, Bounds for Kac's master equation, Comm. Math. Phys., 209 (2000), pp. 729-755.
17. P. DRINEAS, M. W. MAHONEY, AND S. MUTHUKRISHNAN, Sampling algorithms for 12 regression and applications, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, 2006, pp. 1127-1136.
18. M. FARACH-COLTON AND P. INDYK, Approximate nearest neighbor algorithms for Hausdorff metrics via embeddings, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Comput. Soc. Press, Los Alamitos, CA, 1999, pp. 171-179.
19. U. FEIGE, D. PELEG, P. RAGHAVAN, AND E. UPFAL, Computing with unreliable information, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 1990, pp. 128-137.
20. P. FRANKL AND H. MAEHARA, The Johnson-Lindenstrauss lemma and the sphericity of some graphs, J. Combin. Theory Ser. B, 44 (1988), pp. 355-362.
21. S. HAR-PELED, A replacement for Voronoi diagrams of near linear size, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), Las Vegas, NV, IEEE Comput. Soc. Press, Los Alamitos, CA, 2001, pp. 94-103.
22. W. HASTINGS, Monte Carlo sampling methods using Markov chains and their applications, Biometrica, 57 (1970), pp. 95-109.
23. P. INDYK, On approximate nearest neighbors in non-Euclidean spaces, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1998, pp. 148-155.
24. P. INDYK, Dimensionality reduction techniques for proximity problems, in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, 2000, pp. 371-378.
25. P. INDYK, High-Dimensional Computational Geometry, thesis, Stanford University, Palo Alto, CA, 2000.
26. P. INDYK, Stable distributions, pseudorandom generators, embeddings and data stream computation, in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA, 2000, pp. 189-197.
27. P. INDYK, Nearest Neighbors in High-Dimensional Spaces, in Handbook of Discrete and Computational Geometry, CRC Press, Boca Raton, FL, 2004.
28. P. INDYK AND J. MATOUSEK, Low-Distortion Embeddings of Finite Metric Spaces, in Handbook of Discrete and Computational Geometry, CRC Press, Boca Raton, FL, 2004.
29. P. INDYK AND R. MOTWANI, Approximate nearest neighbors: Towards removing the curse of dimensionality, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 1998, pp. 604-613.
30. W. B. JOHNSON AND J. LINDENSTRAUSS, Extensions of Lipschitz mappings into a Hilbert space, Contemp. Math., 26 (1984), pp. 189-206.
31. M. KAC, Probability and Related Topics in Physical Science, Wiley Interscience, New York, 1959.
32. J. M. KLEINBERG, TWO algorithms for nearest-neighbor search in high dimensions, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 1997, pp. 599-608.
33. E. KUSHILEVITZ, R. OSTROVSKY, AND Y. RABANI, Efficient search for approximate nearest neighbor in high dimensional spaces, SIAM J. Comput., 30 (2000), pp. 457-474.
34. N. LINIAL, E. LONDON, AND Y. RABINOVICH, The geometry of graphs and some of its algorithmic applications, Combinatorica, 15 (1995), pp. 215-245.
35. J. MATOUSEK, Lectures on Discrete Geometry. Springer-Verlag, New York, 2002.
36. J. MATOUSEK, On variants of the Johnson-Lindenstrauss lemma, Random Structures Algorithms, 33 (2008), pp. 142-156.
37. S. MUTHUKRISHNAN AND S. C. SAHINALP, Simple and practical sequence nearest neighbors with block operations, in Lecture Notes in Comput. Sci. 2373, Springer, Berlin, 2002, pp. 262-278.
38. I. PAK, Using stopping times to bound mixing times, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 953-954.
39. C. H. PAPADIMITRIOU, P. RAGHAVAN, H. TAMAKI, AND S. VEMPALA, Latent semantic indexing: A probabilistic analysis, in Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium of Database Systems, 1998, J. Comput. System Sci., 61 (2000), pp. 217-235.
40. T. SARLÓS, Improved approximation algorithms for large matrices via random projections, in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Berkeley, CA, 2006, pp. 143-152.
41. L. SCHULMAN, Clustering for edge-cost minimization, in Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 2000, pp. 547-555.
42. P. N. YIANILOS, Data structures and algorithms for nearest neighbor search in general metric spaces, in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, 1993, pp. 311-321.
43. P. N. YIANILOS, Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract), in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, 2000, pp. 361-370.