Approximate Computation of Object Distances by Locality-Sensitive Hashing

We propose an approximate computation technique for inter-object distances for binary data sets. Our approach is based on the locality sensitive hashing, scales up with the number of objects and is much faster than the "brute-force" computation of these distances.

• Type: Conference
• Year: 2008
• Where: DMIN
• Authors: Selim Mimaroglu, Dan A. Simovici
• Keywords: Approximate Computation Technique, Binary Data Sets, Data Mining, DMIN 2008, Locality Sensitive Hashing