Locality-sensitive hashing scheme based on p-stable distributions (2004)
Cached
Download Links
- [www.ece.northwestern.edu]
- [www.cs.princeton.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In SCG ’04: Proceedings of the twentieth annual symposium on Computational geometry |
| Citations: | 185 - 5 self |
BibTeX
@INPROCEEDINGS{Datar04locality-sensitivehashing,
author = {Mayur Datar and Piotr Indyk},
title = {Locality-sensitive hashing scheme based on p-stable distributions},
booktitle = {In SCG ’04: Proceedings of the twentieth annual symposium on Computational geometry},
year = {2004},
pages = {253--262},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
inÇÐÓ�Ò We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem underÐÔnorm, based onÔstable distributions. Our scheme improves the running time of the earlier algorithm for the case of theÐnorm. It also yields the first known provably efficient approximate NN algorithm for the caseÔ�. We also show that the algorithm finds the exact near neigbhor time for data satisfying certain “bounded growth ” condition. Unlike earlier schemes, our LSH scheme works directly on points in the Euclidean space without embeddings. Consequently, the resulting query time bound is free of large factors and is simple and easy to implement. Our experiments (on synthetic data sets) show that the our data structure is up to 40 times faster than��-tree.
Citations
No citations identified.
