Skip navigation
Skip navigation
The system will be down for maintenance between 8:00 and 8:15am on Thursday 13, December 2018

Hash kernels

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


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.

CollectionsANU Research Publications
Date published: 2009
Type: Conference paper
Source: Proceedings of International Conference on Artificial Intelligence and Statistics (AISTATS 2009)


File Description SizeFormat Image
01_Shi_Hash_kernels_2009.pdf1.27 MBAdobe PDF    Request a copy
02_Shi_Hash_kernels_2009.pdf62.26 kBAdobe PDF    Request a copy
03_Shi_Hash_kernels_2009.pdf37.5 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  27 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator