LSH Forest: Practical Algorithms Made Theoretical

  title={LSH Forest: Practical Algorithms Made Theoretical},
  author={Alexandr Andoni and Ilya P. Razenshteyn and Negev Shekel Nosatzki},
We analyze LSH Forest [BCG05]—a popular heuristic for the nearest neighbor search—and show that a careful yet simple modification of it outperforms “vanilla” LSH algorithms. The end result is the first instance of a simple, practical algorithm that provably leverages data-dependent hashing to improve upon data-oblivious LSH. Here is the entire algorithm for… CONTINUE READING