Revision as of 16:43, 3 April 2009 edit 128.30.51.105 (talk) corrected typo (h works on points) ← Previous edit		Revision as of 18:35, 5 April 2009 edit undo Fyedernoggersnodden (talk \| contribs) 127 edits →Random Projection Next edit →
Line 113: ===Random Projection=== The random projection method of LSH 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 <math>r</math>) at the outset and use the hyperplane to hash input vectors. Given an input vector <math>v</math> and a hyperplane defined by <math>r</math>, we let <math>h(v) = sgn(v \cdot r)</math>. That is, <math>h(v) = \pm 1</math> depending on which side of the hyperplane <math>v</math> lies.

Locality-sensitive hashing: Difference between revisions