Developing a Good Hash Function for LSH
نویسنده
چکیده
In the previous lecture we saw how to design locality sensitive hashing (LSH) for hamming and l1 distance, as a solution to the (c,R)-Near Neighbor problem. Whenever we use LSH for the nearest neighbor search, using some distance measure, the main task is to come up with a good elementary hashing function. This elementary hash function (H) is then used to create a composite hash function (G) for LSH exactly as described in the previous lecture.
منابع مشابه
SC-LSH: An Efficient Indexing Method for Approximate Similarity Search in High Dimensional Space
Locality Sensitive Hashing (LSH) is one of the most promising techniques for solving nearest neighbour search problem in high dimensional space. Euclidean LSH is the most popular variation of LSH that has been successfully applied in many multimedia applications. However, the Euclidean LSH presents limitations that affect structure and query performances. The main limitation of the Euclidean LS...
متن کاملSC-LSH: Une Méthode d'Indexation pour une Recherche de Similarité Approximative dans l'Espace Multidimensionnel
RÉSUMÉ. Locality Sensitive Hashing (LSH) est l'une des techniques les plus prometteuses pour la résolution des problèmes de la recherche des plus proches voisins dans l'espace de grande dimension. Euclidien Exact LSH (E2LSH) est la variante la plus populaire du LSH qui a été appliquée avec succès dans de nombreuses applications multimédia. Toutefois, l’E2LSH présente des limitations qui affecte...
متن کاملMulti-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search
Similarity indices for high-dimensional data are very desirable for building content-based search systems for featurerich data such as audio, images, videos, and other sensor data. Recently, locality sensitive hashing (LSH) and its variations have been proposed as indexing techniques for approximate similarity search. A significant drawback of these approaches is the requirement for a large num...
متن کامل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...
متن کاملSharing Hash Codes for Multiple Purposes
Locality sensitive hashing (LSH) is a powerful tool for sublinear-time approximate nearest neighbor search, and a variety of hashing schemes have been proposed for different similarity measures. However, hash codes significantly depend on the similarity, which prohibits users from adjusting the similarity at query time. In this paper, we propose multiple purpose LSH (mp-LSH) which shares the ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013