Wikipedia Locality Sensitive Hashing
Locality-sensitive hashing (LSH) reduces the dimensionality of high-dimensional data. LSH hashes input items so that similar items map to the same “buckets” with high probability (the number of buckets being much smaller than the number of possible input items). LSH has much in common with data clustering and [#nearest neighbor search](nearest_neighbor_search). LSH employs random linear projections (followed by random thresholding) to map data points close in an Euclidean space to similar codes. See Also [#sparse distributed memory](/tag/sparse_distributed_memory), associative memory
12 Documents (Long List