1 / 40

Big Data

Big Data. Lecture 6: Locality Sensitive Hashing (LSH). Nearest Neighbor . Given a set P of n points in R d. Nearest Neighbor . Want to build a data structure to answer nearest neighbor queries. Voronoi Diagram. Build a Voronoi diagram & a point location data structure.

butch
Download Presentation

Big Data

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Big Data Lecture 6: Locality Sensitive Hashing (LSH)

  2. Nearest Neighbor Given a set P of n points in Rd

  3. Nearest Neighbor Want to build a data structure to answer nearest neighbor queries

  4. Voronoi Diagram Build a Voronoi diagram & a point location data structure

  5. Curse of dimensionality • In R2 the Voronoi diagram is of size O(n) • Query takes O(logn) time • In Rdthe complexity is O(nd/2) • Other techniques also scale bad with the dimension

  6. Locality Sensitive Hashing • We will use a family of hash functions such that close points tend to hash to the same bucket. • Put all points of P in their buckets, ideally we want the query q to find its nearest neighbor in its bucket

  7. Locality Sensitive Hashing • Def (Charikar): A family H of functions is locality sensitive with respect to a similarity function 0 ≤ sim(p,q) ≤ 1 if Pr[h(p) = h(q)] = sim(p,q)

  8. Example – Hamming Similarity Think of the points as strings of m bits and consider the similarity sim(p,q) = 1-ham(p,q)/m H={hi(p) = the i-th bit of p} is locality sensitive wrtsim(p,q) = 1-ham(p,q)/m Pr[h(p) = h(q)] = 1 – ham(p,q)/m 1-sim(p,q) = ham(p,q)/m

  9. Example - Jaacard Think of p and q as sets sim(p,q) = jaccard(p,q) = |pq|/|pq| H={h(p) = min in  of the items in p} Pr[h(p) = h(q)] = jaccard(p,q) Need to pick  from a min-wise ind. family of permutations

  10. Map to {0,1} Draw a function b to 0/1 from a pairwiseind. family B So: h(p)  h(q)  b(h(p)) = b(h(q)) = 1/2 H’={b(h()) | hH, bB}

  11. Another example (“simhash”) H = {hr(p) = 1 if r·p > 0, 0 otherwise | r is a random unit vector} r

  12. Another example H = {hr(p) = 1 if r·p > 0, 0 otherwise | r is a random unit vector} Pr[hr(p) = hr(q)] = ?

  13. Another example H = {hr(p) = 1 if r·p > 0, 0 otherwise | r is a random unit vector} θ

  14. Another example H = {hr(p) = 1 if r·p > 0, 0 otherwise | r is a random unit vector} θ

  15. Another example H = {hr(p) = 1 if r·p > 0, 0 otherwise | r is a random unit vector} For binary vectors (like term-doc) incidence vectors: θ

  16. How do we really use it? Reduce the number of false positives by concatenating hash function to get new hash functions (“signature”) sig(p) = h1(p)h2(p) h3(p)h4(p)…… = 00101010 Very close documents are hashed to the same bucket or to ‘’close” buckets (ham(sig(p),sig(q)) is small) See papers on removing almost duplicates…

  17. A theoretical result on NN

  18. Locality Sensitive Hashing Thm: If there exists a family H of hash functions such that Pr[h(p) = h(q)] = sim(p,q) then d(p,q) = 1-sim(p,q) satisfies the triangle inequality

  19. Locality Sensitive Hashing • Alternative Def (Indyk-Motwani): A family H of functions is (r1 < r2,p1 > p2)-sensitive if d(p,q) ≤ r1 Pr[h(p) = h(q)] ≥ p1 r2 r1 d(p,q) ≥ r2 Pr[h(p) = h(q)] ≤ p2 p If d(p,q) = 1-sim(p,q) then this holds with p1 = 1-r1 and p2=1-r2 r1, r2

  20. Locality Sensitive Hashing • Alternative Def (Indyk-Motwani): A family H of functions is (r1 < r2,p1 > p2)-sensitive if d(p,q) ≤ r1 Pr[h(p) = h(q)] ≥ p1 r2 r1 d(p,q) ≥ r2 Pr[h(p) = h(q)] ≤ p2 p If d(p,q) = ham(p,q) then this holds with p1 = 1-r1/m and p2=1-r2/m r1, r2

  21. (r,ε)-neighbor problem • If there is a neighbor p, such that d(p,q)r, return p’, s.t. d(p’,q)  (1+ε)r. • If there is no p s.t. d(p,q)(1+ε)r return nothing. ((1) is the real req. since if we satisfy (1) only, we can satisfy (2) by filtering answers that are too far)

  22. (r,ε)-neighbor problem 1) If there is a neighbor p, such that d(p,q)r, return p’, s.t. d(p’,q)  (1+ε)r. r p (1+ε)r

  23. (r,ε)-neighbor problem 2) Never return p such that d(p,q) > (1+ε)r r p (1+ε)r

  24. (r,ε)-neighbor problem • We can return p’, s.t. r  d(p’,q)  (1+ε)r. r p (1+ε)r

  25. (r,ε)-neighbor problem • Lets construct a data structure that succeeds with constant probability • Focus on the hamming distance first

  26. NN using locality sensitive hashing • Take a (r1 < r2, p1 > p2) = (r < (1+)r, 1-r/m > 1-(1+)r/m) - sensitive family • If there is a neighbor at distance r we catch it with probability p1

  27. NN using locality sensitive hashing • Take a (r1 < r2, p1 > p2) = (r < (1+)r, 1-r/m > 1-(1+)r/m) - sensitive family • If there is a neighbor at distance r we catch it with probability p1 so to guarantee catching it we need 1/p1 functions..

  28. NN using locality sensitive hashing • Take a (r1 < r2, p1 > p2) = (r < (1+)r, 1-r/m > 1-(1+)r/m) - sensitive family • If there is a neighbor at distance r we catch it with probability p1 so to guarantee catching it we need 1/p1 functions.. • But we also get false positives in our 1/p1buckets, how many ?

  29. NN using locality sensitive hashing • Take a (r1 < r2, p1 > p2) = (r < (1+)r, 1-r/m> 1-(1+)r/m) - sensitive family • If there is a neighbor at distance r we catch it with probability p1so to guarantee catching it we need 1/p1 functions.. • But we also get false positives in our 1/p1 buckets, how many ? np2/p1

  30. NN using locality sensitive hashing • Take a (r1 < r2, p1 > p2) = (r < (1+)r, 1-r/m> 1-(1+)r/m) - sensitive family • Make a new function by concatenating k of these basic functions • We get a (r1 < r2, (p1)k> (p2)k) • If there is a neighbor at distance r we catch it with probability (p1)kso to guarantee catching it we need 1/(p1)k functions.. • But we also get false positives in our 1/(p1)k buckets, how many ? n(p2)k/(p1)k

  31. (r,ε)-Neighbor with constant prob Scan the first 4n(p2)k/(p1)kpoints in the buckets and return the closest A close neighbor (≤ r1) is in one of the buckets with probability ≥ 1-(1/e) There are ≤ 4n(p2)k/(p1)k false positives with probability ≥ 3/4  Both events happen with constant prob.

  32. Analysis Total query time: (each op takes time prop. to the dim.) We want to choose k to minimize this. time ≤ 2*min k

  33. Analysis Total query time: (each op takes time prop. to the dim.) We want to choose k to minimize this: 

  34. Summary Total query time: Put: Total space:

  35. What is  ? Query time: Total space:

  36. (1+ε)-approximate NN • Given q find p such that p’p d(q,p)  (1+ε)d(q,p’) • We can use our solution to the (r,)-neighbor problem

  37. (1+ε)-approximate NN vs (r,ε)-neighbor problem • If we know rmin and rmaxwe can find (1+ε)-approximate NN using log(rmax/rmin) (r,ε’≈ ε/2)-neighbor problems r p (1+ε)r

  38. LSH using p-stable distributions Definition: A distribution D is 2-stable if when X1,……,Xd are drawn from D, viXi = ||v||X where X is drawn from D. So what do we do with this ? h(p) = piXi h(p)-h(q) = piXi - qiXi= (pi-qi)Xi=||p-q||X

  39. LSH using p-stable distributions Definition: A distribution D is 2-stable if when X1,……,Xd are drawn from D, viXi = ||v||X where X is drawn from D. So what do we do with this ? h(p) = (pX+b)/r Pick r to maximize ρ… r

  40. Bibliography • M. Charikar: Similarity estimation techniques from rounding algorithms. STOC 2002: 380-388 • P. Indyk, R. Motwani: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. STOC 1998: 604-613. • A. Gionis, P. Indyk, R. Motwani: Similarity Search in High Dimensions via Hashing. VLDB 1999: 518-529 • M. R. Henzinger: Finding near-duplicate web pages: a large-scale evaluation of algorithms. SIGIR 2006: 284-291 • G. S. Manku,  A. Jain , A. Das Sarma: Detecting near-duplicates for web crawling. WWW 2007: 141-150

More Related