Locality preserving hashing

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 : $|A-B| < |B-C| Rightarrow |f(A) - f(B)| < |f(B) - f(C)|$ .

Игры ⚽ Нужно решить контрольную?

Z-order (curve) — Z order, or Morton order, first proposed in 1966 by G. M. Morton, [citation|first=G. M.|last=Morton|title=A computer Oriented Geodetic Data Base; and a New Technique in File Sequencing|series=Technical Report|publisher=IBM Ltd.|location=Ottawa,… … Wikipedia
Z-order curve — Not to be confused with Z curve or Z order. Four iterations of the Z order curve … Wikipedia
Distributed hash table — A distributed hash table (DHT) is a class of a decentralized distributed system that provides a lookup service similar to a hash table; (key, value) pairs are stored in a DHT, and any participating node can efficiently retrieve the value… … Wikipedia
Collaborative filtering — (CF) is the process of filtering for information or patterns using techniques involving collaboration among multiple agents, viewpoints, data sources, etc. Applications of collaborative filtering typically involve very large data sets.… … Wikipedia

Academic Dictionaries and Encyclopedias