Locality-sensitive hashing: Difference between revisions

Revision as of 16:37, 12 May 2023

Revision as of 16:47, 12 May 2023

Line 227:

| citeseerx = 10.1.1.226.6905

| s2cid = 6468963

}}</ref>) uses an approximation of the [[cosine distance]] between vectors. The technique was used to approximate the NP-complete [[Maximum_cutmaximum cut|MAXmax-CUTcut]] problem.<ref name=Charikar2002 />

The basic idea of this technique is to choose a random [[hyperplane]] (defined by a normal unit vector {{mvar|r}}) at the outset and use the hyperplane to hash input vectors.