Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

DMIN
2008

favoriteEmaildiscussreport

147views Data Mining» more DMIN 2008»

Approximate Computation of Object Distances by Locality-Sensitive Hashing

13 years 5 months ago

Approximate Computation of Object Distances by Locality-Sensitive Hashing

Download www.cs.umb.edu

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.

Selim Mimaroglu, Dan A. Simovici

Real-time Traffic

Approximate Computation Technique | Binary Data Sets | Data Mining | DMIN 2008 | Locality Sensitive Hashing |

claim paper

Related Content

» Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3DSignature Space Estimat...

» Kernelized LocalitySensitive Hashing for Scalable Image Search

» Bilevel Locality Sensitive Hashing for kNearest Neighbor Computation

» Lower bounds on locality sensitive hashing

» Query adaptative locality sensitive hashing

» Bounded LSH for Similarity Search in PeertoPeer File Systems

» Similarity search and locality sensitive hashing using ternary content addressable memorie...

» Locality sensitive hash functions based on concomitant rank order statistics

» Similarity estimation techniques from rounding algorithms

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	DMIN
Authors	Selim Mimaroglu, Dan A. Simovici

Comments (0)