Jump to content

Locality-preserving hashing

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by BetacommandBot (talk | contribs) at 09:34, 29 September 2006 (Removing from Category:Searching algorithms). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer science, a locality preserving hashing is a hash function f that maps a point in a multidimensional coordinate space to a scalar value, such that if we have three points A, B and C such that distance(A, B) < distance(B, C), then abs(f(A) − f(B)) < abs(f(B) − f(C)).

Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Locality-preserving_hashing&oldid=78472215"