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

  • Authors:
  • Alexandr Andoni;Piotr Indyk

  • Affiliations:
  • -;Massachusetts Institute of Technology, Cambridge, MA

  • Venue:
  • Communications of the ACM - 50th anniversary issue: 1958 - 2008
  • Year:
  • 2008

Quantified Score

Hi-index 0.02

Visualization

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.