Fetching the paper…
Reading the bibliography…
Similarity query is the family of queries based on some similarity metrics.
Joint Visual-Textual Embedding for Multimodal Style Search
Gil Sadeh, Lior Fritz, Gabi Shalev, and Eduard Oks. 2019 · 1906
Earlier work this paper cites.
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.
Pqtable: Fast exact asymmetric distance neighbor search for product quantization using hash tables. In Proceedings of the IEEE International Conference on Computer Vision . 1940–1948
Yusuke Matsui, Toshihiko Yamasaki, and Kiyoharu Aizawa. 2015 · 1948
Earlier work this paper cites.
A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search
Mengzhao Wang, Xiaoliang Xu, Qiang Yue, and Yuxiang Wang. 2021 · 1978
Earlier work this paper cites.
Extensions of Lipschitz maps into a Hilbert space
W Johnson J Lindenstrauss. 1984 · 1984
Earlier work this paper cites.
Voronoi diagrams—a survey of a fundamental geometric data structure
Franz Aurenhammer. 1991 · 1991
Earlier work this paper cites.
Similarity indexing: Algorithms and performance. In Storage and Retrieval for Still Image and Video Databases IV , Vol. 2670. International Society for Optics and Photonics, 62–73
David A White and Ramesh C Jain. 1996 · 1996
Earlier work this paper cites.
Quantization
Robert M. Gray and David L. Neuhoff. 1998 · 1998
Earlier work this paper cites.
Learning to hash with graph neural networks for recommender systems. In Proceedings of The Web Conference 2020 . 1988–1998
Qiaoyu Tan, Ninghao Liu, Xing Zhao, Hongxia Yang, Jingren Zhou, and Xia Hu. 2020 · 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.
A cost model for query processing in high dimensional data spaces
Christian Böhm. 2000a · 2000
Earlier work this paper cites.
A cost model for query processing in high dimensional data spaces
Christian Böhm. 2000b · 2000
Earlier work this paper cites.
FeedbackBypass: A new approach to interactive similarity query processing. In VLDB . 201–210
Ilaria Bartolini, Paolo Ciaccia, and Florian Waas. 2001 · 2001
Earlier work this paper cites.
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
Christian Böhm, Stefan Berchtold, and Daniel A Keim. 2001 · 2001
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms. In Proceedings of the thirty-fourth annual ACM symposium on Theory of computing . 380–388
Moses S Charikar. 2002 · 2002
Earlier work this paper cites.
Fuzzy color histogram and its use in color image retrieval
Ju Han and Kai-Kuang Ma. 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.
An investigation of practical approximate nearest neighbor algorithms.. In NIPS , Vol. 12. Citeseer, 2004
Ting Liu, Andrew W Moore, Alexander G Gray, and Ke Yang. 2004 · 2004
Earlier work this paper cites.
Efficient similarity-based operations for data integration
Eike Schallehn, Kai-Uwe Sattler, and Gunter Saake. 2004 · 2004
Earlier work this paper cites.
Gorder: an efficient method for knn join processing. In Proceedings of the Thirtieth international conference on Very large data bases-Volume 30 . 756–767
Chenyi Xia, Hongjun Lu, Beng Chin Ooi, and Jing Hu. 2004 · 2004
Earlier work this paper cites.
FTW: fast similarity search under the time warping distance. In Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems . 326–337
Yasushi Sakurai, Masatoshi Yoshikawa, and Christos Faloutsos. 2005 · 2005
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. 2007a · 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. 2007b · 2007
Earlier work this paper cites.
Distributed computation of the knn graph for large high-dimensional point sets
Erion Plaku and Lydia E Kavraki. 2007 · 2007
Earlier work this paper cites.
Efficient index-based KNN join processing for high-dimensional data
Cui Yu, Bin Cui, Shuguang Wang, and Jianwen Su. 2007a · 2007
Earlier work this paper cites.
Efficient index-based KNN join processing for high-dimensional data
Cui Yu, Bin Cui, Shuguang Wang, and Jianwen Su. 2007b · 2007
Earlier work this paper cites.
Random projection trees and low dimensional manifolds. In Proceedings of the fortieth annual ACM symposium on Theory of computing . 537–546
Sanjoy Dasgupta and Yoav Freund. 2008 · 2008
Earlier work this paper cites.
Query adaptative locality sensitive hashing. In 2008 IEEE International Conference on Acoustics, Speech and Signal Processing . 825–828
Herve Jegou, 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 (Vancouver, British Columbia, Canada) (MM ’08) . Association for Computing Machinery, New York, NY, USA, 209–218
Alexis Joly and Olivier Buisson. 2008 · 2008
Earlier work this paper cites.
Effective and efficient query processing for video subsequence identification
Heng Tao Shen, Jie Shao, Zi Huang, and Xiaofang Zhou. 2008 · 2008
Earlier work this paper cites.
Optimised KD-trees for fast image descriptor matching. In 2008 IEEE Conference on Computer Vision and Pattern Recognition . IEEE, 1–8
Chanop Silpa-Anan and Richard Hartley. 2008 · 2008
Earlier work this paper cites.
Spectral hashing.. In Nips , Vol. 1. Citeseer, 4
Yair Weiss, Antonio Torralba, Robert Fergus, et al · 2008
Earlier work this paper cites.
Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering
Hans-Peter Kriegel, Peer Kröger, and Arthur Zimek. 2009 · 2009
Earlier work this paper cites.
Learning to Hash with Binary Reconstructive Embeddings.. In NIPS , Vol. 22. Citeseer, 1042–1050
Brian Kulis and Trevor Darrell. 2009 · 2009
Earlier work this paper cites.
Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration
Marius Muja and David Lowe. 2009 · 2009
Earlier work this paper cites.
Similarity group-by. In 2009 IEEE 25th International Conference on Data Engineering . IEEE, 904–915
Yasin N Silva, Walid G Aref, and Mohamed H Ali. 2009 · 2009
Earlier work this paper cites.
Survey of nearest neighbor techniques
Nitin Bhatia et al · 2010
Earlier work this paper cites.
Data fusion through cross-modality metric learning using similarity-sensitive hashing. In 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition . 3594–3601
Michael M. Bronstein, Alexander M. Bronstein, Fabrice Michel, and Nikos Paragios. 2010 · 2010
Earlier work this paper cites.
Product quantization for nearest neighbor search
Herve Jegou, Matthijs Douze, and Cordelia Schmid. 2010 · 2010
Earlier work this paper cites.
Evaluation of Entity Resolution Approaches on Real-World Match Problems
Hanna Köpcke, Andreas Thor, and Erhard Rahm. 2010 · 2010
Earlier work this paper cites.
Simdb: a similarity-aware database system. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data . 1243–1246
Yasin N Silva, Ahmed M Aly, Walid G Aref, and Per-Ake Larson. 2010 · 2010
Earlier work this paper cites.
Rankreduce-processing k-nearest neighbor queries on top of mapreduce. In LSDS-IR@ SIGIR
Aleksandar Stupar, Sebastian Michel, and Ralf Schenkel. 2010 · 2010
Earlier work this paper cites.
K nearest neighbor queries and knn-joins in large relational databases (almost) for free. In 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010) . IEEE, 4–15
Bin Yao, Feifei Li, and Piyush Kumar. 2010 · 2010
Earlier work this paper cites.
High-dimensional kNN joins with incremental updates
Cui Yu, Rui Zhang, Yaochun Huang, and Hui Xiong. 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.
Clustering Algorithms For High Dimensional Data–A Survey Of Issues And Existing Approaches
B Hari Babu, N Subash Chandra, and T Venu Gopal. 2011 · 2011
Earlier work this paper cites.
Efficient k-nearest neighbor graph construction for generic similarity measures. In Proceedings of the 20th international conference on World wide web . 577–586
Wei Dong, Charikar Moses, and Kai Li. 2011 · 2011
Earlier work this paper cites.
Fast approximate nearest-neighbor search with k-nearest neighbor graph. In Twenty-Second International Joint Conference on Artificial Intelligence
Kiana Hajebi, Yasin Abbasi-Yadkori, Hossein Shahbazi, and Hong Zhang. 2011 · 2011
Earlier work this paper cites.
Learning Hash Functions for Cross-View Similarity Search. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence - Volume Volume Two (Barcelona, Catalonia, Spain) (IJCAI’11) . AAAI Press, 1360–1365
Shaishav Kumar and Raghavendra Udupa. 2011 · 2011
Earlier work this paper cites.
Pass-Join: A Partition-Based Method for Similarity Joins
Guoliang Li, Dong Deng, Jiannan Wang, and Jianhua Feng. 2011 · 2011
Earlier work this paper cites.
Hashing with graphs. In Icml
Wei Liu, Jun Wang, Sanjiv Kumar, and Shih-Fu Chang. 2011 · 2011
Earlier work this paper cites.
Minimal loss hashing for compact binary codes. In ICML
Mohammad Norouzi and David J Fleet. 2011 · 2011
Earlier work this paper cites.
Fast GPU-Based Locality Sensitive Hashing for k-Nearest Neighbor Computation. In Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (Chicago, Illinois) (GIS ’11) . Association for Computing Machinery, New York, NY, USA, 211–220
Jia Pan and Dinesh Manocha. 2011 · 2011
Earlier work this paper cites.
Efficient exact edit similarity query processing with the asymmetric signature scheme. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of data . 1033–1044
Jianbin Qin, Wei Wang, Yifei Lu, Chuan Xiao, and Xuemin Lin. 2011 · 2011
Earlier work this paper cites.
On link-based similarity join
Liwen Sun, Reynold Cheng, Xiang Li, David W Cheung, and Jiawei Han. 2011 · 2011
Earlier work this paper cites.
Fast-join: An efficient method for fuzzy token matching based string similarity join. In 2011 IEEE 27th International Conference on Data Engineering . IEEE, 458–469
Jiannan Wang, Guoliang Li, and Jianhua Fe. 2011 · 2011
Earlier work this paper cites.
Efficient similarity joins for near-duplicate detection
Chuan Xiao, Wei Wang, Xuemin Lin, Jeffrey Xu Yu, and Guoren Wang. 2011a · 2011
Earlier work this paper cites.
Efficient similarity joins for near-duplicate detection
Chuan Xiao, Wei Wang, Xuemin Lin, Jeffrey Xu Yu, and Guoren Wang. 2011b · 2011
Earlier work this paper cites.
Range query processing in a multi-GPU environment. In 2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications . IEEE, 419–426
Ricardo J Barrientos, José I Gómez, Christian Tenllado, Manuel Prieto Matias, and Mauricio Marin. 2012 · 2012
Earlier work this paper cites.
Angular quantization-based binary codes for fast similarity search
Yunchao Gong, Sanjiv Kumar, Vishal Verma, and Svetlana Lazebnik. 2012a · 2012
Earlier work this paper cites.
Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval
Yunchao Gong, Svetlana Lazebnik, Albert Gordo, and Florent Perronnin. 2012b · 2012
Earlier work this paper cites.
Super-Bit Locality-Sensitive Hashing. In Proceedings of the 25th International Conference on Neural Information Processing Systems - Volume 1 (Lake Tahoe, Nevada) (NIPS’12) . Curran Associates Inc., Red Hook, NY, USA, 108–116
Jianqiu Ji, Jianmin Li, Shuicheng Yan, Bo Zhang, and Qi Tian. 2012 · 2012
Earlier work this paper cites.
The inverted multi-index. In 2012 IEEE Conference on Computer Vision and Pattern Recognition . IEEE Computer Society, 3069–3076
Victor Lempitsky and A Babenko. 2012 · 2012
Earlier work this paper cites.
Efficient algorithms for generalized subgraph query processing. In Proceedings of the 21st ACM international conference on Information and knowledge management . 325–334
Wenqing Lin, Xiaokui Xiao, James Cheng, and Sourav S Bhowmick. 2012 · 2012
Earlier work this paper cites.
Efficient processing of k nearest neighbor joins using mapreduce
Wei Lu, Yanyan Shen, Su Chen, and Beng Chin Ooi. 2012 · 2012
Earlier work this paper cites.
Fast search in hamming space with multi-index hashing. In 2012 IEEE conference on computer vision and pattern recognition . IEEE, 3108–3115
Mohammad Norouzi, Ali Punjani, and David J Fleet. 2012 · 2012
Earlier work this paper cites.
Approximate Similarity Search for Online Multimedia Services on Distributed CPU-GPU Platforms
George Teodoro, Eduardo Valle, Nathan Mariano, Ricardo Torres, Wagner Meira Jr au2, and Joel H. Saltz. 2012 · 2012
Earlier work this paper cites.
Randomly-oriented kd trees adapt to intrinsic dimension. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
Santosh S Vempala. 2012 · 2012
Earlier work this paper cites.
Query-driven iterated neighborhood graph search for large scale indexing. In Proceedings of the 20th ACM international conference on Multimedia . 179–188
Jingdong Wang and Shipeng Li. 2012 · 2012
Earlier work this paper cites.
Scalable k-nn graph construction for visual descriptors. In 2012 IEEE Conference on Computer Vision and Pattern Recognition . IEEE, 1106–1113
Jing Wang, Jingdong Wang, Gang Zeng, Zhuowen Tu, Rui Gan, and Shipeng Li. 2012 · 2012
Earlier work this paper cites.
Efficient parallel kNN joins for large data in MapReduce. In Proceedings of the 15th international conference on extending database technology . 38–49
Chi Zhang, Feifei Li, and Jeffrey Jestes. 2012 · 2012
Cited alongside, same era.
A unified framework for multimodal retrieval
2013 · 2013
Cited alongside, same era.
Randomized partition trees for exact nearest neighbor search. In Conference on Learning Theory . PMLR, 317–337
Sanjoy Dasgupta and Kaushik Sinha. 2013 · 2013
Cited alongside, same era.
Devise: A deep visual-semantic embedding model
Andrea Frome, Greg Corrado, Jonathon Shlens, Samy Bengio, Jeffrey Dean, Marc’Aurelio Ranzato, and Tomas Mikolov. 2013 · 2013
Cited alongside, same era.
Optimized product quantization
Tiezheng Ge, Kaiming He, Qifa Ke, and Jian Sun. 2013a · 2013
Cited alongside, same era.
Rank cover trees for nearest neighbor search. In International Conference on Similarity Search and Applications . Springer, 16–29
Fusion of color histogram and LBP-based features for texture image retrieval and classification
Peizhong Liu, Jing-Ming Guo, Kosin Chamnongthai, and Heri Prasetyo. 2017 · 2017
Later among the works it cites.
A survey on clustering high dimensional data techniques
Mudamala Pavithra and RMS Parvathi. 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.
Contextual string embeddings for sequence labeling. In Proceedings of the 27th international conference on computational linguistics . 1638–1649
Alan Akbik, Duncan Blythe, and Roland Vollgraf. 2018 · 2018
Later among the works it cites.
Large-scale parallel similarity search with Product Quantization for online multimedia services
Guilherme Andrade, André Fernandes, Jeremias M. Gomes, Renato Ferreira, and George Teodoro. 2019 · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Michael E Houle and Michael Nett. 2013 · 2013
Cited alongside, same era.
Efficient estimation of word representations in vector space
Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013a · 2013
Cited alongside, same era.
Efficient estimation of word representations in vector space
Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013b · 2013
Cited alongside, same era.
Which space partitioning tree to use for search?. In NIPS . Citeseer, 656–664
Parikshit Ram and Alexander G Gray. 2013 · 2013
Cited alongside, same era.
Image similarity measure using color histogram, color coherence vector, and sobel method
Kalyan Roy and Joydeep Mukherjee. 2013 · 2013
Cited alongside, same era.
Similarity queries: their conceptual evaluation, transformations, and processing
Yasin N Silva, Walid G Aref, Per-Ake Larson, Spencer S Pearson, and Mohamed H Ali. 2013a · 2013
Cited alongside, same era.
Similarity queries: their conceptual evaluation, transformations, and processing
Yasin N Silva, Walid G Aref, Per-Ake Larson, Spencer S Pearson, and Mohamed H Ali. 2013b · 2013
Cited alongside, same era.
Optimal k-nearest-neighbor query processing via multiple lower bound approximations. In 2018 IEEE International Conference on Big Data (Big Data) . IEEE, 614–623
Christian Beecks and Max Berrendorf. 2018 · 2018
Later among the works it cites.
Bert: Pre-training of deep bidirectional transformers for language understanding
Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2018a · 2018
Later among the works it cites.
Distributed representations of tuples for entity resolution
Muhammad Ebraheem, Saravanan Thirumuruganathan, Shafiq Joty, Mourad Ouzzani, and Nan Tang. 2018 · 2018
Later among the works it cites.
Graph embedding techniques, applications, and performance: A survey
Palash Goyal and Emilio Ferrara. 2018 · 2018
Later among the works it cites.
Masajiro Iwasaki and Daisuke Miyazaki. 2018 · 2018
Later among the works it cites.
Improved nearest neighbor search using auxiliary information and priority functions. In International Conference on Machine Learning . PMLR, 2573–2581
Omid Keivani and Kaushik Sinha. 2018 · 2018
Later among the works it cites.
Canonical tensor decomposition for knowledge base completion
Timothée Lacroix, Nicolas Usunier, and Guillaume Obozinski. 2018 · 2018
Later among the works it cites.
Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs
Yu A Malkov and Dmitry A Yashunin. 2018 · 2018
Later among the works it cites.
A survey of product quantization
Yusuke Matsui, Yusuke Uchida, Hervé Jégou, and Shin’ichi Satoh. 2018 · 2018
Later among the works it cites.
Learning joint embedding with multimodal cues for cross-modal video-text retrieval. In Proceedings of the 2018 ACM on International Conference on Multimedia Retrieval . 19–27
Niluthpol Chowdhury Mithun, Juncheng Li, Florian Metze, and Amit K Roy-Chowdhury. 2018 · 2018
Later among the works it cites.
Deep learning for entity matching: A design space exploration. In Proceedings of the 2018 International Conference on Management of Data . 19–34
Sidharth Mudgal, Han Li, Theodoros Rekatsinas, AnHai Doan, Youngchoon Park, Ganesh Krishnan, Rohit Deep, Esteban Arcaute, and Vijay Raghavendra. 2018 · 2018
Later among the works it cites.
Systematic review of clustering high-dimensional and large datasets
Divya Pandove, Shivan Goel, and Rinkl Rani. 2018 · 2018
Later among the works it cites.
Unsupervised deep hashing with similarity-adaptive and discrete optimization
Fumin Shen, Yan Xu, Li Liu, Yang Yang, Zi Huang, and Heng Tao Shen. 2018 · 2018
Later among the works it cites.
Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search
Yiqiu Wang, Anshumali Shrivastava, and Junghee Ryu. 2018 · 2018
Later among the works it cites.
Fast Approximate Nearest Neighbor Search via k-Diverse Nearest Neighbor Graph. In Thirty-Second AAAI Conference on Artificial Intelligence
Yan Xiao, Jiafeng Guo, Yanyan Lan, Jun Xu, and Xueqi Cheng. 2018 · 2018
Later among the works it cites.
Efficient Large-Scale Approximate Nearest Neighbor Search on OpenCL FPGA. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Jialiang Zhang, Soroosh Khoram, and Jing Li. 2018 · 2018
Later among the works it cites.
A Generic Inverted Index Framework for Similarity Search on the GPU. In 2018 IEEE 34th International Conference on Data Engineering (ICDE) . 893–904
Jingbo Zhou, Qi Guo, H. V. Jagadish, Lubos Krcal, Siyuan Liu, Wenhao Luan, Anthony K. H. Tung, Yueji Yang, and Yuxin Zheng. 2018 · 2018
Later among the works it cites.
Clustering high-dimensional data
Arthur Zimek. 2018 · 2018
Later among the works it cites.
Generic Neural Elastic Search: From bert-as-service and Go Way Beyond
[n.d.] · 2019
Later among the works it cites.
Dynamic Set kNN Self-Join. In 2019 IEEE 35th International Conference on Data Engineering (ICDE) . 818–829
Daichi Amagata, Takahiro Hara, and Chuan Xiao. 2019 · 2019
Later among the works it cites.
PUFFINN: parameterless and universally fast finding of nearest neighbors
Martin Aumüller, Tobias Christiani, Rasmus Pagh, and Michael Vesterli. 2019 · 2019
Later among the works it cites.
RobustiQ: A Robust ANN Search Method for Billion-Scale Similarity Search on GPUs. In Proceedings of the 2019 on International Conference on Multimedia Retrieval (Ottawa ON, Canada) (ICMR ’19) . Association for Computing Machinery, New York, NY, USA, 132–140
Wei Chen, Jincai Chen, Fuhao Zou, Yuan-Fang Li, Ping Lu, and Wei Zhao. 2019 · 2019
Later among the works it cites.
FPGA Acceleration of Approximate KNN Indexing on High- Dimensional Vectors
Dimitrios Danopoulos, Christoforos Kachris, and Dimitrios Soudris. 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.
Beyond product quantization: Deep progressive quantization for image retrieval
Lianli Gao, Xiaosu Zhu, Jingkuan Song, Zhou Zhao, and Heng Tao Shen. 2019 · 2019
Later among the works it cites.
Weakly supervised deep image hashing through tag embeddings. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition . 10375–10384
Vijetha Gattupalli, Yaoxin Zhuo, and Baoxin Li. 2019 · 2019
Later among the works it cites.
Accelerating the similarity self-join using the GPU
Michael Gowanlock and Ben Karsin. 2019a · 2019
Later among the works it cites.
Fast Approximated Nearest Neighbor Joins For Relational Database Systems
Michael Günther, Maik Thiele, and Wolfgang Lehner. 2019 · 2019
Later among the works it cites.
Efficient continuous KNN join processing for real-time recommendation
Yupeng Hu, Chong Yang, Peng Zhan, Jia Zhao, Yujun Li, and Xueqing Li. 2019 · 2019
Later among the works it cites.
Billion-scale similarity search with gpus
Jeff Johnson, Matthijs Douze, and Hervé Jégou. 2019 · 2019
Later among the works it cites.
Sample efficient text summarization using a single pre-trained transformer
Urvashi Khandelwal, Kevin Clark, Dan Jurafsky, and Lukasz Kaiser. 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.
Similarity histogram estimation based top-k similarity join algorithm on high-dimensional data. In International Conference on Web Information Systems and Applications . Springer, 589–600
Youzhong Ma, Ruiling Zhang, and Yongxin Zhang. 2019 · 2019
Later among the works it cites.
Spherical text embedding
Yu Meng, Jiaxin Huang, Guangyuan Wang, Chao Zhang, Honglei Zhuang, Lance Kaplan, and Jiawei Han. 2019 · 2019
Later among the works it cites.
iFLEX: A Fully Open-Source, High-Density Field-Programmable Gate Array (FPGA)-Based Hardware Co-Processor for Vector Similarity Searching
Ludovico Minati, Vardan Movsisyan, Matthew Mccormick, Khachatur Gyozalyan, Tigran Papazyan, Hrach Makaryan, Stefano Aldrigo, Taron Harutyunyan, Hayk Ghaltaghchyan, Chris Mccormick, and Mick Fandrich. 2019 · 2019
Later among the works it cites.
Cache-oblivious high-performance similarity join. In Proceedings of the 2019 International Conference on Management of Data . 87–104
Martin Perdacher, Claudia Plant, and Christian Böhm. 2019 · 2019
Later among the works it cites.
Accelerated query processing via similarity score prediction. In Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval . 485–494
Matthias Petri, Alistair Moffat, Joel Mackenzie, J Shane Culpepper, and Daniel Beck. 2019 · 2019
Later among the works it cites.
Revisiting kd-tree for nearest neighbor search. In Proceedings of the 25th acm sigkdd international conference on knowledge discovery & data mining . 1378–1388
Parikshit Ram and Kaushik Sinha. 2019 · 2019
Later among the works it cites.
Hardware-Accelerated Similarity Search with Multi-Index Hashing. In 2019 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech) . 733–740
Leandro Santiago de Araújo, Victor da Cruz Ferreira, Brunno Figueiroa Goldstein, Alexandre Solon Nery, Leandro Augusto Justen Marzulo, Sandip Kundu, and Felipe Maia Galvão França. 2019 · 2019
Later among the works it cites.
Probabilistic face embeddings. In Proceedings of the IEEE International Conference on Computer Vision . 6902–6911
Yichun Shi and Anil K Jain. 2019 · 2019
Later among the works it cites.
Diskann: Fast accurate billion-point nearest neighbor search on a single node. In Proceedings of the 33rd International Conference on Neural Information Processing Systems . 13766–13776
Suhas Jayaram Subramanya, Rohan Kadekodi, Ravishankar Krishaswamy, and Harsha Vardhan Simhadri. 2019 · 2019
Later among the works it cites.
Balance-aware distributed string similarity-based query processing system
Ji Sun, Zeyuan Shang, Guoliang Li, Dong Deng, and Zhifeng Bao. 2019 · 2019
Later among the works it cites.
Learning to hash for efficient search over incomplete knowledge graphs. In 2019 IEEE International Conference on Data Mining (ICDM) . IEEE, 1360–1365
Meng Wang, Haomin Shen, Sen Wang, Lina Yao, Yinlin Jiang, Guilin Qi, and Yang Chen. 2019 · 2019
Later among the works it cites.
K-nearest neighbor search by random projection forests
Donghui Yan, Yingjie Wang, Jin Wang, Honggang Wang, and Zhenpeng Li. 2019 · 2019
Later among the works it cites.
Creating embeddings of heterogeneous relational datasets for data integration tasks. In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data . 1335–1349
Riccardo Cappuzzo, Paolo Papotti, and Saravanan Thirumuruganathan. 2020 · 2020
Later among the works it cites.
Pivot-based approximate k-NN similarity joins for big high-dimensional data
Přemysl Čech, Jakub Lokoč, and Yasin N Silva. 2020 · 2020
Later among the works it cites.
Efficient nearest neighbor search in high dimensional hamming space
Bin Fan, Qingqun Kong, Baoqian Zhang, Hongmin Liu, Chunhong Pan, and Jiwen Lu. 2020 · 2020
Later among the works it cites.
Accelerating large-scale inference with anisotropic vector quantization. In International Conference on Machine Learning . PMLR, 3887–3896
Ruiqi Guo, Philip Sun, Erik Lindgren, Quan Geng, David Simcha, Felix Chern, and Sanjiv Kumar. 2020 · 2020
Later among the works it cites.
Spleeter: a fast and efficient music source separation tool with pre-trained models
Romain Hennequin, Anis Khlif, Felix Voituret, and Manuel Moussallam. 2020 · 2020
Later among the works it cites.
Deep entity matching with pre-trained language models
Yuliang Li, Jinfeng Li, Yoshihiko Suhara, AnHai Doan, and Wang-Chiew Tan. 2020 · 2020
Later among the works it cites.
Deep Product Quantization Module for Efficient Image Retrieval. In ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 4382–4386
Meihan Liu, Yongxing Dai, Yan Bai, and Ling-Yu Duan. 2020 · 2020
Later among the works it cites.
CHIP-KNN: A Configurable and High-Performance K-Nearest Neighbors Accelerator on Cloud FPGAs. In 2020 International Conference on Field-Programmable Technology (ICFPT) . 139–147
Alec Lu, Zhenman Fang, Nazanin Farahpour, and Lesley Shannon. 2020 · 2020
Later among the works it cites.
Similarity query processing for high-dimensional data
Jianbin Qin, Wei Wang, Chuan Xiao, and Ying Zhang. 2020 · 2020
Later among the works it cites.
Beyond User Embedding Matrix: Learning to Hash for Modeling Large-Scale Users in Recommendation. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval . 319–328
Shaoyun Shi, Weizhi Ma, Min Zhang, Yongfeng Zhang, Xinxing Yu, Houzhi Shan, Yiqun Liu, and Shaoping Ma. 2020 · 2020
Later among the works it cites.
Brepartition: Optimized high-dimensional knn search with bregman distances
Yang Song, Yu Gu, Rui Zhang, and Ge Yu. 2020 · 2020
Later among the works it cites.
A Hash Learning Framework for Search-Oriented Knowledge Graph Embedding
Meng Wang, Tongtong Wu, and Guilin Qi. 2020 · 2020
Later among the works it cites.
DeltaPQ: lossless product quantization code compression for high dimensional similarity search
Runhui Wang and Dong Deng. 2020 · 2020
Later among the works it cites.
An Approach for Progressive Set Similarity Join with GPU Accelerating. In International Conference on Web Information Systems and Applications . Springer, 155–167
Lining Yu, Tiezheng Nie, Derong Shen, and Yue Kou. 2020 · 2020
Later among the works it cites.
High-Dimensional Similarity Search for Scalable Data Science. In 2021 IEEE 37th International Conference on Data Engineering (ICDE) . IEEE, 2369–2372
Karima Echihabi, Kostas Zoumpatianos, and Themis Palpanas. 2021 · 2021
Later among the works it cites.
Self-supervised Product Quantization for Deep Unsupervised Image Retrieval. In Proceedings of the IEEE/CVF International Conference on Computer Vision . 12085–12094
Young Kyun Jang and Nam Ik Cho. 2021 · 2021
Later among the works it cites.
Multi-GPU Efficient Indexing for Maximizing Parallelism of High Dimensional Range Query Services
Mincheol Kim, Ling Liu, and Woink Choi. 2021 · 2021
Later among the works it cites.
Distributed Stream KNN Join. In Proceedings of the 2021 International Conference on Management of Data (Virtual Event, China) (SIGMOD/PODS ’21) . Association for Computing Machinery, New York, NY, USA, 1597–1609
Amirhesam Shahvarani and Hans-Arno Jacobsen. 2021 · 2021
Later among the works it cites.
Deep supervised hashing for fast image retrieval. In Proceedings of the IEEE conference on computer vision and pattern recognition . 2064–2072
Haomiao Liu, Ruiping Wang, Shiguang Shan, and Xilin Chen. 2016 · 2072
Closest in time.
Supervised hashing with kernels. In 2012 IEEE Conference on Computer Vision and Pattern Recognition . IEEE, 2074–2081
Wei Liu, Jun Wang, Rongrong Ji, Yu-Gang Jiang, and Shih-Fu Chang. 2012 · 2081
Closest in time.