Locality preserving hashing

From Wikipedia, the free encyclopedia

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

|A-B| < |B-C| \Rightarrow |f(A) - f(B)| < |f(B) - f(C)|.
Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.