![]() |
CiteULike | ![]() |
Group: Geomatics | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Locality-Sensitive Hashing for Finding Nearest Neighbors [Lecture Notes]Signal Processing Magazine, IEEE In Signal Processing Magazine, IEEE, Vol. 25, No. 2. (2008), pp. 128-131.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThis lecture note describes a technique known as locality-sensitive hashing (LSH) that allows one to quickly find similar entries in large databases. This approach belongs to a novel and interesting class of algorithms that are known as randomized algorithms. A randomized algorithm does not guarantee an exact answer but instead provides a high probability guarantee that it will return the correct answer or one close to it. By investing additional computational effort, the probability can be pushed as high as desired.
BibTeX record
RIS record