Feature Hashing for Large Scale Multitask Learning

The theory of probabilities

Bernstein][1946]Bernstein46 Bernstein, S. (1946) · 1946

Earlier work this paper cites.

Similarity search in high dimensions via hashing

Gionis et al.][1999]GioIndMot99 Gionis, A., Indyk, P., & Motwani, R. (1999) · 1999

Earlier work this paper cites.

The concentration of measure phenomenon

Ledoux][2001]Ledoux01 Ledoux, M. (2001) · 2001

Earlier work this paper cites.

Database-friendly random projections: Johnson-lindenstrauss with binary coins

Achlioptas][2003]Achlioptas03 Achlioptas, D. (2003) · 2003

Earlier work this paper cites.

Problems and results in extremal combinatorics, Part I

Alon][2003]alon2003par Alon, N. (2003) · 2003

Earlier work this paper cites.

An improved data stream summary: The count-min sketch and its applications

Cormode and Muthukrishnan][2004]CorMut04 Cormode, G., & Muthukrishnan, M. (2004) · 2004

Earlier work this paper cites.

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

Ailon and Chazelle][2006]ailon2006ann Ailon, N., & Chazelle, B. (2006) · 2006

Earlier work this paper cites.

The Netflix Prize

Bennett and Lanning][]netflix Bennett, J., & Lanning, S · 2007

Cited alongside, same era.

Vowpal wabbit online learning project

Langford et al.][2007]LaLiSt07 Langford, J., Li, L., & Strehl, A. (2007) · 2007

Cited alongside, same era.

Conditional random sampling: A sketch-based sampling technique for sparse data

Li et al.][2007]LiChuHas07 Li, P., Church, K., & Hastie, T. (2007) · 2007

Cited alongside, same era.

Fast dimension reduction using Rademacher series on dual BCH codes

Ailon and Liberty][2008]ailon2008fdr Ailon, N., & Liberty, E. (2008) · 2008

Cited alongside, same era.

Small statistical models by random feature mixing

Ganchev and Dredze][2008]GanchevDredze08 Ganchev, K., & Dredze, M. (2008) · 2008

Cited alongside, same era.

Dense fast random projections and lean Walsh transforms

Liberty et al.][2008]liberty2008dfr Liberty, E., Ailon, N., & Singer, A. (2008) · 2008

Cited alongside, same era.

On variants of the Johnson–Lindenstrauss lemma

Matousek][2008]matousek2008vjl Matousek, J. (2008) · 2008

Later among the works it cites.

Random features for large-scale kernel machines

Rahimi and Recht][2008]RahRec08 Rahimi, A., & Recht, B. (2008) · 2008

Later among the works it cites.

Randomized kitchen sinks

Rahimi and Recht][2009]RahRec09 Rahimi, A., & Recht, B. (2009) · 2009

Closest in time.

Hash kernels

Shi et al.][2009]Shietal09 Shi, Q., Petterson, J., Dror, G., Langford, J., Smola, A., Strehl, A., & Vishwanathan, V. (2009) · 2009

Closest in time.

Feature hashing for large scale multitask learning

Weinberger et al.][2009]weinberger2009fhl Weinberger, K., Dasgupta, A., Attenberg, J., Langford, J., & Smola, A. (2009) · 2009

Closest in time.

A Sparse Johnson Lindenstrauss Transform

Dasgupta et al.][2010]dsr2010sparse Dasgupta, A., Sarlos, T., & Kumar, R. (2010) · 2010

Closest in time.