Hash Kernels for Structured Data
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
|Collections||ANU Research Publications|
|Source:||Journal of Machine Learning Research|
|01_Shi_Hash_Kernels_for_Structured_2009.pdf||656.42 kB||Adobe PDF|
|02_Shi_Hash_Kernels_for_Structured_2009.pdf||29.59 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.