Ping Li and Arnd Christian König
26 April 2010
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, computational advertising, etc.
By only storing b bits of each hashed value (e.g., b = 1 or 2), we gain substantial advantages in terms of 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 b = 64 (or b = 32), if one is interested in resemblance > 0.5. Our theoretical results are validated using a proprietary collection of 106 news articles and a public dataset of 300.000 articles.
|Published in||Nineteenth International World Wide Web Conference (WWW 2010)|
|Publisher||Association for Computing Machinery, Inc.|
Copyright © 2007 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or firstname.lastname@example.org. The definitive version of this paper can be found at ACM’s Digital Library --http://www.acm.org/dl/.
Ping Li, Arnd Christian König, and Wenhao Gui. b-Bit Minwise Hashing for Estimating Three-Way Similarities, 6 December 2010.
Ping Li and Arnd Christian König. Theory and Applications of b-Bit Minwise Hashing, Communications of the ACM, ACM, August 2011.