Optimal Data-Dependent Hashing for Approximate Near Neighbors

@article{Andoni2015OptimalDH,
  title={Optimal Data-Dependent Hashing for Approximate Near Neighbors},
  author={Alexandr Andoni and Ilya P. Razenshteyn},
  journal={ArXiv},
  year={2015},
  volume={abs/1501.01062}
}
We show an optimal data-dependent hashing scheme for the approximate near neighbor problem. For an n-point dataset in a d-dimensional space our data structure achieves query time O(d ⋅ nρ+o(1)) and space O(n1+ρ+o(1) + d ⋅ n), where ρ=1/(2c2-1) for the Euclidean space and approximation c>1. For the Hamming space, we obtain an exponent of ρ=1/(2c-1). Our result completes the direction set forth in (Andoni, Indyk, Nguyen, Razenshteyn 2014) who gave a proof-of-concept that data-dependent hashing… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 122 CITATIONS

Algorithms above the noise floor

VIEW 9 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Multi-Resolution Hashing for Fast Pairwise Summations

VIEW 10 EXCERPTS
CITES METHODS, RESULTS & BACKGROUND
HIGHLY INFLUENCED

Databases Theory and Applications

  • Lecture Notes in Computer Science
  • 2017
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Set Similarity Search Beyond MinHash

VIEW 6 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH

VIEW 18 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Fast Approximate near Neighbor Algorithm by Clustering in High Dimensions

  • 2015 Seventh International Conference on Knowledge and Systems Engineering (KSE)
  • 2015
VIEW 9 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2014
2019

CITATION STATISTICS

  • 18 Highly Influenced Citations

  • Averaged 25 Citations per year from 2017 through 2019