Hash kernels

Qinfeng Shi*, James Petterson, Gideon Dror, John Langford, Alex Smola, Alex Strehl, Vishy Vishwanathan

*Corresponding author for this work

    Research output: Contribution to journalConference articlepeer-review

    41 Citations (Scopus)

    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.

    Original languageEnglish
    Pages (from-to)496-503
    Number of pages8
    JournalJournal of Machine Learning Research
    Volume5
    Publication statusPublished - 2009
    Event12th International Conference on Artificial Intelligence and Statistics, AISTATS 2009 - Clearwater, FL, United States
    Duration: 16 Apr 200918 Apr 2009

    Fingerprint

    Dive into the research topics of 'Hash kernels'. Together they form a unique fingerprint.

    Cite this