Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions

@article{Andoni2006NearOptimalHA,
  title={Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions},
  author={Alexandr Andoni and P. Indyk},
  journal={2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)},
  year={2006},
  pages={459-468}
}
  • Alexandr Andoni, P. Indyk
  • Published 2006
  • Mathematics, Computer Science
  • 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn 1c2/+o(1)) and space O(dn + n1+1c2/+o(1)). This almost matches the lower bound for hashing-based algorithm recently obtained in (R. Motwani et al., 2006). We also obtain a space-efficient version of the algorithm, which uses dn+n logO(1) n space, with a query time of dnO(1/c2). Finally, we discuss practical variants of the algorithms that utilize fast bounded… Expand
1,225 Citations
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
  • 995
  • PDF
Optimal Data-Dependent Hashing for Approximate Near Neighbors
  • 190
  • PDF
Beyond Locality-Sensitive Hashing
  • 125
  • PDF
Adaptive Estimation for Approximate k-Nearest-Neighbor Computations
  • 6
  • PDF
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
  • 7
  • Highly Influenced
  • PDF
Approximate Nearest Neighbor Search for a Dataset of Normalized Vectors
  • 2
  • Highly Influenced
  • PDF
Locality-Sensitive Hashing for Chi2 Distance
  • 73
  • PDF
Optimal Load Factor for Approximate Nearest Neighbor Search under Exact Euclidean Locality Sensitive Hashing
  • 3
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
Entropy-based nearest neighbor algorit hm n high dimensions
  • Proceedings of the ACM-SIAM Symposium on Discrete Algorithms
  • 2006
E2lsh: Exact Euclidean localitysensitive hashing. http://web.mit.edu/andoni/www/LSH
  • 2004