# Locality-sensitive hashing

(Redirected from Locality preserving hashing)

Locality-sensitive hashing (LSH) reduces the dimensionality of high-dimensional data. LSH hashes input items so that similar items map to the same “buckets” with high probability (the number of buckets being much smaller than the universe of possible input items). LSH differs from conventional and cryptographic hash functions because it aims to maximize the probability of a “collision” for similar items.[1] Locality-sensitive hashing has much in common with data clustering and nearest neighbor search.

Hashing-based approximate nearest neighbor search algorithms generally use one of two main categories of hashing methods: either data-independent methods, such as locality-sensitive hashing (LSH); or data-dependent methods, such as Locality-preserving hashing (LPH).[2][3]

## DefinitionsEdit

An LSH family[1][4][5]${\displaystyle {\mathcal {F}}}$  is defined for a metric space ${\displaystyle {\mathcal {M}}=(M,d)}$ , a threshold ${\displaystyle R>0}$  and an approximation factor ${\displaystyle c>1}$ . This family ${\displaystyle {\mathcal {F}}}$  is a family of functions ${\displaystyle h:{\mathcal {M}}\to S}$  which map elements from the metric space to a bucket ${\displaystyle s\in S}$ . The LSH family satisfies the following conditions for any two points ${\displaystyle p,q\in {\mathcal {M}}}$ , using a function ${\displaystyle h\in {\mathcal {F}}}$  which is chosen uniformly at random:

• if ${\displaystyle d(p,q)\leq R}$ , then ${\displaystyle h(p)=h(q)}$  (i.e.,p and q collide) with probability at least ${\displaystyle P_{1}}$ ,
• if ${\displaystyle d(p,q)\geq cR}$ , then ${\displaystyle h(p)=h(q)}$  with probability at most ${\displaystyle P_{2}}$ .

A family is interesting when ${\displaystyle P_{1}>P_{2}}$ . Such a family ${\displaystyle {\mathcal {F}}}$  is called ${\displaystyle (R,cR,P_{1},P_{2})}$ -sensitive.

Alternatively[6] it is defined with respect to a universe of items U that have a similarity function ${\displaystyle \phi :U\times U\to [0,1]}$ . An LSH scheme is a family of hash functions H coupled with a probability distribution D over the functions such that a function ${\displaystyle h\in H}$  chosen according to D satisfies the property that ${\displaystyle Pr_{h\in H}[h(a)=h(b)]=\phi (a,b)}$  for any ${\displaystyle a,b\in U}$ .

### Locality-preserving hashingEdit

A locality-preserving hashing is a hash function f that maps a point or points in a multidimensional coordinate space to a scalar value, such that if we have three points A, B and C such that

${\displaystyle |A-B|<|B-C|\Rightarrow |f(A)-f(B)|<|f(B)-f(C)|.\,}$

In other words, these are hash functions where the relative distance between the input values is preserved in the relative distance between of the output hash values; input values that are closer to each other will produce output hash values that are closer to each other.

This is in contrast to cryptographic hash functions and checksums, which are designed to have maximum output difference between adjacent inputs.

Locality preserving hashes are related to space-filling curves.

### AmplificationEdit

Given a ${\displaystyle (d_{1},d_{2},p_{1},p_{2})}$ -sensitive family ${\displaystyle {\mathcal {F}}}$ , we can construct new families ${\displaystyle {\mathcal {G}}}$  by either the AND-construction or OR-construction of ${\displaystyle {\mathcal {F}}}$ .[1]

To create an AND-construction, we define a new family ${\displaystyle {\mathcal {G}}}$  of hash functions g, where each function g is constructed from k random functions ${\displaystyle h_{1},...,h_{k}}$  from ${\displaystyle {\mathcal {F}}}$ . We then say that for a hash function ${\displaystyle g\in {\mathcal {G}}}$ , ${\displaystyle g(x)=g(y)}$  if and only if all ${\displaystyle h_{i}(x)=h_{i}(y)}$  for ${\displaystyle i=1,2,...,k}$ . Since the members of ${\displaystyle {\mathcal {F}}}$  are independently chosen for any ${\displaystyle g\in {\mathcal {G}}}$ , ${\displaystyle {\mathcal {G}}}$  is a ${\displaystyle (d_{1},d_{2},p_{1}^{k},p_{2}^{k})}$ -sensitive family.

