b-Bit Minwise Hashing

Details b-Bit Minwise Hashing b-Bit Minwise Hashing

2009-10-18

arxiv.org/abs/0910.3349v1

Computer Science

Data Structures and Algorithms

Scientific paper

This paper establishes the theoretical framework of b-bit minwise hashing. The original minwise hashing method has become a standard technique for estimating set similarity (e.g., resemblance) with applications in information retrieval, data management, social networks and computational advertising. By only storing the lowest $b$ bits of each (minwise) hashed value (e.g., b=1 or 2), one can gain substantial advantages in terms of computational efficiency and storage space. We prove the basic theoretical results and provide an unbiased estimator of the resemblance for any b. We demonstrate that, even in the least favorable scenario, using b=1 may reduce the storage space at least by a factor of 21.3 (or 10.7) compared to using b=64 (or b=32), if one is interested in resemblance > 0.5.

Affiliated with

Also associated with

No associations

Rating

b-Bit Minwise Hashing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with b-Bit Minwise Hashing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and b-Bit Minwise Hashing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-720493