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

@article{citeulike:2877759, 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.}, address = {New York, NY, USA}, author = {Andoni, Alexandr and Indyk, Piotr}, citeulike-article-id = {2877759}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1327452.1327494}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1327452.1327494}, doi = {10.1145/1327452.1327494}, issn = {0001-0782}, journal = {Commun. ACM}, keywords = {approximate\_nearest\_neighborhood, knn, lsh}, month = {January}, number = {1}, pages = {117--122}, posted-at = {2009-10-26 03:28:43}, priority = {3}, publisher = {ACM}, title = {Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions}, url = {http://dx.doi.org/10.1145/1327452.1327494}, volume = {51}, year = {2008} }

TY - JOUR ID - citeulike:2877759 L3 - citeulike-article-id:2877759 N2 - 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. IS - 1 JF - Commun. ACM SN - 0001-0782 AD - New York, NY, USA EP - 122 TI - Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions PB - ACM VL - 51 SP - 117 KW - approximate_nearest_neighborhood KW - knn KW - lsh AU - Andoni, Alexandr AU - Indyk, Piotr PY - 2008/01// UR - http://dx.doi.org/10.1145/1327452.1327494 ER -