Taming Uncertainty

Sahil's Notepad

June, 2008

  • Taming Uncertainty

    Locality Sensitive Hashing (LSH) and Min Hash

    • 4 Comments
    [Indyk-Motwani’98] Many distance related questions (nearest neighbor, closest x, ..) can be answered more efficiently by using locality sensitive hashing, where the main idea is that similar objects hash to the same bucket.   LSH function:...
  • Taming Uncertainty

    Set Similarity and Min Hash

    • 4 Comments
    Given two sets S1, S2, find similarity(S1, S2) - based not hamming distance (not Euclidean). Jaccard Measure View sets at a bit-array. Indexes representing each possible element, and 1/0 representing presence/absence of the element in the set. Then Jaccard...
Page 1 of 1 (2 items)