Please use this identifier to cite or link to this item:
|Title:||Hash Kernels for Structured Data|
|Citation:||Journal of Machine Learning Research (Print), 2009; 10:2615-2637|
|Qinfeng Shi, James Petterson, Gideon Dror, John Langford, Alex Smola and S.V.N. 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|
|Keywords:||hashing, stream, string kernel, graphlet kernel, multiclass classification|
|Rights:||© 2009 Authors. Copyright © JMLR 2009. All rights reserved.|
|Appears in Collections:||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.