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

Thumbnail Image

Date

2009

Authors

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

Journal Title

Journal ISSN

Volume Title

Publisher

Society for Artificial Intelligence and Statistics

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.

Description

Keywords

Keywords: Data stream; Feature space; Kernel matrices; Software engineering; Artificial intelligence

Citation

URI

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

Collections

ANU Research Publications

Source

Proceedings of International Conference on Artificial Intelligence and Statistics (AISTATS 2009)

Type

Conference paper

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

2037-12-31

Downloads

File
Description
01_Shi_Hash_kernels_2009.pdf (1.24 MB)
02_Shi_Hash_kernels_2009.pdf (62.26 KB)
03_Shi_Hash_kernels_2009.pdf (37.5 KB)

DSpace software copyright © 2002-2026 LYRASIS