What is locality sensitive hashing in data structure?
Answers
Answered by
0
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 universe of possible input items).
Plz Plz make my answer as brainliest answer.
Plz Plz make my answer as brainliest answer.
Answered by
0
This is the answer to your question
Attachments:
Similar questions