Please use this identifier to cite or link to this item:
|Citation:||Proceedings of the 12th International Conference on Artificial Intelligence and Statistics (AISTATS) 2009, JMLR: W&CP 5, vol. 5: 496-503|
|Conference Name:||International Conference on Artificial Intelligence and Statistics (12th : 2009 : Clearwater Beach, Florida, USA)|
|Qinfeng Shi, James Petterson, Gideon Dror, John Langford, Alex Smola, Alex Strehl and Vishy Vishwanathan|
|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.|
|Rights:||Copyright 2009 by the authors|
|Appears in Collections:||Aurora harvest 5|
Computer Science publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.