Work

Hash Kernels for Structured Data

Year: 2009
Type: article
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
Language: English
Open Access status: green
OpenAlex ID: W2112490010
FWCI: 10.85
Cites: 31
Cited by: 215
Related to: 10