局所性鋭敏型ハッシュ
1. Locality-sensitive hashingLocality-sensitive hashing (LSH) is a method of performing probabilistic dimension reduction of high-dimensional data. The basic idea is to hash the input items so that similar items are mapped to the same buckets with high probability (the number of buckets being much smaller than the universe of possible input items). Note how locality-sensitive hashing, in many ways, mirrors data clustering.
Read “Locality-sensitive hashing” on English Wikipedia
Read “局所性鋭敏型ハッシュ” on Japanese Wikipedia
Read “Locality-sensitive hashing” on DBpedia
Read “Locality-sensitive hashing” on English Wikipedia
Read “局所性鋭敏型ハッシュ” on Japanese Wikipedia
Read “Locality-sensitive hashing” on DBpedia
Discussions
Log in to talk about this word.