Approximate nearest neighbor search for low dimensional queries

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 854-867

  Har Peled, Sariel ^a   Kumar, Nirman ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

DOUBLING DIMENSIONS; LOW DIMENSIONAL; METRIC SPACES; QUERY POINTS;

NEAREST NEIGHBOR SEARCH;

EID: 79955731851     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.67     Document Type: Conference Paper

References (27)

1. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In Proc. 47th Annu. IEEE Sympos. Found. Cornput. Sci., pages 459-468, 2006. (Pubitemid 351175534)
2. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM, 51(1):117-122, 2008.
3. P. K. Agarwal and J. Matoušek. Ray shooting and parametric search. SIAM J. Comput., 22:540-570, 1993.
4. S. Arya and T. Malamatos. Linear-size approximate Voronoi diagrams. In Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pages 147-155, 2002.
5. S. Arya, T. Malamatos, and D. M. Mount. Space-time tradeoffs for approximate nearest neighbor searching. J. Assoc. Comput. Mach., 57(1):1- 54, 2009.
6. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. Assoc. Comput. Mach., 45(6), 1998.
7. n. Bull. Soc. Math. France, 111(4):429-448, 1983.
8. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to K-nearest-neighbors and n-body potential fields. J. Assoc. Comput. Mach., 42:67-90, 1995.
9. K. L. Clarkson. A randomized algorithm for closest-point queries. SIAM J. Comput., 17:830-847, 1988.
10. K. L. Clarkson. Nearest-neighbor searching and metric space dimensions. In G. Shakhnarovich, T. Darrell, and P. Indyk, editors, Nearest-Neighbor Methods for Learning and Vision: Theory and Pratice, pages 15-59. MIT Press, 2006.
11. M. de Berg, O. Cheong, M. van Kreveld, and M. H. Ovennars. Computational Geometry: Algorithms and Applications. Springer-Verlag, 3 edition, 2008.
12. L.A. Gottlieb and R. Krauthgamer. A nonlinear approach to dimension reduction. CoRR, abs/0907.5477, 2009.
13. A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In Proc. 44th Annu. IEEE Sympos. Found. Comput. Sci., pages 534-543, 2003.
14. S. Har-Peled. A replacement for Voronoi diagrams of near linear size. In Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., pages 94-103, 2001. (Pubitemid 33068370)
15. S. Har-Peled. Geometric approximation algorithms. Class notes. Online at http://3.1y/sarielnotes 2010.
16. J. Heinonen. Lectures on analysis on metric spaces. Universitext. Springer-Verlag, 2001.
17. K. Hildrum, J. Kubiatowicz, S. Ma, and S. Rao. A note on the nearest neighbor in growth-restricted metrics. In Proc. 15th ACM-SIAM Sympos. Discrete Algorithms, pages 560-561. Society for Industrial and Applied Mathematics, 2004.
18. S. Har-Peled and M. Mendel. Fast construction of nets in low dimensional metrics, and their applications. SIAM J. Comput., 35(5):1148-1184, 2006. (Pubitemid 44599922)
19. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. 30th Annu. ACM Sympos. Theory Comput., pages 604-613, 1998.
20. P. Indyk and A. Naor. Nearest neighbor preserving embeddings. ACM Trans. Algo., 2007. To appear.
21. W. B. Johnson and J. Lindenstrauss. Extensions of lipschitz mapping into hilbert space. Contemporary Mathematics, 26:189-206, 1984.
22. R. Krauthgamer and J. R. Lee. Navigating nets: simple algorithms for proximity search. In Proc. 15th ACM-SIAM Sympos. Discrete Algorithms, pages 798-807. Society for Industrial and Applied Mathematics, 2004.
23. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput., 2(30):457-474, 2000.
24. D. R. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In Proc. 34th Annu. ACM Sympos. Theory Comput., pages 741-750, 2002. (Pubitemid 35009437)
25. S. Meiser. Point location in arrangements of hyperplanes. Inform. Comput., 106:286-303, 1993.
26. R. Motwani, A. Naor, and R. Panigrahi. Lower bounds on locality sensitive hashing. In Proc. 22nd Annu. ACM Sympos. Comput. Geom., pages 154-157. ACM, 2006. (Pubitemid 44300783)
27. K. Talwar. Bypassing the embedding: algorithms for low dimensional metrics. In Proc. 36th Annu. ACM Sympos. Theory Comput., pages 281-290, 2004.