To create an OR-construction, we define a new family ${\displaystyle {\mathcal {G}}}$  of hash functions g, where each function g is constructed from k random functions ${\displaystyle h_{1},...,h_{k}}$  from ${\displaystyle {\mathcal {F}}}$ . We then say that for a hash function ${\displaystyle g\in {\mathcal {G}}}$ , ${\displaystyle g(x)=g(y)}$  if and only if ${\displaystyle h_{i}(x)=h_{i}(y)}$  for one or more values of i. Since the members of ${\displaystyle {\mathcal {F}}}$  are independently chosen for any ${\displaystyle g\in {\mathcal {G}}}$ , ${\displaystyle {\mathcal {G}}}$  is a ${\displaystyle (d_{1},d_{2},1-(1-p_{1})^{k},1-(1-p_{2})^{k})}$ -sensitive family.

## ApplicationsEdit

LSH has been applied to several problem domains including[citation needed]

## MethodsEdit

### Bit sampling for Hamming distanceEdit

One of the easiest ways to construct an LSH family is by bit sampling.[5] This approach works for the Hamming distance over d-dimensional vectors ${\displaystyle \{0,1\}^{d}}$ . Here, the family ${\displaystyle {\mathcal {F}}}$  of hash functions is simply the family of all the projections of points on one of the ${\displaystyle d}$  coordinates, i.e., ${\displaystyle {\mathcal {F}}=\{h:\{0,1\}^{d}\to \{0,1\}\mid h(x)=x_{i}{\text{ for some }}i\in \{1,...,d\}\}}$ , where ${\displaystyle x_{i}}$  is the ${\displaystyle i}$ th coordinate of ${\displaystyle x}$ . A random function ${\displaystyle h}$  from ${\displaystyle {\mathcal {F}}}$  simply selects a random bit from the input point. This family has the following parameters: ${\displaystyle P_{1}=1-R/d}$ , ${\displaystyle P_{2}=1-cR/d}$ .[clarification needed]

### Min-wise independent permutationsEdit

Suppose U is composed of subsets of some ground set of enumerable items S and the similarity function of interest is the Jaccard index J. If π is a permutation on the indices of S, for ${\displaystyle A\subseteq S}$  let ${\displaystyle h(A)=\min _{a\in A}\{\pi (a)\}}$ . Each possible choice of π defines a single hash function h mapping input sets to elements of S.

Define the function family H to be the set of all such functions and let D be the uniform distribution. Given two sets ${\displaystyle A,B\subseteq S}$  the event that ${\displaystyle h(A)=h(B)}$  corresponds exactly to the event that the minimizer of π over ${\displaystyle A\cup B}$  lies inside ${\displaystyle A\cap B}$ . As h was chosen uniformly at random, ${\displaystyle Pr[h(A)=h(B)]=J(A,B)\,}$  and ${\displaystyle (H,D)\,}$  define an LSH scheme for the Jaccard index.

Because the symmetric group on n elements has size n!, choosing a truly random permutation from the full symmetric group is infeasible for even moderately sized n. Because of this fact, there has been significant work on finding a family of permutations that is "min-wise independent" - a permutation family for which each element of the domain has equal probability of being the minimum under a randomly chosen π. It has been established that a min-wise independent family of permutations is at least of size ${\displaystyle \operatorname {lcm} (1,2,\cdots ,n)\geq e^{n-o(n)}}$ .[13] and that this bound is tight.[14]

Because min-wise independent families are too big for practical applications, two variant notions of min-wise independence are introduced: restricted min-wise independent permutations families, and approximate min-wise independent families. Restricted min-wise independence is the min-wise independence property restricted to certain sets of cardinality at most k.[15] Approximate min-wise independence differs from the property by at most a fixed ε.[16]

### Open source methodsEdit

#### Nilsimsa HashEdit

Nilsimsa is an anti-spam focused locality-sensitive hashing algorithm.[17] The goal of Nilsimsa is to generate a hash digest of an email message such that the digests of two similar messages are similar to each other. The paper suggests that the Nilsimsa satisfies three requirements:

1. The digest identifying each message should not vary significantly for changes that can be produced automatically.
2. The encoding must be robust against intentional attacks.
3. The encoding should support an extremely low risk of false positives.

#### TLSHEdit

TLSH is locality-sensitive hashing algorithm designed for a range of security and digital forensic applications.[18] The goal of TLSH is to generate a hash digest of document such that if two digests have a low distance between them, then it is likely that the messages are similar to each other.

Testing performed in the paper demonstrates that on a range of file types identified the Nilsimsa hash as having a significantly higher false positive rate when compared to other similarity digest schemes such as TLSH, Ssdeep and Sdhash.

An implementation of TLSH is available as open-source software.[19]

### Random projectionEdit

For small angles (not too close to orthogonal), ${\displaystyle 1-{\frac {\theta }{\pi }}}$  is a pretty good approximation to ${\displaystyle \cos(\theta )}$ .

