Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations

04/15/2020
by   Haim Kaplan, et al.
0

Locality Sensitive Hashing (LSH) is an effective method to index a set of points such that we can efficiently find the nearest neighbors of a query point. We extend this method to our novel Set-query LSH (SLSH), such that it can find the nearest neighbors of a set of points, given as a query. Let s(x,y) be the similarity between two points x and y. We define a similarity between a set Q and a point x by aggregating the similarities s(p,x) for all p∈ Q. For example, we can take s(p,x) to be the angular similarity between p and x (i.e., 1-∠ (x,p)/π), and aggregate by arithmetic or geometric averaging, or taking the lowest similarity. We develop locality sensitive hash families and data structures for a large set of such arithmetic and geometric averaging similarities, and analyze their collision probabilities. We also establish an analogous framework and hash families for distance functions. Specifically, we give a structure for the euclidean distance aggregated by either averaging or taking the maximum. We leverage SLSH to solve a geometric extension of the approximate near neighbors problem. In this version, we consider a metric for which the unit ball is an ellipsoid and its orientation is specified with the query. An important application that motivates our work is group recommendation systems. Such a system embeds movies and users in the same feature space, and the task of recommending a movie for a group to watch together, translates to a set-query Q using an appropriate similarity.

READ FULL TEXT
research
05/25/2020

On the Problem of p_1^-1 in Locality-Sensitive Hashing

A Locality-Sensitive Hash (LSH) function is called (r,cr,p_1,p_2)-sensit...
research
07/25/2018

Robust Set Reconciliation via Locality Sensitive Hashing

We consider variations of set reconciliation problems where two parties,...
research
07/17/2018

Supermodular Locality Sensitive Hashes

In this work, we show deep connections between Locality Sensitive Hashab...
research
01/12/2021

Locality Sensitive Hashing for Efficient Similar Polygon Retrieval

Locality Sensitive Hashing (LSH) is an effective method of indexing a se...
research
04/15/2017

Generic LSH Families for the Angular Distance Based on Johnson-Lindenstrauss Projections and Feature Hashing LSH

In this paper we propose the creation of generic LSH families for the an...
research
07/10/2019

Polytopes, lattices, and spherical codes for the nearest neighbor problem

We study locality-sensitive hash methods for the nearest neighbor proble...
research
09/20/2018

Local Density Estimation in High Dimensions

An important question that arises in the study of high dimensional vecto...

Please sign up or login with your details

Forgot password? Click here to reset