← Back to papers
2009 JMLR JMLR 2009

Hash Kernels for Structured Data

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. [abs] [ pdf ][ bib ] © JMLR 2009. (edit, beta)

🧭 Keyword Pioneer — hash kernel
🐣 Hot Topic Early Bird — structured datum
🐝 Cross-Pollinator — Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio

Authors

Qinfeng Shi , James Petterson , Gideon Dror , John Langford , Alex Smola , S.v.n. Vishwanathan

Topics

Machine Learning > Core Methods > Classification Machine Learning > Core Methods > Metric Learning

Keywords

graph kernel structured datum string kernel kernel methods hash kernel
Download PDF

Related papers

Subgroup Analysis via Recursive Partitioning 2009
A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization 2009
An Analysis of Convex Relaxations for MAP Estimation of Discrete MRFs 2009
Nonextensive Information Theoretic Kernels on Measures 2009
The Hidden Life of Latent Variables: Bayesian Learning with Mixed Graph Models 2009