Locality-sensitive hashing (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Locality-sensitive hashing" in English language version.

Last modified: 09:09:17, 10 September 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2116doi.org

2^nd place

109semanticscholar.org

15^th place

8^th place

44arxiv.org

49^th place

31^st place

43mit.edu

476^th place

340^th place

41stanford.edu

194^th place

182^nd place

32academia.edu

105^th place

99^th place

22worldcat.org

4^th place

22github.com

380^th place

337^th place

22psu.edu

299^th place

159^th place

21perma.cc

low place

21unclaw.com

low place

22nih.gov

5^th place

11aaai.org

low place

6,393^rd place

11jyu.fi

6,727^th place

low place

11iunera.com

low place

11openreview.net

low place

11princeton.edu

802^nd place

528^th place

11unimi.it

9,149^th place

9,365^th place

11inria.fr

6,372^nd place

5,582^nd place

11adsabs.harvard.edu

14^th place

9^th place

11theoryofcomputing.org

low place

11aclanthology.org

low place

8,900^th place

aaai.org (Global: low place; English: 6,393^rd place)

ojs.aaai.org

Zhao, Kang; Lu, Hongtao; Mei, Jincheng (2014). Locality Preserving Hashing. AAAI Conference on Artificial Intelligence. Vol. 28. pp. 2874–2880.

academia.edu (Global: 105^th place; English: 99^th place)

Oliver, Jonathan; Cheng, Chun; Chen, Yanggui (2013). "TLSH -- A Locality Sensitive Hash". 2013 Fourth Cybercrime and Trustworthy Computing Workshop. pp. 7–13. doi:10.1109/CTC.2013.9. ISBN 978-1-4799-3076-0.
Oliver; et al. (2013). "TLSH - A Locality Sensitive Hash". 4th Cybercrime and Trustworthy Computing Workshop. Retrieved 2015-06-04.

aclanthology.org (Global: low place; English: 8,900^th place)

Gorman, James, and James R. Curran. "Scaling distributional similarity to large corpora." Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics. Association for Computational Linguistics, 2006.

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Pauleve, L.; Jegou, H.; Amsaleg, L. (2010). "Locality sensitive hashing: A comparison of hash function types and querying mechanisms". Pattern Recognition Letters. 31 (11): 1348–1358. Bibcode:2010PaReL..31.1348P. doi:10.1016/j.patrec.2010.04.004. S2CID 2666044.

arxiv.org (Global: 49^th place; English: 31^st place)

Chen, Beidi; Medini, Tharun; Farwell, James; Gobriel, Sameh; Tai, Charlie; Shrivastava, Anshumali (2020-02-29). "SLIDE: In Defense of Smart Algorithms over Hardware Acceleration for Large-Scale Deep Learning Systems". arXiv:1903.03129 [cs.DC].
Fanaee-T, Hadi (2024), Natural Learning, arXiv:2404.05903
Dahlgaard, Søren, Mathias Bæk Tejs Knudsen, and Mikkel Thorup. "Fast similarity sketching." 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2017.
Christiani, Tobias. "Fast locality-sensitive hashing frameworks for approximate near neighbor search." International Conference on Similarity Search and Applications. Springer, Cham, 2019.

doi.org (Global: 2^nd place; English: 2^nd place)

Tsai, Yi-Hsuan; Yang, Ming-Hsuan (October 2014). "Locality preserving hashing". 2014 IEEE International Conference on Image Processing (ICIP). pp. 2988–2992. doi:10.1109/ICIP.2014.7025604. ISBN 978-1-4799-5751-4. ISSN 1522-4880. S2CID 8024458.
Chin, Andrew (1994). "Locality-Preserving Hash Functions for General Purpose Parallel Computation" (PDF). Algorithmica. 12 (2–3): 170–181. doi:10.1007/BF01185209. S2CID 18108051.
Charikar, Moses S. (2002). "Similarity Estimation Techniques from Rounding Algorithms". Proceedings of the 34th Annual ACM Symposium on Theory of Computing. pp. 380–388. doi:10.1145/509907.509965. ISBN 1-58113-495-9.
Das, Abhinandan S.; et al. (2007), "Google news personalization: scalable online collaborative filtering", Proceedings of the 16th international conference on World Wide Web, pp. 271–280, doi:10.1145/1242572.1242610, ISBN 978-1-59593-654-7, S2CID 207163129.
Koga, Hisashi; Tetsuo Ishibashi; Toshinori Watanabe (2007), "Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing", Knowledge and Information Systems, 12 (1): 25–53, doi:10.1007/s10115-006-0027-5, S2CID 4613827.
Cochez, Michael; Mou, Hao (2015), "Twister Tries", Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (PDF), pp. 505–517, doi:10.1145/2723372.2751521, ISBN 978-1-4503-2758-9, S2CID 14414777.
Brinza, Dumitru; et al. (2010), "RAPID detection of gene–gene interactions in genome-wide association studies", Bioinformatics, 26 (22): 2856–2862, doi:10.1093/bioinformatics/btq529, PMC 3493125, PMID 20871107
Aluç, Güneş; Özsu, M. Tamer; Daudjee, Khuzaima (2018), "Building self-clustering RDF databases using Tunable-LSH", The VLDB Journal, 28 (2): 173–195, doi:10.1007/s00778-018-0530-9, S2CID 53695535
Oliver, Jonathan; Cheng, Chun; Chen, Yanggui (2013). "TLSH -- A Locality Sensitive Hash". 2013 Fourth Cybercrime and Trustworthy Computing Workshop. pp. 7–13. doi:10.1109/CTC.2013.9. ISBN 978-1-4799-3076-0.
Broder, A.Z.; Charikar, M.; Frieze, A.M.; Mitzenmacher, M. (1998). "Min-wise independent permutations". Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. pp. 327–336. doi:10.1145/276698.276781. Retrieved 2007-11-14.
Saks, M.; Srinivasan, A.; Zhou, S.; Zuckerman, D. (2000). "Low discrepancy sets yield approximate min-wise independent permutation families". Information Processing Letters. 73 (1–2): 29–32. doi:10.1016/S0020-0190(99)00163-5. Retrieved 2007-11-14.{{cite journal}}: CS1 maint: miscellaneous url (link)
Alexandr Andoni; Indyk, P. (2008). "Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions". Communications of the ACM. 51 (1): 117–122. doi:10.1145/1327452.1327494. S2CID 6468963.
Goemans, Michel X.; Williamson, David P. (1995). "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming". Journal of the ACM. 42 (6). Association for Computing Machinery (ACM): 1115–1145. doi:10.1145/227683.227684. ISSN 0004-5411. S2CID 15794408.
Pauleve, L.; Jegou, H.; Amsaleg, L. (2010). "Locality sensitive hashing: A comparison of hash function types and querying mechanisms". Pattern Recognition Letters. 31 (11): 1348–1358. Bibcode:2010PaReL..31.1348P. doi:10.1016/j.patrec.2010.04.004. S2CID 2666044.
Salakhutdinov, Ruslan; Hinton, Geoffrey (2008). "Semantic hashing". International Journal of Approximate Reasoning. 50 (7): 969–978. doi:10.1016/j.ijar.2008.11.006.
Har-Peled, Sariel; Indyk, Piotr; Motwani, Rajeev (2012). "Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality" (PDF). Theory of Computing. 8 (Special Issue in Honor of Rajeev Motwani): 321–350. doi:10.4086/toc.2012.v008a014. Retrieved 23 May 2025.

github.com (Global: 380^th place; English: 337^th place)

dejavu - Audio fingerprinting and recognition in Python, 2018-12-19
"TLSH". GitHub. Retrieved 2014-04-10.

inria.fr (Global: 6,372^nd place; English: 5,582^nd place)

hal.inria.fr

Pauleve, L.; Jegou, H.; Amsaleg, L. (2010). "Locality sensitive hashing: A comparison of hash function types and querying mechanisms". Pattern Recognition Letters. 31 (11): 1348–1358. Bibcode:2010PaReL..31.1348P. doi:10.1016/j.patrec.2010.04.004. S2CID 2666044.

iunera.com (Global: low place; English: low place)

A Simple Introduction to Locality Sensitive Hashing (LSH), 2025-03-27

jyu.fi (Global: 6,727^th place; English: low place)

jyx.jyu.fi

Cochez, Michael; Mou, Hao (2015), "Twister Tries", Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (PDF), pp. 505–517, doi:10.1145/2723372.2751521, ISBN 978-1-4503-2758-9, S2CID 14414777.

mit.edu (Global: 476^th place; English: 340^th place)

people.csail.mit.edu

Gionis, A.; Indyk, P.; Motwani, R. (1999). "Similarity Search in High Dimensions via Hashing". Proceedings of the 25th Very Large Database (VLDB) Conference.
Indyk, Piotr.; Motwani, Rajeev. (1998). "Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality.". Proceedings of 30th Symposium on Theory of Computing.

theory.csail.mit.edu

Datar, M.; Immorlica, N.; Indyk, P.; Mirrokni, V.S. (2004). "Locality-Sensitive Hashing Scheme Based on p-Stable Distributions". Proceedings of the Symposium on Computational Geometry.

nih.gov (Global: 5^th place; English: 5^th place)

ncbi.nlm.nih.gov

Brinza, Dumitru; et al. (2010), "RAPID detection of gene–gene interactions in genome-wide association studies", Bioinformatics, 26 (22): 2856–2862, doi:10.1093/bioinformatics/btq529, PMC 3493125, PMID 20871107

pubmed.ncbi.nlm.nih.gov

Brinza, Dumitru; et al. (2010), "RAPID detection of gene–gene interactions in genome-wide association studies", Bioinformatics, 26 (22): 2856–2862, doi:10.1093/bioinformatics/btq529, PMC 3493125, PMID 20871107

openreview.net (Global: low place; English: low place)

Chen, Beidi; Liu, Zichang; Peng, Binghui; Xu, Zhaozhuo; Li, Jonathan Lingjie; Dao, Tri; Song, Zhao; Shrivastava, Anshumali; Re, Christopher (2021), "MONGOOSE: A Learnable LSH Framework for Efficient Neural Network Training", International Conference on Learning Representation

perma.cc (Global: low place; English: low place)

Chin, Andrew (1991). Complexity Issues in General Purpose Parallel Computing (DPhil). University of Oxford. pp. 87–95.

princeton.edu (Global: 802^nd place; English: 528^th place)

cs.princeton.edu

Broder, A.Z.; Charikar, M.; Frieze, A.M.; Mitzenmacher, M. (1998). "Min-wise independent permutations". Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. pp. 327–336. doi:10.1145/276698.276781. Retrieved 2007-11-14.

psu.edu (Global: 299^th place; English: 159^th place)

citeseer.ist.psu.edu

Matoušek, J.; Stojakovic, M. (2002). "On Restricted Min-Wise Independence of Permutations". Preprint. Retrieved 2007-11-14.{{cite journal}}: CS1 maint: miscellaneous url (link)
Saks, M.; Srinivasan, A.; Zhou, S.; Zuckerman, D. (2000). "Low discrepancy sets yield approximate min-wise independent permutation families". Information Processing Letters. 73 (1–2): 29–32. doi:10.1016/S0020-0190(99)00163-5. Retrieved 2007-11-14.{{cite journal}}: CS1 maint: miscellaneous url (link)

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Tsai, Yi-Hsuan; Yang, Ming-Hsuan (October 2014). "Locality preserving hashing". 2014 IEEE International Conference on Image Processing (ICIP). pp. 2988–2992. doi:10.1109/ICIP.2014.7025604. ISBN 978-1-4799-5751-4. ISSN 1522-4880. S2CID 8024458.
Chin, Andrew (1994). "Locality-Preserving Hash Functions for General Purpose Parallel Computation" (PDF). Algorithmica. 12 (2–3): 170–181. doi:10.1007/BF01185209. S2CID 18108051.
Das, Abhinandan S.; et al. (2007), "Google news personalization: scalable online collaborative filtering", Proceedings of the 16th international conference on World Wide Web, pp. 271–280, doi:10.1145/1242572.1242610, ISBN 978-1-59593-654-7, S2CID 207163129.
Koga, Hisashi; Tetsuo Ishibashi; Toshinori Watanabe (2007), "Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing", Knowledge and Information Systems, 12 (1): 25–53, doi:10.1007/s10115-006-0027-5, S2CID 4613827.
Cochez, Michael; Mou, Hao (2015), "Twister Tries", Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (PDF), pp. 505–517, doi:10.1145/2723372.2751521, ISBN 978-1-4503-2758-9, S2CID 14414777.
Aluç, Güneş; Özsu, M. Tamer; Daudjee, Khuzaima (2018), "Building self-clustering RDF databases using Tunable-LSH", The VLDB Journal, 28 (2): 173–195, doi:10.1007/s00778-018-0530-9, S2CID 53695535
Alexandr Andoni; Indyk, P. (2008). "Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions". Communications of the ACM. 51 (1): 117–122. doi:10.1145/1327452.1327494. S2CID 6468963.
Goemans, Michel X.; Williamson, David P. (1995). "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming". Journal of the ACM. 42 (6). Association for Computing Machinery (ACM): 1115–1145. doi:10.1145/227683.227684. ISSN 0004-5411. S2CID 15794408.
Pauleve, L.; Jegou, H.; Amsaleg, L. (2010). "Locality sensitive hashing: A comparison of hash function types and querying mechanisms". Pattern Recognition Letters. 31 (11): 1348–1358. Bibcode:2010PaReL..31.1348P. doi:10.1016/j.patrec.2010.04.004. S2CID 2666044.

stanford.edu (Global: 194^th place; English: 182^nd place)

infolab.stanford.edu

Rajaraman, A.; Ullman, J. (2010). "Mining of Massive Datasets, Ch. 3".

theoryofcomputing.org (Global: low place; English: low place)

Har-Peled, Sariel; Indyk, Piotr; Motwani, Rajeev (2012). "Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality" (PDF). Theory of Computing. 8 (Special Issue in Honor of Rajeev Motwani): 321–350. doi:10.4086/toc.2012.v008a014. Retrieved 23 May 2025.

unclaw.com (Global: low place; English: low place)

Chin, Andrew (1994). "Locality-Preserving Hash Functions for General Purpose Parallel Computation" (PDF). Algorithmica. 12 (2–3): 170–181. doi:10.1007/BF01185209. S2CID 18108051.

unimi.it (Global: 9,149^th place; English: 9,365^th place)

spdp.di.unimi.it

Damiani; et al. (2004). "An Open Digest-based Technique for Spam Detection" (PDF). Retrieved 2013-09-01.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Tsai, Yi-Hsuan; Yang, Ming-Hsuan (October 2014). "Locality preserving hashing". 2014 IEEE International Conference on Image Processing (ICIP). pp. 2988–2992. doi:10.1109/ICIP.2014.7025604. ISBN 978-1-4799-5751-4. ISSN 1522-4880. S2CID 8024458.
Goemans, Michel X.; Williamson, David P. (1995). "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming". Journal of the ACM. 42 (6). Association for Computing Machinery (ACM): 1115–1145. doi:10.1145/227683.227684. ISSN 0004-5411. S2CID 15794408.

Locality-sensitive hashing (English Wikipedia)

aaai.org (Global: low place; English: 6,393rd place)

ojs.aaai.org

academia.edu (Global: 105th place; English: 99th place)

aclanthology.org (Global: low place; English: 8,900th place)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

arxiv.org (Global: 49th place; English: 31st place)

doi.org (Global: 2nd place; English: 2nd place)

github.com (Global: 380th place; English: 337th place)

inria.fr (Global: 6,372nd place; English: 5,582nd place)

hal.inria.fr

iunera.com (Global: low place; English: low place)

jyu.fi (Global: 6,727th place; English: low place)

jyx.jyu.fi

mit.edu (Global: 476th place; English: 340th place)

people.csail.mit.edu

theory.csail.mit.edu

nih.gov (Global: 5th place; English: 5th place)

ncbi.nlm.nih.gov

pubmed.ncbi.nlm.nih.gov

openreview.net (Global: low place; English: low place)

perma.cc (Global: low place; English: low place)

princeton.edu (Global: 802nd place; English: 528th place)

cs.princeton.edu

psu.edu (Global: 299th place; English: 159th place)

citeseer.ist.psu.edu

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

stanford.edu (Global: 194th place; English: 182nd place)

infolab.stanford.edu

theoryofcomputing.org (Global: low place; English: low place)

unclaw.com (Global: low place; English: low place)

unimi.it (Global: 9,149th place; English: 9,365th place)

spdp.di.unimi.it

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

aaai.org (Global: low place; English: 6,393^rd place)

academia.edu (Global: 105^th place; English: 99^th place)

aclanthology.org (Global: low place; English: 8,900^th place)

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

doi.org (Global: 2^nd place; English: 2^nd place)

github.com (Global: 380^th place; English: 337^th place)

inria.fr (Global: 6,372^nd place; English: 5,582^nd place)

jyu.fi (Global: 6,727^th place; English: low place)

mit.edu (Global: 476^th place; English: 340^th place)

nih.gov (Global: 5^th place; English: 5^th place)

princeton.edu (Global: 802^nd place; English: 528^th place)

psu.edu (Global: 299^th place; English: 159^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

stanford.edu (Global: 194^th place; English: 182^nd place)

unimi.it (Global: 9,149^th place; English: 9,365^th place)

worldcat.org (Global: 4^th place; English: 4^th place)