The random projection method of LSH due to Moses Charikar[6] called SimHash (also sometimes called arccos[20]) is designed to approximate the cosine distance between vectors. The basic idea of this technique is to choose a random hyperplane (defined by a normal unit vector r) at the outset and use the hyperplane to hash input vectors.

Given an input vector v and a hyperplane defined by r, we let ${\displaystyle h(v)=sgn(v\cdot r)}$ . That is, ${\displaystyle h(v)=\pm 1}$  depending on which side of the hyperplane v lies.

Each possible choice of r defines a single function. Let H be the set of all such functions and let D be the uniform distribution once again. It is not difficult to prove that, for two vectors ${\displaystyle u,v}$ , ${\displaystyle Pr[h(u)=h(v)]=1-{\frac {\theta (u,v)}{\pi }}}$ , where ${\displaystyle \theta (u,v)}$  is the angle between u and v. ${\displaystyle 1-{\frac {\theta (u,v)}{\pi }}}$  is closely related to ${\displaystyle \cos(\theta (u,v))}$ .

In this instance hashing produces only a single bit. Two vectors' bits match with probability proportional to the cosine of the angle between them.

### Stable distributionsEdit

The hash function [21] ${\displaystyle h_{\mathbf {a} ,b}({\boldsymbol {\upsilon }}):{\mathcal {R}}^{d}\to {\mathcal {N}}}$  maps a d dimensional vector ${\displaystyle {\boldsymbol {\upsilon }}}$  onto a set of integers. Each hash function in the family is indexed by a choice of random ${\displaystyle \mathbf {a} }$  and ${\displaystyle b}$  where ${\displaystyle \mathbf {a} }$  is a d dimensional vector with entries chosen independently from a stable distribution and ${\displaystyle b}$  is a real number chosen uniformly from the range [0,r]. For a fixed ${\displaystyle \mathbf {a} ,b}$  the hash function ${\displaystyle h_{\mathbf {a} ,b}}$  is given by ${\displaystyle h_{\mathbf {a} ,b}({\boldsymbol {\upsilon }})=\left\lfloor {\frac {\mathbf {a} \cdot {\boldsymbol {\upsilon }}+b}{r}}\right\rfloor }$ .

Other construction methods for hash functions have been proposed to better fit the data. [22] In particular k-means hash functions are better in practice than projection-based hash functions, but without any theoretical guarantee.

## LSH algorithm for nearest neighbor searchEdit

One of the main applications of LSH is to provide a method for efficient approximate nearest neighbor search algorithms. Consider an LSH family ${\displaystyle {\mathcal {F}}}$ . The algorithm has two main parameters: the width parameter k and the number of hash tables L.

In the first step, we define a new family ${\displaystyle {\mathcal {G}}}$  of hash functions g, where each function g is obtained by concatenating k functions ${\displaystyle h_{1},...,h_{k}}$  from ${\displaystyle {\mathcal {F}}}$ , i.e., ${\displaystyle g(p)=[h_{1}(p),...,h_{k}(p)]}$ . In other words, a random hash function g is obtained by concatenating k randomly chosen hash functions from ${\displaystyle {\mathcal {F}}}$ . The algorithm then constructs L hash tables, each corresponding to a different randomly chosen hash function g.

In the preprocessing step we hash all n points from the data set S into each of the L hash tables. Given that the resulting hash tables have only n non-zero entries, one can reduce the amount of memory used per each hash table to ${\displaystyle O(n)}$  using standard hash functions.

Given a query point q, the algorithm iterates over the L hash functions g. For each g considered, it retrieves the data points that are hashed into the same bucket as q. The process is stopped as soon as a point within distance ${\displaystyle cR}$  from q is found.

Given the parameters k and L, the algorithm has the following performance guarantees:

• preprocessing time: ${\displaystyle O(nLkt)}$ , where t is the time to evaluate a function ${\displaystyle h\in {\mathcal {F}}}$  on an input point p;
• space: ${\displaystyle O(nL)}$ , plus the space for storing data points;
• query time: ${\displaystyle O(L(kt+dnP_{2}^{k}))}$ ;
• the algorithm succeeds in finding a point within distance ${\displaystyle cR}$  from q (if there exists a point within distance R) with probability at least ${\displaystyle 1-(1-P_{1}^{k})^{L}}$ ;

For a fixed approximation ratio ${\displaystyle c=1+\epsilon }$  and probabilities ${\displaystyle P_{1}}$  and ${\displaystyle P_{2}}$ , one can set ${\displaystyle k={\log n \over \log 1/P_{2}}}$  and ${\displaystyle L=n^{\rho }}$ , where ${\displaystyle \rho ={\log P_{1} \over \log P_{2}}}$ . Then one obtains the following performance guarantees:

