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 (opens in a new tab)

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
On fast bounded locality sensitive hashing
In this paper, we examine the hash functions expressed as scalar products, i.e., $f(x)= $, for some bounded random vector $v… 
2015
2015
Hierarchical clustering of large text datasets using Locality-Sensitive Hashing
In this paper, we present a hierarchical clustering algorithm of the large text datasets using Locality-Sensitive Hashing (LSH… 
2014
2014
Globality-Locality Preserving Projections for Biometric Data Dimensionality Reduction
In a biometric recognition task, the manifold of data is the result of the interactions between the sub-manifold of dynamic… 
2013
2013
Distribution-Aware Locality Sensitive Hashing
Locality Sensitive Hashing (LSH) has been popularly used in content-based search systems. There exist two main categories of LSH… 
2012
2012
Entropy based locality sensitive hashing
Nearest neighbor problem has recently been a research focus, especially on large amounts of data. Locality sensitive hashing (LSH… 
2012
2012
Boundary-expanding locality sensitive hashing
Locality sensitive hashing (LSH) has been introduced as an indexing structure for fast large-scale data retrieval. A significant… 
Review
2012
Review
2012
Locality-Sensitive Hashing Techniques for Nearest Neighbor Search
When the volume of data grows big, some simple tasks could become a significant concern. Nearest neighbor search is such a task… 
2011
2011
Similarity Join Size Estimation using Locality Sensitive Hashing
Similarity joins are important operations with a broad range of applications. In this paper, we study the problem of vector… 
2010
2010
Efficient Incremental Near Duplicate Detection Based on Locality Sensitive Hashing
In this paper, we study the problem of detecting near duplicates for high dimensional data points in an incremental manner. For… 
2008
2008
Efficient Query-by-Content Audio Retrieval by Locality Sensitive Hashing and Partial Sequence Comparison
This paper investigates suitable indexing techniques to enable efficient content-based audio retrieval in large acoustic…