activity
20092012
most citedb-Bit Minwise Hashing in Practice: Large-Scale Batch and Online Learning and Using GPUs for Fast Preprocessing with Simple Hash Functions

5 citations · 23 across the 8 of their papers we have counts for

collaborators
Showing 2011Show all

5 papers · 1 filter

cs.DB2011

A Statistical Approach Towards Robust Progress Estimation

Arnd Christian König, Bolin Ding, Surajit Chaudhuri +1

The need for accurate SQL progress estimation in the context of decision support administration has led to a number of techniques proposed for this task. Unfortunately, no single o…

cs.LG2011★ 3 cited

Training Logistic Regression and SVM on 200GB Data Using b-Bit Minwise Hashing and Comparisons with Vowpal Wabbit (VW)

Ping Li, Anshumali Shrivastava, Christian Konig

We generated a dataset of 200 GB with 10^9 features, to test our recent b-bit minwise hashing algorithms for training very large-scale logistic regression and SVM. The results conf…

stat.ML2011★ 5 cited

Accurate Estimators for Improving Minwise Hashing and b-Bit Minwise Hashing

Ping Li, Christian Konig

Minwise hashing is the standard technique in the context of search and databases for efficiently estimating set (e.g., high-dimensional 0/1 vector) similarities. Recently, b-bit mi…

cs.LG2011★ 3 cited

b-Bit Minwise Hashing for Large-Scale Linear SVM

Ping Li, Joshua Moore, Christian Konig

In this paper, we propose to (seamlessly) integrate b-bit minwise hashing with linear SVM to substantially improve the training (and testing) efficiency using much smaller memory,…

cs.DB2011

Fast Set Intersection in Memory

Bolin Ding, Arnd Christian König

Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their inte…