• preprocessing time: ${\displaystyle O(n^{1+\rho }kt)}$ ;
• space: ${\displaystyle O(n^{1+\rho })}$ , plus the space for storing data points;
• query time: ${\displaystyle O(n^{\rho }(kt+d))}$ ;

## ReferencesEdit

1. ^ a b c Rajaraman, A.; Ullman, J. (2010). "Mining of Massive Datasets, Ch. 3".
2. ^ Zhao, Kang; Lu, Hongtao; Mei, Jincheng (2014). "Locality Preserving Hashing". pp. 2874–2880.
3. ^ Tsai, Yi-Hsuan; Yang, Ming-Hsuan (October 2014). "Locality preserving hashing". pp. 2988–2992. doi:10.1109/ICIP.2014.7025604. ISSN 1522-4880.
4. ^ Gionis, A.; Indyk, P.; Motwani, R. (1999). "Similarity Search in High Dimensions via Hashing". Proceedings of the 25th Very Large Database (VLDB) Conference.
5. ^ a b Indyk, Piotr.; Motwani, Rajeev. (1998). "Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality.". Proceedings of 30th Symposium on Theory of Computing.
6. ^ a b Charikar, Moses S. (2002). "Similarity Estimation Techniques from Rounding Algorithms". Proceedings of the 34th Annual ACM Symposium on Theory of Computing. pp. 380–388. doi:10.1145/509907.509965.
7. ^ Gurmeet Singh, Manku; Jain, Arvind; Das Sarma, Anish (2007), "Detecting near-duplicates for web crawling", Proceedings of the 16th international conference on World Wide Web, ACM.
8. ^ Das, Abhinandan S.; et al. (2007), "Google news personalization: scalable online collaborative filtering", Proceedings of the 16th international conference on World Wide Web, ACM, doi:10.1145/1242572.1242610.
9. ^ Koga, Hisashi, Tetsuo Ishibashi, and Toshinori Watanabe (2007), "Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing", Knowledge and Information Systems, 12 (1): 25–53, doi:10.1007/s10115-006-0027-5.
10. ^ Cochez, Michael and Mou, Hao (2015), "Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time", Proceeding SIGMOD '15 Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data: 505–517, doi:10.1145/2723372.2751521.
11. ^ Brinza, Dumitru; et al. (2010), "RAPID detection of gene–gene interactions in genome-wide association studies", Bioinformatics, 26 (22): 2856–2862, doi:10.1093/bioinformatics/btq529, PMC 3493125
12. ^
13. ^ Broder, A.Z.; Charikar, M.; Frieze, A.M.; Mitzenmacher, M. (1998). "Min-wise independent permutations". Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. pp. 327–336. doi:10.1145/276698.276781. Retrieved 2007-11-14.
14. ^ Takei, Y.; Itoh, T.; Shinozaki, T. "An optimal construction of exactly min-wise independent permutations". Technical Report COMP98-62, IEICE, 1998.
15. ^ Matoušek, J.; Stojakovic, M. (2002). "On Restricted Min-Wise Independence of Permutations". Preprint. Retrieved 2007-11-14.
16. ^ Saks, M.; Srinivasan, A.; Zhou, S.; Zuckerman, D. (2000). "Low discrepancy sets yield approximate min-wise independent permutation families". Information Processing Letters. 73 (1–2): 29–32. doi:10.1016/S0020-0190(99)00163-5. Retrieved 2007-11-14.
17. ^ Damiani et. al (2004). "An Open Digest-based Technique for Spam Detection" (PDF). Retrieved 2013-09-01.
18. ^ Oliver et. al (2013). "TLSH - A Locality Sensitive Hash". 4th Cybercrime and Trustworthy Computing Workshop. Retrieved 2015-04-06.
19. ^ "TLSH". Retrieved 2014-04-10.
20. ^ Alexandr Andoni; Indyk, P. (2008). "Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions". Communications of the ACM. 51 (1): 117–122. doi:10.1145/1327452.1327494.
21. ^ Datar, M.; Immorlica, N.; Indyk, P.; Mirrokni, V.S. (2004). "Locality-Sensitive Hashing Scheme Based on p-Stable Distributions". Proceedings of the Symposium on Computational Geometry.
22. ^ Pauleve, L.; Jegou, H.; Amsaleg, L. (2010). "Locality sensitive hashing: A comparison of hash function types and querying mechanisms". Pattern recognition Letters.
23. ^ Gorman, James, and James R. Curran. "Scaling distributional similarity to large corpora." Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics. Association for Computational Linguistics, 2006.