Hash Kernels for Structured Data

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

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Hash Kernels for Structured Data

Date

2009

Authors

Shi, Qinfeng

Petterson, James

Dror, Gideon

Langford, John

Smola, Alexander

Vishwanathan, S.V.N.

Publisher

MIT Press

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

URI

http://hdl.handle.net/1885/57316

Collections

Open Access Research

Source

Journal of Machine Learning Research

Type

Journal article

Restricted until

2037-12-31

Downloads

File

Description

01_Shi_Hash_Kernels_for_Structured_2009.pdf (656.42 KB)

02_Shi_Hash_Kernels_for_Structured_2009.pdf (29.59 KB)

Full item page

Cultural advice

Hash Kernels for Structured Data

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Keywords

Citation

URI

Collections

Source

Type

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

Downloads