Derivation of Theoretical Formulas of Accuracy on Accessing Neighboring Buckets in Hash-Based Approximate Nearest Neighbor Search
نویسندگان
چکیده
Approximate nearest neighbor search is a technique which greatly reduces processing time and required amount of memory. Generally, there are the relationships of trade-off among accuracy, processing time and memory amount. Therefore, analysis on the relationships is an important task for practical application of the approximate nearest neighbor search method. In this paper, we construct a model of approximate nearest neighbor search methods with accessing neighboring buckets, and derive theoretical formulas in accuracy. The effectiveness of the formulas have been proved by comparing simulation results with experimental results.
منابع مشابه
Reciprocal Hash Tables for Nearest Neighbor Search
Recent years have witnessed the success of hashing techniques in approximate nearest neighbor search. In practice, multiple hash tables are usually employed to retrieve more desired results from all hit buckets of each table. However, there are rare works studying the unified approach to constructing multiple informative hash tables except the widely used random way. In this paper, we regard th...
متن کاملEnhancing Locality Sensitive Hashing with Peek Probing and Nearest Neighbor Links
In this work, we consider search in high dimensional data and propose two optimization techniques for Locality Sensitive Hashing (LSH). LSH has been successfully applied to search in multi-media databases or to duplicate detection in large Web or XML collections. LSH maps objects from a high-dimensional feature space to a set of buckets, using a hash function likely to cause hash collisions for...
متن کاملOnline Learning of Binary Feature Indexing for Real-Time SLAM Relocalization
In this paper, we propose an indexing method for approximate nearest neighbor search of binary features. Being different from the popular Locality Sensitive Hashing (LSH), the proposed method construct the hash keys by an online learning process instead of pure randomness. In the learning process, the hash keys are constructed with the aim of obtaining uniform hash buckets and high collision ra...
متن کاملIntelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond
The past decade has been marked by the (continued) explosion of diverse data content and the fast development of intelligent data analytics techniques. One problem we identified in the mid-2000s was similarity search of feature-rich data. The challenge here was achieving both high accuracy and high efficiency in high-dimensional spaces. Locality sensitive hashing (LSH), which uses certain rando...
متن کاملEvaluation Accuracy of Nearest Neighbor Sampling Method in Zagross Forests
Collection of appropriate qualitative and quantitative data is necessary for proper management and planning. Used the suitable inventory methods is necessary and accuracy of sampling methods dependent the inventory net and number of sample point. Nearest neighbor sampling method is a one of distance methods and calculated by three equations (Byth and Riple, 1980; Cotam and Curtis, 1956 and Cota...
متن کامل