Hash Kernels

Qinfeng Shi, James Petterson, Gideon Dror, John Langford, Alex Smola, Alex Strehl, S. V. N. Vishwanathan

AISTATS 2009 pp. 496-503

/aistats/2009/shi2009aistats-hash/

Abstract

We propose hashing to facilitate efficient kernels. This generalizes previous work using sampling and we show a principled way to compute the kernel matrix for data streams and sparse feature spaces. Moreover, we give deviation bounds from the exact kernel matrix. This has applications to estimation on strings and graphs.

PDF AISTATS Semantic Scholar

Cite

Text

Shi et al. "Hash Kernels." Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics, 2009.

Markdown

[Shi et al. "Hash Kernels." Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics, 2009.](https://mlanthology.org/aistats/2009/shi2009aistats-hash/)

BibTeX

@inproceedings{shi2009aistats-hash,
  title     = {{Hash Kernels}},
  author    = {Shi, Qinfeng and Petterson, James and Dror, Gideon and Langford, John and Smola, Alex and Strehl, Alex and Vishwanathan, S. V. N.},
  booktitle = {Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics},
  year      = {2009},
  pages     = {496-503},
  volume    = {5},
  url       = {https://mlanthology.org/aistats/2009/shi2009aistats-hash/}
}