René's URL Explorer Experiment


Title: Locality-sensitive hashing - Wikipedia

Open Graph Title: Locality-sensitive hashing - Wikipedia

Generator: MediaWiki 1.46.0-wmf.16

direct link

Domain: en.wikipedia.org

Hey, it has json ld scripts: 
{"@context":"https:\/\/schema.org","@type":"Article","name":"Locality-sensitive hashing","url":"https:\/\/en.wikipedia.org\/wiki\/Locality-sensitive_hashing","sameAs":"http:\/\/www.wikidata.org\/entity\/Q1625299","mainEntity":"http:\/\/www.wikidata.org\/entity\/Q1625299","author":{"@type":"Organization","name":"Contributors to Wikimedia projects"},"publisher":{"@type":"Organization","name":"Wikimedia Foundation, Inc.","logo":{"@type":"ImageObject","url":"https:\/\/www.wikimedia.org\/static\/images\/wmf-hor-googpub.png"}},"datePublished":"2007-06-06T19:06:29Z","dateModified":"2026-01-13T08:44:08Z","headline":"method of dimension reduction in which closer items have greater probability of being mapped to the same hash bucket"}
referrerorigin-when-cross-origin
format-detectiontelephone=no
og:typewebsite

Links:

Jump to contenthttps://en.wikipedia.org/wiki/Locality-sensitive_hash#bodyContent
Main pagehttps://en.wikipedia.org/wiki/Main_Page
Contentshttps://en.wikipedia.org/wiki/Wikipedia:Contents
Current eventshttps://en.wikipedia.org/wiki/Portal:Current_events
Random articlehttps://en.wikipedia.org/wiki/Special:Random
About Wikipediahttps://en.wikipedia.org/wiki/Wikipedia:About
Contact ushttps://en.wikipedia.org/wiki/Wikipedia:Contact_us
Helphttps://en.wikipedia.org/wiki/Help:Contents
Learn to edithttps://en.wikipedia.org/wiki/Help:Introduction
Community portalhttps://en.wikipedia.org/wiki/Wikipedia:Community_portal
Recent changeshttps://en.wikipedia.org/wiki/Special:RecentChanges
Upload filehttps://en.wikipedia.org/wiki/Wikipedia:File_upload_wizard
Special pageshttps://en.wikipedia.org/wiki/Special:SpecialPages
https://en.wikipedia.org/wiki/Main_Page
Search https://en.wikipedia.org/wiki/Special:Search
Donatehttps://donate.wikimedia.org/?wmf_source=donate&wmf_medium=sidebar&wmf_campaign=en.wikipedia.org&uselang=en
Create accounthttps://en.wikipedia.org/w/index.php?title=Special:CreateAccount&returnto=Locality-sensitive+hashing
Log inhttps://en.wikipedia.org/w/index.php?title=Special:UserLogin&returnto=Locality-sensitive+hashing
Donatehttps://donate.wikimedia.org/?wmf_source=donate&wmf_medium=sidebar&wmf_campaign=en.wikipedia.org&uselang=en
Create accounthttps://en.wikipedia.org/w/index.php?title=Special:CreateAccount&returnto=Locality-sensitive+hashing
Log inhttps://en.wikipedia.org/w/index.php?title=Special:UserLogin&returnto=Locality-sensitive+hashing
(Top) https://en.wikipedia.org/wiki/Locality-sensitive_hash
1 Definitions https://en.wikipedia.org/wiki/Locality-sensitive_hash#Definitions
1.1 LSH with respect to a similarity measure https://en.wikipedia.org/wiki/Locality-sensitive_hash#LSH_with_respect_to_a_similarity_measure
1.2 Amplification https://en.wikipedia.org/wiki/Locality-sensitive_hash#Amplification
2 Applications https://en.wikipedia.org/wiki/Locality-sensitive_hash#Applications
3 Methods https://en.wikipedia.org/wiki/Locality-sensitive_hash#Methods
3.1 Bit sampling for Hamming distance https://en.wikipedia.org/wiki/Locality-sensitive_hash#Bit_sampling_for_Hamming_distance
3.2 Min-wise independent permutations https://en.wikipedia.org/wiki/Locality-sensitive_hash#Min-wise_independent_permutations
3.3 Open source methods https://en.wikipedia.org/wiki/Locality-sensitive_hash#Open_source_methods
3.3.1 Nilsimsa Hash https://en.wikipedia.org/wiki/Locality-sensitive_hash#Nilsimsa_Hash
3.3.2 TLSH https://en.wikipedia.org/wiki/Locality-sensitive_hash#TLSH
3.4 Random projection https://en.wikipedia.org/wiki/Locality-sensitive_hash#Random_projection
3.5 Stable distributions https://en.wikipedia.org/wiki/Locality-sensitive_hash#Stable_distributions
3.6 Semantic hashing https://en.wikipedia.org/wiki/Locality-sensitive_hash#Semantic_hashing
4 Algorithm for nearest neighbor search https://en.wikipedia.org/wiki/Locality-sensitive_hash#Algorithm_for_nearest_neighbor_search
4.1 Finding nearest neighbor without fixed dimensionality https://en.wikipedia.org/wiki/Locality-sensitive_hash#Finding_nearest_neighbor_without_fixed_dimensionality
4.2 Improvements https://en.wikipedia.org/wiki/Locality-sensitive_hash#Improvements
5 See also https://en.wikipedia.org/wiki/Locality-sensitive_hash#See_also
6 References https://en.wikipedia.org/wiki/Locality-sensitive_hash#References
7 Further reading https://en.wikipedia.org/wiki/Locality-sensitive_hash#Further_reading
8 External links https://en.wikipedia.org/wiki/Locality-sensitive_hash#External_links
Catalàhttps://ca.wikipedia.org/wiki/Hashing_sensible_a_la_localitat
Françaishttps://fr.wikipedia.org/wiki/Locality_sensitive_hashing
Italianohttps://it.wikipedia.org/wiki/Locality-sensitive_hashing
日本語https://ja.wikipedia.org/wiki/%E5%B1%80%E6%89%80%E6%80%A7%E9%8B%AD%E6%95%8F%E5%9E%8B%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5
Portuguêshttps://pt.wikipedia.org/wiki/Hashing_sens%C3%ADvel_%C3%A0_localidade
Русскийhttps://ru.wikipedia.org/wiki/Locality-sensitive_hashing
Edit linkshttps://www.wikidata.org/wiki/Special:EntityPage/Q1625299#sitelinks-wikipedia
Articlehttps://en.wikipedia.org/wiki/Locality-sensitive_hashing
Talkhttps://en.wikipedia.org/wiki/Talk:Locality-sensitive_hashing
Readhttps://en.wikipedia.org/wiki/Locality-sensitive_hashing
Edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit
View historyhttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=history
Readhttps://en.wikipedia.org/wiki/Locality-sensitive_hashing
Edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit
View historyhttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=history
What links herehttps://en.wikipedia.org/wiki/Special:WhatLinksHere/Locality-sensitive_hashing
Related changeshttps://en.wikipedia.org/wiki/Special:RecentChangesLinked/Locality-sensitive_hashing
Upload filehttps://en.wikipedia.org/wiki/Wikipedia:File_Upload_Wizard
Permanent linkhttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&oldid=1332698877
Page informationhttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=info
Cite this pagehttps://en.wikipedia.org/w/index.php?title=Special:CiteThisPage&page=Locality-sensitive_hashing&id=1332698877&wpFormIdentifier=titleform
Get shortened URLhttps://en.wikipedia.org/w/index.php?title=Special:UrlShortener&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FLocality-sensitive_hashing
Download QR codehttps://en.wikipedia.org/w/index.php?title=Special:QrCode&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FLocality-sensitive_hashing
Download as PDFhttps://en.wikipedia.org/w/index.php?title=Special:DownloadAsPdf&page=Locality-sensitive_hashing&action=show-download-screen
Printable versionhttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&printable=yes
Wikidata itemhttps://www.wikidata.org/wiki/Special:EntityPage/Q1625299
Locality-sensitive hashhttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hash&redirect=no
computer sciencehttps://en.wikipedia.org/wiki/Computer_science
fuzzy hashinghttps://en.wikipedia.org/wiki/Fuzzy_hashing
[1]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-MOMD-1
[1]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-MOMD-1
data clusteringhttps://en.wikipedia.org/wiki/Cluster_analysis
nearest neighbor searchhttps://en.wikipedia.org/wiki/Nearest_neighbor_search
conventional hashing techniqueshttps://en.wikipedia.org/wiki/Hash_function
hash collisionshttps://en.wikipedia.org/wiki/Hash_collision
reduce the dimensionalityhttps://en.wikipedia.org/wiki/Dimension_reduction
nearest-neighbor searchhttps://en.wikipedia.org/wiki/Nearest-neighbor_search
[2]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-2
[3]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-3
data pipelininghttps://en.wikipedia.org/wiki/Pipeline_(computing)
massively parallelhttps://en.wikipedia.org/wiki/Parallel_RAM
randomized routinghttps://en.wikipedia.org/wiki/Routing#Path_selection
universal hashinghttps://en.wikipedia.org/wiki/Universal_hashing
contentionhttps://en.wikipedia.org/wiki/Resource_contention
network congestionhttps://en.wikipedia.org/wiki/Network_congestion
[4]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-Chin1991-4
[5]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-Chin1994-5
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=1
[1]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-MOMD-1
[6]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-GIM1999-6
[7]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-IndykMotwani98-7
metric spacehttps://en.wikipedia.org/wiki/Metric_space
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=2
[8]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-Charikar2002-8
hash functionshttps://en.wikipedia.org/wiki/Hash_function
probability distributionhttps://en.wikipedia.org/wiki/Probability_distribution
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=3
[1]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-MOMD-1
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=4
[9]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-9
Hierarchical clusteringhttps://en.wikipedia.org/wiki/Hierarchical_clustering
[10]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-10
[11]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-11
Genome-wide association studyhttps://en.wikipedia.org/wiki/Genome-wide_association_study
[12]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-12
VisualRankhttps://en.wikipedia.org/wiki/VisualRank
Gene expressionhttps://en.wikipedia.org/wiki/Gene_expression
citation neededhttps://en.wikipedia.org/wiki/Wikipedia:Citation_needed
Audio similarityhttps://en.wikipedia.org/wiki/Audio_similarity
Nearest neighbor searchhttps://en.wikipedia.org/wiki/Nearest_neighbor_search
Audio fingerprinthttps://en.wikipedia.org/wiki/Audio_fingerprint
[13]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-13
Digital video fingerprintinghttps://en.wikipedia.org/wiki/Digital_video_fingerprinting
[14]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-14
Shared memoryhttps://en.wikipedia.org/wiki/Shared_memory
parallel computinghttps://en.wikipedia.org/wiki/Parallel_computing
[4]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-Chin1991-4
[5]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-Chin1994-5
[15]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-15
[16]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-16
[17]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-17
[18]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-TLSH-18
Machine learninghttps://en.wikipedia.org/wiki/Machine_learning
[19]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-NL-19
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=5
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=6
[7]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-IndykMotwani98-7
Hamming distancehttps://en.wikipedia.org/wiki/Hamming_distance
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=7
MinHashhttps://en.wikipedia.org/wiki/MinHash
Jaccard indexhttps://en.wikipedia.org/wiki/Jaccard_index
uniform distributionhttps://en.wikipedia.org/wiki/Discrete_uniform_distribution
symmetric grouphttps://en.wikipedia.org/wiki/Symmetric_group
random permutationhttps://en.wikipedia.org/wiki/Random_permutation
[20]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-Broder1998-20
[21]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-21
[22]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-Matousek2002-22
[23]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-Saks2000-23
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=8
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=9
Nilsimsa Hashhttps://en.wikipedia.org/wiki/Nilsimsa_Hash
anti-spamhttps://en.wikipedia.org/wiki/Anti-spam_techniques
[24]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-24
[25]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-25
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=10
[18]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-TLSH-18
open-source softwarehttps://en.wikipedia.org/wiki/Open-source_software
[26]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-26
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=11
Random projectionhttps://en.wikipedia.org/wiki/Random_projection
https://en.wikipedia.org/wiki/File:Cosine-distance.png
Moses Charikarhttps://en.wikipedia.org/wiki/Moses_Charikar
[8]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-Charikar2002-8
SimHashhttps://en.wikipedia.org/wiki/SimHash
[27]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-Andoni2008-27
cosine distancehttps://en.wikipedia.org/wiki/Cosine_distance
max-cuthttps://en.wikipedia.org/wiki/Maximum_cut
[8]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-Charikar2002-8
hyperplanehttps://en.wikipedia.org/wiki/Hyperplane
[8]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-Charikar2002-8
[28]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-Goemans_Williamson_1995_pp._1115–1145-28
cosine distancehttps://en.wikipedia.org/wiki/Cosine_similarity#Cosine_Distance
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=12
[29]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-DIIM04-29
stable distributionhttps://en.wikipedia.org/wiki/Stable_distribution
[30]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-PJA10-30
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=13
semantic similarityhttps://en.wikipedia.org/wiki/Semantic_similarity
[31]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-31
artificial neural networkhttps://en.wikipedia.org/wiki/Artificial_neural_network
graphical modelhttps://en.wikipedia.org/wiki/Graphical_model
citation neededhttps://en.wikipedia.org/wiki/Wikipedia:Citation_needed
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=14
nearest neighbor searchhttps://en.wikipedia.org/wiki/Nearest_neighbor_search
hash functionshttps://en.wikipedia.org/wiki/Hash_functions
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=15
binary searchhttps://en.wikipedia.org/wiki/Binary_search
[32]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-32
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=16
[33]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-33
[34]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-34
Jaccard similarityhttps://en.wikipedia.org/wiki/Jaccard_similarity
[35]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-35
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=17
Bloom filterhttps://en.wikipedia.org/wiki/Bloom_filter
Curse of dimensionalityhttps://en.wikipedia.org/wiki/Curse_of_dimensionality
Feature hashinghttps://en.wikipedia.org/wiki/Feature_hashing
Fourier-related transformshttps://en.wikipedia.org/wiki/Fourier-related_transforms
Geohashhttps://en.wikipedia.org/wiki/Geohash
Multilinear subspace learninghttps://en.wikipedia.org/wiki/Multilinear_subspace_learning
Principal component analysishttps://en.wikipedia.org/wiki/Principal_component_analysis
Random indexinghttps://en.wikipedia.org/wiki/Random_indexing
[36]https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_note-36
Rolling hashhttps://en.wikipedia.org/wiki/Rolling_hash
Singular value decompositionhttps://en.wikipedia.org/wiki/Singular_value_decomposition
Sparse distributed memoryhttps://en.wikipedia.org/wiki/Sparse_distributed_memory
Wavelet compressionhttps://en.wikipedia.org/wiki/Wavelet_compression
Locality of referencehttps://en.wikipedia.org/wiki/Locality_of_reference
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=18
ahttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-MOMD_1-0
bhttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-MOMD_1-1
chttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-MOMD_1-2
dhttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-MOMD_1-3
Ullman, J.https://en.wikipedia.org/wiki/Jeffrey_Ullman
"Mining of Massive Datasets, Ch. 3"http://infolab.stanford.edu/~ullman/mmds.html
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-2
Locality Preserving Hashinghttps://ojs.aaai.org/index.php/AAAI/article/view/9133/8992
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-3
Yang, Ming-Hsuanhttps://en.wikipedia.org/wiki/Ming-Hsuan_Yang
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1109/ICIP.2014.7025604https://doi.org/10.1109%2FICIP.2014.7025604
ISBNhttps://en.wikipedia.org/wiki/ISBN_(identifier)
978-1-4799-5751-4https://en.wikipedia.org/wiki/Special:BookSources/978-1-4799-5751-4
ISSNhttps://en.wikipedia.org/wiki/ISSN_(identifier)
1522-4880https://search.worldcat.org/issn/1522-4880
S2CIDhttps://en.wikipedia.org/wiki/S2CID_(identifier)
8024458https://api.semanticscholar.org/CorpusID:8024458
ahttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-Chin1991_4-0
bhttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-Chin1991_4-1
Complexity Issues in General Purpose Parallel Computinghttps://perma.cc/E47H-WCVP
ahttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-Chin1994_5-0
bhttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-Chin1994_5-1
"Locality-Preserving Hash Functions for General Purpose Parallel Computation"http://unclaw.com/chin/scholarship/hashfunctions.pdf
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1007/BF01185209https://doi.org/10.1007%2FBF01185209
S2CIDhttps://en.wikipedia.org/wiki/S2CID_(identifier)
18108051https://api.semanticscholar.org/CorpusID:18108051
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-GIM1999_6-0
Indyk, P.https://en.wikipedia.org/wiki/Piotr_Indyk
Motwani, R.https://en.wikipedia.org/wiki/Rajeev_Motwani
"Similarity Search in High Dimensions via Hashing"https://people.csail.mit.edu/indyk/vldb99.ps
ahttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-IndykMotwani98_7-0
bhttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-IndykMotwani98_7-1
Indyk, Piotrhttps://en.wikipedia.org/wiki/Piotr_Indyk
Motwani, Rajeevhttps://en.wikipedia.org/wiki/Rajeev_Motwani
"Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality."https://people.csail.mit.edu/indyk/nndraft.ps
Proceedings of 30th Symposium on Theory of Computinghttps://en.wikipedia.org/wiki/Symposium_on_Theory_of_Computing
ahttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-Charikar2002_8-0
bhttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-Charikar2002_8-1
chttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-Charikar2002_8-2
dhttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-Charikar2002_8-3
Charikar, Moses S.https://en.wikipedia.org/wiki/Moses_Charikar
CiteSeerXhttps://en.wikipedia.org/wiki/CiteSeerX_(identifier)
10.1.1.147.4064https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.4064
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1145/509907.509965https://doi.org/10.1145%2F509907.509965
ISBNhttps://en.wikipedia.org/wiki/ISBN_(identifier)
1-58113-495-9https://en.wikipedia.org/wiki/Special:BookSources/1-58113-495-9
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-9
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1145/1242572.1242610https://doi.org/10.1145%2F1242572.1242610
ISBNhttps://en.wikipedia.org/wiki/ISBN_(identifier)
9781595936547https://en.wikipedia.org/wiki/Special:BookSources/9781595936547
S2CIDhttps://en.wikipedia.org/wiki/S2CID_(identifier)
207163129https://api.semanticscholar.org/CorpusID:207163129
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-10
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1007/s10115-006-0027-5https://doi.org/10.1007%2Fs10115-006-0027-5
S2CIDhttps://en.wikipedia.org/wiki/S2CID_(identifier)
4613827https://api.semanticscholar.org/CorpusID:4613827
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-11
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Datahttps://jyx.jyu.fi/bitstream/123456789/46537/1/cochezmousigmod15finalcameraready.pdf
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1145/2723372.2751521https://doi.org/10.1145%2F2723372.2751521
ISBNhttps://en.wikipedia.org/wiki/ISBN_(identifier)
9781450327589https://en.wikipedia.org/wiki/Special:BookSources/9781450327589
S2CIDhttps://en.wikipedia.org/wiki/S2CID_(identifier)
14414777https://api.semanticscholar.org/CorpusID:14414777
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-12
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1093/bioinformatics/btq529https://doi.org/10.1093%2Fbioinformatics%2Fbtq529
PMChttps://en.wikipedia.org/wiki/PMC_(identifier)
3493125https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3493125
PMIDhttps://en.wikipedia.org/wiki/PMID_(identifier)
20871107https://pubmed.ncbi.nlm.nih.gov/20871107
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-13
dejavu - Audio fingerprinting and recognition in Pythonhttps://github.com/worldveil/dejavu
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-14
A Simple Introduction to Locality Sensitive Hashing (LSH)https://www.iunera.com/kraken/fabric/locality-sensitive-hashing-lsh/#7-applications-of-lsh
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-15
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1007/s00778-018-0530-9https://doi.org/10.1007%2Fs00778-018-0530-9
S2CIDhttps://en.wikipedia.org/wiki/S2CID_(identifier)
53695535https://api.semanticscholar.org/CorpusID:53695535
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-16
arXivhttps://en.wikipedia.org/wiki/ArXiv_(identifier)
1903.03129https://arxiv.org/abs/1903.03129
cs.DChttps://arxiv.org/archive/cs.DC
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-17
"MONGOOSE: A Learnable LSH Framework for Efficient Neural Network Training"https://openreview.net/forum?id=wWK7yXkULyh
ahttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-TLSH_18-0
bhttps://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-TLSH_18-1
2013 Fourth Cybercrime and Trustworthy Computing Workshophttps://www.academia.edu/7833902
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1109/CTC.2013.9https://doi.org/10.1109%2FCTC.2013.9
ISBNhttps://en.wikipedia.org/wiki/ISBN_(identifier)
978-1-4799-3076-0https://en.wikipedia.org/wiki/Special:BookSources/978-1-4799-3076-0
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-NL_19-0
arXivhttps://en.wikipedia.org/wiki/ArXiv_(identifier)
2404.05903https://arxiv.org/abs/2404.05903
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-Broder1998_20-0
Broder, A.Z.https://en.wikipedia.org/wiki/Andrei_Broder
Charikar, M.https://en.wikipedia.org/wiki/Moses_Charikar
Frieze, A.M.https://en.wikipedia.org/wiki/Alan_M._Frieze
Mitzenmacher, M.https://en.wikipedia.org/wiki/Michael_Mitzenmacher
"Min-wise independent permutations"http://www.cs.princeton.edu/~moses/papers/minwise.ps
CiteSeerXhttps://en.wikipedia.org/wiki/CiteSeerX_(identifier)
10.1.1.409.9220https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.9220
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1145/276698.276781https://doi.org/10.1145%2F276698.276781
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-21
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-Matousek2002_22-0
Matoušekhttps://en.wikipedia.org/wiki/Ji%C5%99%C3%AD_Matou%C5%A1ek_(mathematician)
"On Restricted Min-Wise Independence of Permutations"http://citeseer.ist.psu.edu/689217.html
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-Saks2000_23-0
Saks, M.https://en.wikipedia.org/wiki/Michael_Saks_(mathematician)
"Low discrepancy sets yield approximate min-wise independent permutation families"http://citeseer.ist.psu.edu/saks99low.html
CiteSeerXhttps://en.wikipedia.org/wiki/CiteSeerX_(identifier)
10.1.1.20.8264https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.8264
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1016/S0020-0190(99)00163-5https://doi.org/10.1016%2FS0020-0190%2899%2900163-5
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-24
"An Open Digest-based Technique for Spam Detection"https://spdp.di.unimi.it/papers/pdcs04.pdf
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-25
"TLSH - A Locality Sensitive Hash"https://www.academia.edu/7833902
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-26
"TLSH"https://github.com/trendmicro/tlsh
GitHubhttps://en.wikipedia.org/wiki/GitHub
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-Andoni2008_27-0
Indyk, P.https://en.wikipedia.org/wiki/Piotr_Indyk
CiteSeerXhttps://en.wikipedia.org/wiki/CiteSeerX_(identifier)
10.1.1.226.6905https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.6905
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1145/1327452.1327494https://doi.org/10.1145%2F1327452.1327494
S2CIDhttps://en.wikipedia.org/wiki/S2CID_(identifier)
6468963https://api.semanticscholar.org/CorpusID:6468963
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-Goemans_Williamson_1995_pp._1115–1145_28-0
"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming"https://doi.org/10.1145%2F227683.227684
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1145/227683.227684https://doi.org/10.1145%2F227683.227684
ISSNhttps://en.wikipedia.org/wiki/ISSN_(identifier)
0004-5411https://search.worldcat.org/issn/0004-5411
S2CIDhttps://en.wikipedia.org/wiki/S2CID_(identifier)
15794408https://api.semanticscholar.org/CorpusID:15794408
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-DIIM04_29-0
Immorlica, N.https://en.wikipedia.org/wiki/Nicole_Immorlica
Indyk, P.https://en.wikipedia.org/wiki/Piotr_Indyk
"Locality-Sensitive Hashing Scheme Based on p-Stable Distributions"http://theory.csail.mit.edu/~mirrokni/pstable.ps
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-PJA10_30-0
"Locality sensitive hashing: A comparison of hash function types and querying mechanisms"https://hal.inria.fr/inria-00567191/en/
Bibcodehttps://en.wikipedia.org/wiki/Bibcode_(identifier)
2010PaReL..31.1348Phttps://ui.adsabs.harvard.edu/abs/2010PaReL..31.1348P
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1016/j.patrec.2010.04.004https://doi.org/10.1016%2Fj.patrec.2010.04.004
S2CIDhttps://en.wikipedia.org/wiki/S2CID_(identifier)
2666044https://api.semanticscholar.org/CorpusID:2666044
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-31
"Semantic hashing"https://doi.org/10.1016%2Fj.ijar.2008.11.006
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1016/j.ijar.2008.11.006https://doi.org/10.1016%2Fj.ijar.2008.11.006
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-32
"Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality"https://theoryofcomputing.org/articles/v008a014/v008a014.pdf
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.4086/toc.2012.v008a014https://doi.org/10.4086%2Ftoc.2012.v008a014
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-33
"Fast similarity sketching."https://arxiv.org/pdf/1704.04370
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-34
"Fast locality-sensitive hashing frameworks for approximate near neighbor search."https://arxiv.org/pdf/1708.07586
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-35
^https://en.wikipedia.org/wiki/Locality-sensitive_hash#cite_ref-36
"Scaling distributional similarity to large corpora."https://aclanthology.org/P06-1046.pdf
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=19
ISBNhttps://en.wikipedia.org/wiki/ISBN_(identifier)
0-12-369446-9https://en.wikipedia.org/wiki/Special:BookSources/0-12-369446-9
Indyk, Piotrhttps://en.wikipedia.org/wiki/Piotr_Indyk
Motwani, Rajeevhttps://en.wikipedia.org/wiki/Rajeev_Motwani
Vempala, Santoshhttps://en.wikipedia.org/wiki/Santosh_Vempala
STOC '97https://en.wikipedia.org/wiki/Symposium_on_Theory_of_Computing
CiteSeerXhttps://en.wikipedia.org/wiki/CiteSeerX_(identifier)
10.1.1.50.4927https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.4927
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1145/258533.258656https://doi.org/10.1145%2F258533.258656
ISBNhttps://en.wikipedia.org/wiki/ISBN_(identifier)
978-0-89791-888-6https://en.wikipedia.org/wiki/Special:BookSources/978-0-89791-888-6
S2CIDhttps://en.wikipedia.org/wiki/S2CID_(identifier)
15693787https://api.semanticscholar.org/CorpusID:15693787
"Locality-preserving hash functions for general purpose parallel computation"http://www.unclaw.com/chin/scholarship/hashfunctions.pdf
Algorithmicahttps://en.wikipedia.org/wiki/Algorithmica
doihttps://en.wikipedia.org/wiki/Doi_(identifier)
10.1007/BF01185209https://doi.org/10.1007%2FBF01185209
S2CIDhttps://en.wikipedia.org/wiki/S2CID_(identifier)
18108051https://api.semanticscholar.org/CorpusID:18108051
edithttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&action=edit§ion=20
Alex Andoni's LSH homepagehttps://web.mit.edu/andoni/www/LSH/index.html
LSHKIT: A C++ Locality Sensitive Hashing Libraryhttps://lshkit.sourceforge.net/
A Python Locality Sensitive Hashing library that optionally supports persistence via redishttps://github.com/simonemainardi/LSHash
Caltech Large Scale Image Search Toolboxhttps://web.archive.org/web/20101203074412/http://www.vision.caltech.edu/malaa/software/research/image-search/
Slash: A C++ LSH library, implementing Spherical LSH by Terasawa, K., Tanaka, Yhttps://github.com/salviati/slash
LSHBOX: An Open Source C++ Toolbox of Locality-Sensitive Hashing for Large Scale Image Retrieval, Also Support Python and MATLAB.https://github.com/RSIA-LIESMARS-WHU/LSHBOX
SRS: A C++ Implementation of An In-memory, Space-efficient Approximate Nearest Neighbor Query Processing Algorithm based on p-stable Random Projectionhttps://github.com/DBWangGroupUNSW/SRS
TLSH open source on Githubhttps://github.com/trendmicro/tlsh
JavaScript port of TLSH (Trend Micro Locality Sensitive Hashing) bundled as node.js modulehttps://github.com/idealista/tlsh-js
Java port of TLSH (Trend Micro Locality Sensitive Hashing) bundled as maven packagehttps://github.com/idealista/tlsh
https://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&oldid=1332698877https://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&oldid=1332698877
Categorieshttps://en.wikipedia.org/wiki/Help:Category
Search algorithmshttps://en.wikipedia.org/wiki/Category:Search_algorithms
Classification algorithmshttps://en.wikipedia.org/wiki/Category:Classification_algorithms
Dimension reductionhttps://en.wikipedia.org/wiki/Category:Dimension_reduction
Hashinghttps://en.wikipedia.org/wiki/Category:Hashing
Probabilistic data structureshttps://en.wikipedia.org/wiki/Category:Probabilistic_data_structures
Articles with short descriptionhttps://en.wikipedia.org/wiki/Category:Articles_with_short_description
Short description is different from Wikidatahttps://en.wikipedia.org/wiki/Category:Short_description_is_different_from_Wikidata
All articles with unsourced statementshttps://en.wikipedia.org/wiki/Category:All_articles_with_unsourced_statements
Articles with unsourced statements from October 2013https://en.wikipedia.org/wiki/Category:Articles_with_unsourced_statements_from_October_2013
Articles with unsourced statements from September 2021https://en.wikipedia.org/wiki/Category:Articles_with_unsourced_statements_from_September_2021
Pages displaying short descriptions of redirect targets via Module:Annotated linkhttps://en.wikipedia.org/wiki/Category:Pages_displaying_short_descriptions_of_redirect_targets_via_Module:Annotated_link
Creative Commons Attribution-ShareAlike 4.0 Licensehttps://en.wikipedia.org/wiki/Wikipedia:Text_of_the_Creative_Commons_Attribution-ShareAlike_4.0_International_License
Terms of Usehttps://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Terms_of_Use
Privacy Policyhttps://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy
Wikimedia Foundation, Inc.https://wikimediafoundation.org/
Privacy policyhttps://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy
About Wikipediahttps://en.wikipedia.org/wiki/Wikipedia:About
Disclaimershttps://en.wikipedia.org/wiki/Wikipedia:General_disclaimer
Contact Wikipediahttps://en.wikipedia.org/wiki/Wikipedia:Contact_us
Legal & safety contactshttps://foundation.wikimedia.org/wiki/Special:MyLanguage/Legal:Wikimedia_Foundation_Legal_and_Safety_Contact_Information
Code of Conducthttps://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Universal_Code_of_Conduct
Developershttps://developer.wikimedia.org
Statisticshttps://stats.wikimedia.org/#/en.wikipedia.org
Cookie statementhttps://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Cookie_statement
Mobile viewhttps://en.wikipedia.org/w/index.php?title=Locality-sensitive_hashing&mobileaction=toggle_view_mobile
https://www.wikimedia.org/
https://www.mediawiki.org/
https://en.wikipedia.org/wiki/Locality-sensitive_hash
https://en.wikipedia.org/wiki/Locality-sensitive_hash
https://en.wikipedia.org/wiki/Locality-sensitive_hash
https://en.wikipedia.org/wiki/Locality-sensitive_hash
https://en.wikipedia.org/wiki/Locality-sensitive_hash
https://en.wikipedia.org/wiki/Locality-sensitive_hash
https://en.wikipedia.org/wiki/Locality-sensitive_hash
Add topic https://en.wikipedia.org/wiki/Locality-sensitive_hash

Viewport: width=1120

Robots: max-image-preview:standard

URLs of crawlers that visited me.