Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
复制标题
DOI：
10.1145/1327452.1327494
复制
发表时间：
2008-01-01
影响因子：
22.7
通讯作者：
Indyk, Piotr
中科院分区：
文献类型：
--
作者：
Andoni, Alexandr;Indyk, Piotr
在本文中，我们概述了近似且最接近的邻居问题的有效算法。目的是预处理一个对象的数据集（例如，图像），以便稍后给定一个新的查询对象，一个人可以快速返回与查询最相似的数据集对象。该问题在各种区域中引起了重大兴趣。
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.