Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Massachusetts Institute of Technology
Indexed incrossref
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.
Citation impact
1,455
total citations
- FWCI
- 84.47
- Percentile
- 100%
- References
- 55
Citations per year
Authors
2Topics & keywords
Topics
Keywords
- k-nearest neighbors algorithm
- Hash function
- Computer science
- Nearest neighbor search
- Object (grammar)
- Variety (cybernetics)
- Best bin first
- Algorithm
No related works found for this paper.