Approximate computation of object distances by locality-sensitive hashing

Proceedings of the 2008 International Conference on Data Mining, DMIN 2008

Volumn , Issue , 2008, Pages 714-718

  Mimaroglu, Selim ^a   Simovici, Dan A ^a  

^a UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE COMPUTATIONS; BINARY DATUM; LOCALITY SENSITIVE HASHING; OBJECT DISTANCES;

INFORMATION MANAGEMENT;

EID: 62649099737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. P. Indyk and R. Motwani, "Approximate nearest neighbors: towards removing the curse of dimensionality," Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp. 604-613, 1998.
2. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," Proceedings of the 25th International Conference on Very Large Data Bases, pp. 518-529, 1999.
3. T. Haveliwala, A. Gionis, and P. Indyk, "Scalable techniques for clustering the web," Proc. of the WebDB Workshop.
4. H. Koga, T. Ishibashi, and T. Watanabe, "Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing," Knowledge and Information Systems, vol. 12, no. 1, pp. 25-53, 2007.
5. R. Sibson, "SLINK: An optimally efficient algorithm for the single-link cluster method," The Computer Journal, vol. 16, no. 1, pp. 30-34, 1973.
6. R. Sokal and F. Rohlf, "The comparison of dendrograms by objective methods," Taxon, vol. 11, no. 1, pp. 30-40, 1962.