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

被引：754
作者：
Andoni, Alexandr [1 ]
Indyk, Piotr [2 ]
机构：
[1] MIT, Cambridge, MA 02139 USA
[2] MIT, Comp Sci & Artificial Intelligence Lab, Theory Computat Grp, Cambridge, MA 02139 USA
来源：
COMMUNICATIONS OF THE ACM | 2008年 / 51卷 / 01期
关键词：
D O I：
10.1145/1327452.1327494
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：117 / 122
页数：6
相关论文
共 36 条
[1]  
AILON N, 2006, P S THEOR COMPUT
[2]  
ANDONI A, 2004, E21SH EXACT EUCLIDEA
[3]  
ANDONI A, 2006, P S FDN COMP SCI
[4]   Efficient Algorithms for Substring Near Neighbor Problem [J].
Andoni, Alexandr ;
Indyk, Piotr .
PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, :1203-1212
[5]  
[Anonymous], P ANN INT C COMP MOL
[6]  
[Anonymous], P WORKSH ALG DAT STR
[7]  
[Anonymous], P S THEOR COMP
[8]  
[Anonymous], P S FDN COMP SCI
[9]  
[Anonymous], P ACM SIAM S DISCR A
[10]  
[Anonymous], 2006, Foundations of Multidimensional and Metric Data Structures
1234