Skip to search formSkip to main contentSkip to account menu

Locality-sensitive hashing

Known as: LSH, 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… 
Wikipedia

Related topics

Related topics

33 relations
Andrei BroderAnti-spam techniquesApproximate string matchingBag-of-words model in computer vision

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Locality-Sensitive Hashing of Curves
We study data structures for storing a set of polygonal curves in R^d such that, given a query curve, we can efficiently retrieve… 
Highly Cited
2014
Highly Cited
2014
Beyond Locality-Sensitive Hashing
We present a new data structure for the c-approximate near neighbor problem (ANN) in the Euclidean space. For n points in Rd, our… 
Highly Cited
2012
Highly Cited
2012
Efficient distributed locality sensitive hashing
Distributed frameworks are gaining increasingly widespread use in applications that process large amounts of data. One important… 
Highly Cited
2012
Highly Cited
2012
Super-Bit Locality-Sensitive Hashing
Sign-random-projection locality-sensitive hashing (SRP-LSH) is a probabilistic dimension reduction method which provides an… 
Highly Cited
2011
Highly Cited
2011
Fast locality-sensitive hashing
Locality-sensitive hashing (LSH) is a basic primitive in several large-scale data processing applications, including nearest… 
Highly Cited
2009
Highly Cited
2009
Kernelized locality-sensitive hashing for scalable image search
  • B. Kulis, K. Grauman
  • IEEE 12th International Conference on Computer…
  • 2009
  • Corpus ID: 7201154
Fast retrieval methods are critical for large-scale and data-driven vision applications. Recent work has explored ways to embed… 
Highly Cited
2008
Highly Cited
2008
Locality-Sensitive Hashing for Finding Nearest Neighbors [Lecture Notes]
This lecture note describes a technique known as locality-sensitive hashing (LSH) that allows one to quickly find similar entries… 
Highly Cited
2008
Highly Cited
2008
Locality-Sensitive Hashing for Finding Nearest Neighbors
1053-5888/08/$20.00©2008IEEE IEEE SIGNAL PROCESSING MAGAZINE [128] MARCH 2008 T he Internet has brought us a wealth of data, all… 
Highly Cited
2004
Highly Cited
2004
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under lp norm, based on p… 
Highly Cited
2003
Highly Cited
2003
Fast pose estimation with parameter-sensitive hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License