论文信息 - Approximate Computation of Object Distances by Locality-Sensitive Hashing

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.

Dan A. Simovici | Selim Mimaroglu

[1] Robin Sibson,et al. SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method , 1973, Comput. J..

[2] R. Sokal,et al. THE COMPARISON OF DENDROGRAMS BY OBJECTIVE METHODS , 1962 .

[3] Piotr Indyk,et al. Similarity Search in High Dimensions via Hashing , 1999, VLDB.

[4] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[5] Hisashi Koga,et al. Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing , 2007, Knowledge and Information Systems.

[6] Piotr Indyk,et al. Scalable Techniques for Clustering the Web , 2000, WebDB.