Hashing Algorithms for Large-Scale Learning

Details Hashing Algorithms for Large-Scale Learning Hashing Algorithms for Large-Scale Learning

2011-06-06

arxiv.org/abs/1106.0967v1

Statistics

Machine Learning

Scientific paper

In this paper, we first demonstrate that b-bit minwise hashing, whose estimators are positive definite kernels, can be naturally integrated with learning algorithms such as SVM and logistic regression. We adopt a simple scheme to transform the nonlinear (resemblance) kernel into linear (inner product) kernel; and hence large-scale problems can be solved extremely efficiently. Our method provides a simple effective solution to large-scale learning in massive and extremely high-dimensional datasets, especially when data do not fit in memory. We then compare b-bit minwise hashing with the Vowpal Wabbit (VW) algorithm (which is related the Count-Min (CM) sketch). Interestingly, VW has the same variances as random projections. Our theoretical and empirical comparisons illustrate that usually $b$-bit minwise hashing is significantly more accurate (at the same storage) than VW (and random projections) in binary data. Furthermore, $b$-bit minwise hashing can be combined with VW to achieve further improvements in terms of training speed, especially when $b$ is large.

Affiliated with

Also associated with

No associations

Rating

Hashing Algorithms for Large-Scale Learning 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 Hashing Algorithms for Large-Scale Learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hashing Algorithms for Large-Scale Learning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-389080