FAQ

Locality-sensitive hashing

Known as: 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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1992-2018
05010015019922018

Related topics

Related topics

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

Related mentions per year

Related mentions per year

1937-2018
1960198020002020
Locality-sensitive hashing
Cryptography
Cluster analysis
Principal component analysis
Open-source software
Hash function

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 IR such that, given a query curve, we can efficiently retrieve… (More)
  • table 1
Is this relevant?
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 R, our… (More)
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Kernelized Locality-Sensitive Hashing
Fast retrieval methods are critical for many large-scale and data-driven vision applications. Recent work has explored ways to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Locality-Sensitive Hashing for Chi2 Distance
In the past 10 years, new powerful algorithms based on efficient data structures have been proposed to solve the problem of… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • table 1
Is this relevant?
2011
2011
Fast locality-sensitive hashing
Locality-sensitive hashing (LSH) is a basic primitive in several large-scale data processing applications, including nearest… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Kernelized locality-sensitive hashing for scalable image search
Fast retrieval methods are critical for large-scale and data-driven vision applications. Recent work has explored ways to embed… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
A posteriori multi-probe locality sensitive hashing
Efficient high-dimensional similarity search structures are essential for building scalable content-based search systems on… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Lower bounds on locality sensitive hashing
Given a metric space <i>(X,d<sub>X</sub>)</i>, <i>c</i>&#8805;1, <i>r</i>&gt;0, and <i>p,q</i> &#8801; [0,1], a distribution over… (More)
Is this relevant?
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 <i>l</i><sub>p</sub> norm… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Efficient large-scale sequence comparison by locality-sensitive hashing
MOTIVATION Comparison of multimegabase genomic DNA sequences is a popular technique for finding and annotating conserved genome… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?