Fetching the paper…
Reading the bibliography…
Finding nearest neighbors in high-dimensional spaces is a fundamental operation in many diverse application domains.
Streaming similarity search over one billion tweets using parallel locality-sensitive hashing
Narayanan Sundaram, Aizana Turmukhametova, Nadathur Satish, Todd Mostak, Piotr Indyk, Samuel Madden, and Pradeep Dubey. 2013 · 1941
Earlier work this paper cites.
Batch-orthogonal locality-sensitive hashing for angular similarity
Jianqiu Ji, Shuicheng Yan, Jianmin Li, Guangyu Gao, Qi Tian, and Bo Zhang. 2014 · 1974
Earlier work this paper cites.
Multidimensional binary search trees used for associative searching
Jon Louis Bentley. 1975 · 1975
Earlier work this paper cites.
Scalable content-based music retrieval using chord progression histogram and tree-structure LSH
Yi Yu, Roger Zimmermann, Ye Wang, and Vincent Oria. 2013b · 1981
Earlier work this paper cites.
The SR-tree: An index structure for high-dimensional nearest neighbor queries
Norio Katayama and Shin’ichi Satoh. 1997 · 1997
Earlier work this paper cites.
Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the thirtieth annual ACM symposium on Theory of computing . 604–613
Piotr Indyk and Rajeev Motwani. 1998 · 1998
Earlier work this paper cites.
Similarity search in high dimensions via hashing. In Vldb , Vol. 99. 518–529
Aristides Gionis, Piotr Indyk, Rajeev Motwani, et al · 1999
Earlier work this paper cites.
Min-wise independent permutations
Andrei Z Broder, Moses Charikar, Alan M Frieze, and Michael Mitzenmacher. 2000 · 2000
Earlier work this paper cites.
Efficient large-scale sequence comparison by locality-sensitive hashing
Jeremy Buhler. 2001 · 2001
Earlier work this paper cites.
Searching in metric spaces
Edgar Chávez, Gonzalo Navarro, Ricardo Baeza-Yates, and José Luis Marroquín. 2001 · 2001
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing . 380–388
Moses S Charikar. 2002 · 2002
Earlier work this paper cites.
Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the twentieth annual symposium on Computational geometry . 253–262
Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab S Mirrokni. 2004 · 2004
Earlier work this paper cites.
LSH forest: self-tuning indexes for similarity search. In Proceedings of the 14th international conference on World Wide Web . 651–660
Mayank Bawa, Tyson Condie, and Prasanna Ganesan. 2005 · 2005
Earlier work this paper cites.
Entropy based nearest neighbor search in high dimensions
Rina Panigrahy. 2005 · 2005
Earlier work this paper cites.
Randomized algorithms and NLP: Using locality sensitive hash functions for high speed noun clustering. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL’05) . 622–629
Deepak Ravichandran, Patrick Pantel, and Eduard Hovy. 2005 · 2005
Earlier work this paper cites.
Incremental ransac for online relocation in large dynamic environments. In Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. IEEE, 68–75
Kanji Tanaka and Eiji Kondo. 2006 · 2006
Earlier work this paper cites.
Scalable near identical image and shot detection. In Proceedings of the 6th ACM international conference on Image and video retrieval . 549–556
Ondřej Chum, James Philbin, Michael Isard, and Andrew Zisserman. 2007 · 2007
Earlier work this paper cites.
Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing
Hisashi Koga, Tetsuo Ishibashi, and Toshinori Watanabe. 2007 · 2007
Earlier work this paper cites.
Multi-probe LSH: efficient indexing for high-dimensional similarity search. In 33rd International Conference on Very Large Data Bases, VLDB 2007 . Association for Computing Machinery, Inc, 950–961
Qin Lv, William Josephson, Zhe Wang, Moses Charikar, and Kai Li. 2007 · 2007
Earlier work this paper cites.
Distributed Multi-Probe LSH : Tackling Real World Data
A. Patil. 2007 · 2007
Earlier work this paper cites.
A learning framework for nearest neighbor search. In Advances in Neural Information Processing Systems . 233–240
Lawrence Cayton and Sanjoy Dasgupta. 2008 · 2008
Earlier work this paper cites.
A Semantic Search Model based on Locality-sensitive Hashing in mobile P2P. In 2008 10th International Conference on Advanced Communication Technology , Vol. 3. IEEE, 1635–1640
Xiang-song Hou, Cao Yuan-da, and Zhi-tao Guan. 2008 · 2008
Earlier work this paper cites.
Query adaptative locality sensitive hashing. In 2008 IEEE International Conference on Acoustics, Speech and Signal Processing . IEEE, 825–828
Hervé Jégou, Laurent Amsaleg, Cordelia Schmid, and Patrick Gros. 2008 · 2008
Earlier work this paper cites.
A posteriori multi-probe locality sensitive hashing. In Proceedings of the 16th ACM international conference on Multimedia . 209–218
Alexis Joly and Olivier Buisson. 2008 · 2008
Earlier work this paper cites.
Query by humming of midi and audio using locality sensitive hashing. In 2008 IEEE International Conference on Acoustics, Speech and Signal Processing . IEEE, 2249–2252
Matti Ryynanen and Anssi Klapuri. 2008 · 2008
Earlier work this paper cites.
A scalable localization algorithm for high dimensional features and multi robot systems. In 2008 IEEE International Conference on Networking, Sensing and Control . IEEE, 920–925
Kanji Tanaka and Eiji Kondo. 2008 · 2008
Earlier work this paper cites.
Distributed similarity search in high dimensions using locality sensitive hashing. In Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology . 744–755
Parisa Haghani, Sebastian Michel, and Karl Aberer. 2009 · 2009
Earlier work this paper cites.
Kernelized locality-sensitive hashing for scalable image search. In 2009 IEEE 12th international conference on computer vision . IEEE, 2130–2137
Brian Kulis and Kristen Grauman. 2009 · 2009
Earlier work this paper cites.
Lsh-ransac: An incremental scheme for scalable localization. In 2009 IEEE International Conference on Robotics and Automation . IEEE, 3523–3530
Kenichi Saeki, Kanji Tanaka, and Takeshi Ueda. 2009 · 2009
Earlier work this paper cites.
Efficient incremental near duplicate detection based on locality sensitive hashing. In International Conference on Database and Expert Systems Applications . Springer, 152–166
Marco Fisichella, Fan Deng, and Wolfgang Nejdl. 2010 · 2010
Earlier work this paper cites.
Online generation of locality sensitive hash signatures. In Proceedings of the ACL 2010 conference short papers . 231–235
Benjamin Van Durme and Ashwin Lall. 2010 · 2010
Earlier work this paper cites.
Combining multi-probe histogram and order-statistics based lsh for scalable audio content retrieval. In Proceedings of the 18th ACM international conference on Multimedia . 381–390
Yi Yu, Michel Crucianu, Vincent Oria, and Ernesto Damiani. 2010 · 2010
Earlier work this paper cites.
Data-oriented locality sensitive hashing. In Proceedings of the 18th ACM international conference on Multimedia . 1131–1134
Wei Zhang, Ke Gao, Yong-dong Zhang, and Jin-tao Li. 2010 · 2010
Earlier work this paper cites.
Locality sensitive hashing for sampling-based algorithms in association rule mining
Chyouhwa Chen, Shi-Jinn Horng, and Chin-Pin Huang. 2011 · 2011
Earlier work this paper cites.
Fast locality-sensitive hashing. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining . 1073–1081
Anirban Dasgupta, Ravi Kumar, and Tamás Sarlós. 2011 · 2011
Earlier work this paper cites.
A content-based music similarity retrieval scheme by using BoW representation and LSH-based retrieval
Byeong-jun Han, Hyunwoo Kim, Ziwon Hyung, Kyogu Lee, and Sheayun Lee. 2011 · 2011
Earlier work this paper cites.
Semi-supervised simhash for efficient document similarity search. In Proceedings of the 49th annual meeting of the association for computational linguistics: Human language technologies . 93–101
Qixia Jiang and Maosong Sun. 2011 · 2011
Earlier work this paper cites.
Kernelized locality-sensitive hashing
Brian Kulis and Kristen Grauman. 2011 · 2011
Earlier work this paper cites.
Bayesian locality sensitive hashing for fast similarity search
Venu Satuluri and Srinivasan Parthasarathy. 2011 · 2011
Earlier work this paper cites.
Probabilistic near-duplicate detection using simhash. In Proceedings of the 20th ACM international conference on Information and knowledge management . 1117–1126
Sadhan Sood and Dmitri Loguinov. 2011 · 2011
Earlier work this paper cites.
Efficient distributed locality sensitive hashing. In Proceedings of the 21st ACM international conference on Information and knowledge management . 2174–2178
Bahman Bahmani, Ashish Goel, and Rajendra Shinde. 2012 · 2012
Earlier work this paper cites.
Locality-sensitive hashing scheme based on dynamic collision counting. In Proceedings of the 2012 ACM SIGMOD international conference on management of data . 541–552
Junhao Gan, Jianlin Feng, Qiong Fang, and Wilfred Ng. 2012 · 2012
Earlier work this paper cites.
Super-bit locality-sensitive hashing. In Advances in neural information processing systems . Citeseer, 108–116
Jianqiu Ji, Jianmin Li, Shuicheng Yan, Bo Zhang, and Qi Tian. 2012 · 2012
Cited alongside, same era.
Bi-level locality sensitive hashing for k-nearest neighbor computation. In 2012 IEEE 28th International Conference on Data Engineering . IEEE, 378–389
Jia Pan and Dinesh Manocha. 2012 · 2012
Cited alongside, same era.
Boundary-expanding locality sensitive hashing. In 2012 8th International Symposium on Chinese Spoken Language Processing . IEEE, 358–362
Qiang Wang, Zhiyuan Guo, Gang Liu, and Jun Guo. 2012 · 2012
Cited alongside, same era.
A similarity search system based on the hamming distance of social profiles. In 2013 IEEE Seventh International Conference on Semantic Computing . IEEE, 90–93
Rodolfo da Silva Villaca, Luciano Bernardes de Paula, Rafael Pasquini, and Mauricio Ferreira Magalhaes. 2013 · 2013
Cited alongside, same era.
A symbol spotting approach in graphical documents by hashing serialized graphs
ANN-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms. In International Conference on Similarity Search and Applications . Springer, 34–49
Martin Aumüller, Erik Bernhardsson, and Alexander Faithfull. 2017 · 2017
Later among the works it cites.
A secure mobile authentication alternative to biometrics. In Proceedings of the 33rd Annual Computer Security Applications Conference . 28–41
Mozhgan Azimpourkivi, Umut Topkara, and Bogdan Carbunar. 2017 · 2017
Later among the works it cites.
A Tree Locality-Sensitive Hash for Secure Software Testing
Camdon J Cady. 2017 · 2017
Later among the works it cites.
Hashing techniques: A survey and taxonomy
Lianhua Chi and Xingquan Zhu. 2017 · 2017
Later among the works it cites.
Large scale knowledge matching with balanced efficiency-effectiveness using lsh forest
Michael Cochez, Vagan Terziyan, and Vadim Ermolayev. 2017 · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Anjan Dutta, Josep Lladós, and Umapada Pal. 2013 · 2013
Cited alongside, same era.
An improved method of locality sensitive hashing for indexing large-scale and high-dimensional features
Xiaoguang Gu, Yongdong Zhang, Lei Zhang, Dongming Zhang, and Jintao Li. 2013 · 2013
Cited alongside, same era.
A distributed framework for scaling up LSH-based computations in privacy preserving record linkage. In Proceedings of the 6th Balkan Conference in Informatics . 102–109
Dimitrios Karapiperis and Vassilios S Verykios. 2013 · 2013
Cited alongside, same era.
A projection-based locality-sensitive hashing technique for reducing false negatives. In Applied Mechanics and Materials , Vol. 263. Trans Tech Publ, 1341–1346
Keon Myung Lee. 2013 · 2013
Cited alongside, same era.
A locality sensitive hashing technique for categorical data. In Applied Mechanics and Materials , Vol. 241. Trans Tech Publ, 3159–3164
Kyung Mi Lee and Keon Myung Lee. 2013 · 2013
Cited alongside, same era.
Efficient manifold learning for speech recognition using locality sensitive hashing. In 2013 IEEE international conference on acoustics, speech and signal processing . IEEE, 6995–6999
Vikrant Singh Tomar and Richard C Rose. 2013 · 2013
Cited alongside, same era.
Dynamic multi-probe lsh: An i/o efficient index structure for approximate nearest neighbor search. In International Conference on Database and Expert Systems Applications . Springer, 48–62
Shaoyi Yin, Mehdi Badr, and Dan Vodislav. 2013 · 2013
Cited alongside, same era.
Distribution-aware locality sensitive hashing
Lei Zhang, Yongdong Zhang, Dongming Zhang, and Qi Tian. 2013 · 2013
Cited alongside, same era.
Query-aware locality-sensitive hashing scheme for lp norm
Qiang Huang, Jianlin Feng, Qiong Fang, Wilfred Ng, and Wei Wang. 2017 · 2017
Later among the works it cites.
Faster compression methods for a weighted graph using locality sensitive hashing
Kifayat Ullah Khan, Batjargal Dolgorsuren, Tu Nguyen Anh, Waqas Nawaz, and Young-Koo Lee. 2017 · 2017
Later among the works it cites.
Physiological time series retrieval and prediction with locality-sensitive hashing
Yongwook Bryce Kim. 2017 · 2017
Later among the works it cites.
SES-LSH: shuffle-efficient locality sensitive hashing for distributed similarity search. In 2017 IEEE International Conference on Web Services (ICWS) . IEEE, 822–827
Dongsheng Li, Wanxin Zhang, Siqi Shen, and Yiming Zhang. 2017b · 2017
Later among the works it cites.
LSHSIM: a locality sensitive hashing based method for multiple-point geostatistics
Pedro Moura, Eduardo Laber, Hélio Lopes, Daniel Mesejo, Lucas Pavanelli, João Jardim, Francisco Thiesen, and Gabriel Pujol. 2017 · 2017
Later among the works it cites.
Raga identification using locality sensitive hashing. In 2017 Twenty-third National Conference on Communications (NCC) . IEEE, 1–6
G Padmasundari and Hema A Murthy. 2017 · 2017
Later among the works it cites.
A survey on learning to hash
Jingdong Wang, Ting Zhang, Nicu Sebe, Heng Tao Shen, et al · 2017
Later among the works it cites.
Fast low-rank matrix approximation with locality sensitive hashing for quick anomaly detection. In IEEE INFOCOM 2017-IEEE Conference on Computer Communications . IEEE, 1–9
Gaogang Xie, Kun Xie, Jun Huang, Xin Wang, Yuxiang Chen, and Jigang Wen. 2017 · 2017
Later among the works it cites.
LSHiForest: A generic framework for fast tree isolation based ensemble anomaly analysis. In 2017 IEEE 33rd International Conference on Data Engineering (ICDE) . IEEE, 983–994
Xuyun Zhang, Wanchun Dou, Qiang He, Rui Zhou, Christopher Leckie, Ramamohanarao Kotagiri, and Zoran Salcic. 2017 · 2017
Later among the works it cites.
Use of locality sensitive hashing (LSH) algorithm to match Web of Science and Scopus
Mehmet Ali Abdulhayoglu and Bart Thijs. 2018 · 2018
Later among the works it cites.
Multi-resolution sketches and locality sensitive hashing for fast trajectory processing. In Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems . 279–288
Maria Astefanoaei, Paul Cesaretti, Panagiota Katsikouli, Mayank Goswami, and Rik Sarkar. 2018 · 2018
Later among the works it cites.
Multivariate time-series similarity assessment via unsupervised representation learning and stratified locality sensitive hashing: Application to early acute hypotensive episode detection
Jwala Dhamala, Emmanuel Azuh, Abdullah Al-Dujaili, Jonathan Rubin, and Una-May O’Reilly. 2018 · 2018
Later among the works it cites.
Deep constrained siamese hash coding network and load-balanced locality-sensitive hashing for near duplicate image detection
Weiming Hu, Yabo Fan, Junliang Xing, Liang Sun, Zhaoquan Cai, and Stephen Maybank. 2018 · 2018
Later among the works it cites.
Accurate and fast asymmetric locality-sensitive hashing scheme for maximum inner product search. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . 1561–1570
Qiang Huang, Guihong Ma, Jianlin Feng, Qiong Fang, and Anthony KH Tung. 2018 · 2018
Later among the works it cites.
C2Net: A network-efficient approach to collision counting LSH similarity join
Hangyu Li, Sarana Nutanong, Hong Xu, Foryu Ha, et al · 2018
Later among the works it cites.
A probabilistic molecular fingerprint for big data settings
Daniel Probst and Jean-Louis Reymond. 2018 · 2018
Later among the works it cites.
Locality-sensitive hashing for earthquake detection: A case study of scaling data-driven science
Kexin Rong, Clara E Yoon, Karianne J Bergen, Hashem Elezabi, Peter Bailis, Philip Levis, and Gregory C Beroza. 2018 · 2018
Later among the works it cites.
Towards load balancing for LSH-based distributed similarity indexing in high-dimensional space. In 2018 IEEE 20th International Conference on High Performance Computing and Communications; IEEE 16th International Conference on Smart City; IEEE 4th International Conference on Data Science and Systems (HPCC/SmartCity/DSS) . IEEE, 384–391
Lu Shen, Jiagao Wu, Yongrong Wang, and Linfeng Liu. 2018 · 2018
Later among the works it cites.
Bone scintigraphy retrieval using sift-based fly local sensitive hashing. In 2018 IEEE 27th International Symposium on Industrial Electronics (ISIE) . IEEE, 735–740
Kuan Xu, Yu Qiao, Xiaoguang Niu, Xinzui Fang, Yuan Han, and Jie Yang. 2018 · 2018
Later among the works it cites.
Norm-Ranging LSH for Maximum Inner Product Search
Xiao Yan, Jinfeng Li, Xinyan Dai, Hongzhi Chen, and James Cheng. 2018 · 2018
Later among the works it cites.
A Blockchain Of Image Copyrights Using Robust Image Features And Locality-Sensitive H Ashing [J]
Aleksei Zhuvikin. 2018 · 2018
Later among the works it cites.
Locality Sensitive Hashing for ECG-based Subject Identification. In 2019 International Conference on Electrical and Computing Technologies and Applications (ICECTA) . IEEE, 1–4
Turky N Alotaiby, Alanoud Alhakbani, Nujood Alwhibi, Gaseb Alotaibi, and Saleh A Alshebeili. 2019 · 2019
Later among the works it cites.
A revisit of hashing algorithms for approximate nearest neighbor search
Deng Cai. 2019 · 2019
Later among the works it cites.
Learning Space Partitions for Nearest Neighbor Search
Yihe Dong, Piotr Indyk, Ilya Razenshteyn, and Tal Wagner. 2019 · 2019
Later among the works it cites.
Fast image similarity search by distributed locality sensitive hashing
Osman Durmaz and Hasan Sakir Bilge. 2019 · 2019
Later among the works it cites.
Locating similar names through locality sensitive hashing and graph theory
Fernando Turrado García, Luis Javier García Villalba, Ana Lucila Sandoval Orozco, Francisco Damián Aranda Ruiz, Andrés Aguirre Juárez, and Tai-Hoon Kim. 2019 · 2019
Later among the works it cites.
Approximate nearest neighbor search on high dimensional data—experiments, analyses, and improvement
Wen Li, Ying Zhang, Yifang Sun, Wei Wang, Mingjie Li, Wenjie Zhang, and Xuemin Lin. 2019 · 2019
Later among the works it cites.
I-LSH: I/O efficient c-approximate nearest neighbor search in high-dimensional space. In 2019 IEEE 35th International Conference on Data Engineering (ICDE) . IEEE, 1670–1673
Wanqi Liu, Hanchen Wang, Ying Zhang, Wei Wang, and Lu Qin. 2019 · 2019
Later among the works it cites.
A fast LSH-based similarity search method for multivariate time series
Chenyun Yu, Lintong Luo, Leanne Lai-Hang Chan, Thanawin Rakthanmanon, and Sarana Nutanong. 2019 · 2019
Later among the works it cites.
Boosted Locality Sensitive Hashing: Discriminative Binary Codes for Source Separation. In ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 106–110
Sunwoo Kim, Haici Yang, and Minje Kim. 2020 · 2020
Later among the works it cites.
EI-LSH: An early-termination driven I/O efficient incremental c-approximate nearest neighbor search
Wanqi Liu, Hanchen Wang, Ying Zhang, Wei Wang, Lu Qin, and Xuemin Lin. 2020 · 2020
Later among the works it cites.
R2LSH: A Nearest Neighbor Search Scheme Based on Two-dimensional Projected Spaces. In 2020 IEEE 36th International Conference on Data Engineering (ICDE) . IEEE, 1045–1056
Kejing Lu and Mineichi Kudo. 2020 · 2020
Later among the works it cites.
LSH-XGBoost based Network Congestion Detection Method for SSDN. In Journal of Physics: Conference Series , Vol. 1549. IOP Publishing, 052069
Kaiyuan Tian, Jian Wang, Yuanyuan Liao, Dengke Xu, and Baigen Cai. 2020 · 2020
Later among the works it cites.
LSH-based distributed similarity indexing with load balancing in high-dimensional space
Jiagao Wu, Lu Shen, and Linfeng Liu. 2020 · 2020
Later among the works it cites.
PM-LSH: A fast and accurate LSH framework for high-dimensional approximate NN search
Bolong Zheng, Zhao Xi, Lianggui Weng, Nguyen Quoc Viet Hung, Hang Liu, and Christian S Jensen. 2020 · 2020
Later among the works it cites.
Experimental Analysis of Locality Sensitive Hashing Techniques for High-Dimensional Approximate Nearest Neighbor Searches. In Databases Theory and Applications . Springer International Publishing, 62–73
Omid Jafari and Parth" Nagarkar. 2021 · 2021
Closest in time.
Lazylsh: Approximate nearest neighbor search for multiple distance functions with a single index. In Proceedings of the 2016 International Conference on Management of Data . 2023–2037
Yuxin Zheng, Qi Guo, Anthony KH Tung, and Sai Wu. 2016 · 2037
Closest in time.