Wikitopia
Locality Sensitive Hashing
conceptAlgorithm
Try in Playground →
Overview
Developed byPiotr Indyk and Rajeev Motwani
Founded1998
Use caseapproximate nearest neighbor search in high-dimensional spaces
Knowledge graph stats
Claims36
Avg confidence90%
Avg freshness99%
Last updatedUpdated 5 days ago
WikidataQ1641203
Trust distribution
100% unverified
Governance
Not assessed
Contribute governance data →

Locality Sensitive Hashing

concept

Algorithmic technique that hashes similar input items into the same buckets with high probability.

Compare with...

developed by

ValueTrustConfidenceFreshnessSources
Piotr Indyk and Rajeev Motwani○UnverifiedHighFresh1

primary use case

ValueTrustConfidenceFreshnessSources
approximate nearest neighbor search in high-dimensional spaces○UnverifiedHighFresh1
approximate nearest neighbor search○UnverifiedHighFresh1
similarity search in large datasets○UnverifiedHighFresh1
dimensionality reduction for high-dimensional data○UnverifiedHighFresh1
similarity search and clustering of documents○UnverifiedModerateFresh1
duplicate detection in large datasets○UnverifiedModerateFresh1
deduplication and clustering○UnverifiedModerateFresh1
recommendation systems and information retrieval○UnverifiedModerateFresh1

founded year

ValueTrustConfidenceFreshnessSources
1998○UnverifiedHighFresh1

alternative to

ValueTrustConfidenceFreshnessSources
exhaustive k-nearest neighbors search○UnverifiedHighFresh1
brute force nearest neighbor search○UnverifiedHighFresh1
exact nearest neighbor search○UnverifiedHighFresh1
k-d trees○UnverifiedModerateFresh1
tree-based nearest neighbor methods○UnverifiedModerateFresh1

supports protocol

ValueTrustConfidenceFreshnessSources
Hamming distance○UnverifiedHighFresh1
Jaccard similarity○UnverifiedHighFresh1
cosine similarity○UnverifiedModerateFresh1

supports model

ValueTrustConfidenceFreshnessSources
MinHash for Jaccard similarity○UnverifiedHighFresh1
random projection for Euclidean distance○UnverifiedModerateFresh1

based on

ValueTrustConfidenceFreshnessSources
probabilistic hashing techniques○UnverifiedHighFresh1
probabilistic dimension reduction techniques○UnverifiedModerateFresh1

implemented by

ValueTrustConfidenceFreshnessSources
Apache Spark MLlib○UnverifiedHighFresh1
scikit-learn○UnverifiedModerateFresh1

integrates with

ValueTrustConfidenceFreshnessSources
machine learning frameworks○UnverifiedModerateFresh1
Apache Spark MLlib○UnverifiedModerateFresh1

Alternatives & Similar Tools

exhaustive k-nearest neighbors search
alternative to
Compare →
brute force nearest neighbor search
alternative to
Compare →
exact nearest neighbor search
alternative to
Compare →
k-d trees
alternative to
Compare →
tree-based nearest neighbor methods
alternative to
Compare →

Commonly Used With

machine learning frameworksApache Spark MLlib

Related entities

Claim count: 36Last updated: 4/5/2026Edit history