Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions

Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions (2008)

Cached

Download Links

by Alexandr Andoni , Piotr Indyk

Citations:

BibTeX

@MISC{Andoni08near-optimalhashing,
    author = {Alexandr Andoni and Piotr Indyk},
    title = {Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions },
    year = {2008}
}

Bookmark

OpenURL

Abstract

In this article, we give an overview of efficient algorithms for the approximate and exact nearest neighbor problem. The goal is to preprocess a dataset of objects (e.g., images) so that later, given a new query object, one can quickly return the dataset object that is most similar to the query. The problem is of significant interest in a wide variety of areas.

Citations

911	Multidimensional binary search trees used for associative searching - Bentley - 1975
773	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming - Goemans, Williamson - 1995
634	An optimal algorithm for approximate nearest neighbor searching fixed dimensions - Arya, Mount, et al. - 1998
533	Approximate nearest neighbors: Towards removing the curse of dimensionality - Indyk, Motwani - 1998
376	The geometry of graphs and some of its algorithmic applications - Linial, London, et al. - 1995
346	Syntactic clustering of the web - Broder, Glassman, et al. - 1997
319	Sphere packings, Lattices and groups - Conway, Sloane - 1993
275	R.: Similarity search in high dimensions via hashing - Gionis, Indyk, et al. - 1999
254	On the resemblance and containment of documents - Broder - 1997
242	Introduction to Algorithms. 2nd ed - Cormen, Leiserson, et al. - 2001
220	The Volume of Convex Bodies and Banach Space Geometry - Pisier - 1999
185	Locality-sensitive hashing scheme based on p-stable distributions - Datar, Indyk - 2004
174	Finding motifs using random projections - Buhler, Tompa - 2002
173	Efficient search for approximate nearest neighbor in high dimensional spaces - Kushilevitz, Ostrovsky, et al.
154	Approximate graph coloring by semidefinite programming - Karger, Motwani, et al. - 1994
151	Min-wise Independent Permutations - Broder, Charikar, et al. - 1998
150	Two algorithms for nearest-neighbor search in high dimensions - Kleinberg - 1997
150	Foundations of Multidimensional and Metric Data Structures - Samet - 2006
105	Navigating Nets: Simple Algorithms for Proximity Search - Krauthgamer, Lee - 2004
80	Flash: a fast look-up algorithm for string homology - Califano, Rigoutsos - 1993
77	A replacement for Voronoi diagrams of near linear size - Har-Peled - 2001
73	Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform - Ailon, Chazelle - 2006
72	Approximating a finite metric by a small number of tree metrics - Charikar, Chekuri, et al. - 1998
63	Nearest neighbors in high-dimensional spaces - Indyk - 2004
56	Efficient large-scale sequence comparison by locality-sensitive hashing - Buhler
52	High-Dimensional Computational Geometry - Indyk - 2000
37	On the optimality of the random hyperplane rounding technique for max cut - Feige, Schechtman
31	Randomized algorithms and nlp: Using locality sensitive hash functions for high speed noun clustering - Ravichandran, Pantel, et al. - 2005
26	Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice - Conway, Sloane - 1986
25	Multi-index hashing for information retrieval - Greene, Parnas, et al. - 1994
21	An optimal randomised cell probe lower bound for approximate nearest neighbour searching - Chakrabarti, Regev - 2004
13	On the optimality of the dimensionality reduction method - Andoni, Indyk, et al.
13	Better algorithms for high-dimensional proximity problems via asymmetric embeddings - Indyk
12	Similarity estimation techniques from rounding - Charikar
11	Notes on sphere packings - Leech - 1967
10	Lower bounds on locality sensitive hashing - Motwani, Naor, et al. - 2006
9	Efficient algorithms for substring near neighbor problem, in Proc. 17th Annu. 6 We inspect about 80000 pairs for c = 0.8, 500000 pairs for c = 1.0, and 120000000 pairs for c = 2.0. For c = 3.6 the number of pairs is too large for the computation to finish - Andoni, Indyk
9	The bit vector intersection problem - Karp, Waarts, et al. - 1995
8	Generalized minimum distance decoding of euclidean-space codes and lattices - Vardy - 1992
8	Coresets for k-means and k-medians and their applications - Har-Peled, Mazumdar - 2004
6	The light bulb problem - PATURI, RAJASEKARAN, et al. - 1995
5	Entropy-based nearest neighbor algorithm in high dimensions - Panigrahy
5	Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere - Terasawa, Tanaka - 2007
3	E cient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code - Amrani, Be'ery - 1996
3	E2lsh: Exact Euclidean localitysensitive hashing. http://web.mit.edu/andoni/www/LSH - Andoni, Indyk - 2004
3	Approximate algorithms for highdimensional geometric problems - Indyk - 2001
2	The Leech lattice and the Golay code: Bounded-distance decoding and multilevel constructions - Tilborg - 1994
2	Scalable techniques for clustering the web. WebDB Workshop - Haveliwala, Gionis, et al. - 2000
1	Scalable parti - tioning and exploration of chemical spaces using geometric hashing - Dutta, Guha, et al. - 2006