Skip navigation
Skip navigation

Hash Kernels for Structured Data

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

Description

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: Journal article
URI: http://hdl.handle.net/1885/57316
Source: Journal of Machine Learning Research

Download

File Description SizeFormat Image
01_Shi_Hash_Kernels_for_Structured_2009.pdf656.42 kBAdobe PDF    Request a copy
02_Shi_Hash_Kernels_for_Structured_2009.pdf29.59 kBAdobe PDF    Request a copy


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

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator