b-Bit Minwise Hashing in Practice
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Abstract
Minwise hashing is a standard technique in the context of search for
approximating set similarities. The recent work [26, 32] demon-
strated a potential use of b-bit minwise hashing [23, 24] for ef-
ficient search and learning on massive, high-dimensional, binary
data (which are typical for many applications in Web search and
text mining). In this paper, we focus on a number of critical is-
sues which must be addressed before one can apply b-bit minwise
hashing to the volumes of data often used industrial applications.
Journal / Series
Volume & Issue
Description
Sponsorship
NSF Grant #1131848.
Date Issued
2013-10
Publisher
Fifth Asia-Pacific Symposium on Internetware
Keywords
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
Ping Li, Anshumali Shrivastava and Arnd Christian König. b-Bit Minwise Hashing in Practice. Internetware 2013. October 2013.
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
preprint