Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,289 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Andrei Broder
Anti-spam techniques
Approximate string matching
Bag-of-words model in computer vision
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Fast Graph Similarity Search via Locality Sensitive Hashing
Boyu Zhang
,
Xianglong Liu
,
B. Lang
Pacific Rim Conference on Multimedia
2015
Corpus ID: 30607929
Similarity search in graph databases has been widely studied in graph query processing in recent years. With the fast…
Expand
2014
2014
Data-Dependent Locality Sensitive Hashing
Hongtao Xie
,
Zhineng Chen
,
Yizhi Liu
,
Jianlong Tan
,
Li Guo
Pacific Rim Conference on Multimedia
2014
Corpus ID: 9358832
Locality sensitive hashing LSH is the most popular algorithm for approximate nearest neighbor ANN search. As LSH partitions…
Expand
2013
2013
Distribution-Aware Locality Sensitive Hashing
Lei Zhang
,
Yongdong Zhang
,
Dongming Zhang
,
Q. Tian
Conference on Multimedia Modeling
2013
Corpus ID: 14251957
Locality Sensitive Hashing (LSH) has been popularly used in content-based search systems. There exist two main categories of LSH…
Expand
2012
2012
Boundary-expanding locality sensitive hashing
Qiang Wang
,
Zhiyuan Guo
,
Gang Liu
,
Jun Guo
International Symposium on Chinese Spoken…
2012
Corpus ID: 18382935
Locality sensitive hashing (LSH) has been introduced as an indexing structure for fast large-scale data retrieval. A significant…
Expand
2012
2012
Entropy based locality sensitive hashing
Qiang Wang
,
Zhiyuan Guo
,
Gang Liu
,
Jun Guo
IEEE International Conference on Acoustics…
2012
Corpus ID: 1628377
Nearest neighbor problem has recently been a research focus, especially on large amounts of data. Locality sensitive hashing (LSH…
Expand
2011
2011
Similarity Join Size Estimation using Locality Sensitive Hashing
Hongrae Lee
,
R. Ng
,
Kyuseok Shim
Proceedings of the VLDB Endowment
2011
Corpus ID: 1171823
Similarity joins are important operations with a broad range of applications. In this paper, we study the problem of vector…
Expand
Highly Cited
2010
Highly Cited
2010
Cost-sensitive subspace learning for face recognition
Jiwen Lu
,
Yap-Peng Tan
IEEE Computer Society Conference on Computer…
2010
Corpus ID: 10332685
Conventional subspace learning-based face recognition aims to attain low recognition errors and assumes same loss from all…
Expand
2010
2010
Efficient Incremental Near Duplicate Detection Based on Locality Sensitive Hashing
M. Fisichella
,
Fan Deng
,
W. Nejdl
International Conference on Database and Expert…
2010
Corpus ID: 12961784
In this paper, we study the problem of detecting near duplicates for high dimensional data points in an incremental manner. For…
Expand
2010
2010
Distributed Locality Sensitivity Hashing
Smita Wadhwa
,
Pawan Gupta
7th IEEE Consumer Communications and Networking…
2010
Corpus ID: 3013405
In this paper, we present DLSH Distributed Locality Sensitive Hashing, a similar-data search technology. The huge growth in the…
Expand
2009
2009
Finding similar acoustic events using matching pursuit and locality-sensitive hashing
Courtenay V. Cotton
,
D. Ellis
IEEE Workshop on Applications of Signal…
2009
Corpus ID: 6756202
There are many applications for the ability to find repetitions of perceptually similar sound events in generic audio recordings…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required