A Survey On Learning To Hash

Abstract

Nearest neighbor search is a problem of finding the data points from the database such that the distances from them to the query point are the smallest. Learning to hash is one of the major solutions to this problem and has been widely studied recently. In this paper, we present a comprehensive survey of the learning to hash algorithms, categorize them according to the manners of preserving the similarities into: pairwise similarity preserving, multiwise similarity preserving, implicit similarity preserving, as well as quantization, and discuss their relations. We separate quantization from pairwise similarity preserving as the objective function is very different though quantization, as we show, can be derived from preserving the pairwise similarities. In addition, we present the evaluation protocols, and the general performance analysis, and point out that the quantization algorithms perform superiorly in terms of search accuracy, search time cost, and space cost. Finally, we introdu

Stats

• citations763
• S2 citations—
• github stars0
• HF likes0
• heat score21.62
• arxiv keywang2016a

Related papers

• A Survey On Deep Hashing Methods (2020)16.84
• Learning To Hash With Semantic Similarity Metrics And Empirical KL Divergence (2020)0.00
• Set-to-set Hashing With Applications In Visual Recognition (2017)0.00
• A Revisit Of Hashing Algorithms For Approximate Nearest Neighbor Search (2016)11.19
• Robust Hashing For Multi-view Data: Jointly Learning Low-rank Kernelized Similarity Consensus And Hash Functions (2016)11.19
• Query-adaptive Hash Code Ranking For Large-scale Multi-view Visual Search (2019)13.74
• Learning To Hash For Recommendation: A Survey (2024)0.00
• Experimental Analysis Of Locality Sensitive Hashing Techniques For High-dimensional Approximate Nearest Neighbor Searches (2020)6.34