Locality-preserving hashing
In computer science, a locality preserving hashing is a hash function f that maps a point or points 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)).
 | This computer science article is a stub. You can help Wikipedia by expanding it. |