DeepAI AI Chat
Log In Sign Up

An Average Classification Algorithm

by   Brendan van Rooyen, et al.

Many classification algorithms produce a classifier that is a weighted average of kernel evaluations. When working with a high or infinite dimensional kernel, it is imperative for speed of evaluation and storage issues that as few training samples as possible are used in the kernel expansion. Popular existing approaches focus on altering standard learning algorithms, such as the Support Vector Machine, to induce sparsity, as well as post-hoc procedures for sparse approximations. Here we adopt the latter approach. We begin with a very simple classifier, given by the kernel mean f(x) = 1/n∑_i=i^n y_i K(x_i,x) We then find a sparse approximation to this kernel mean via herding. The result is an accurate, easily parallelized algorithm for learning classifiers.


page 1

page 2

page 3

page 4


Randomized Kernel Methods for Least-Squares Support Vector Machines

The least-squares support vector machine is a frequently used kernel met...

Sparse Approximation of a Kernel Mean

Kernel means are frequently used to represent probability distributions ...

Reliable quantum kernel classification using fewer circuit evaluations

Quantum kernel methods are a candidate for quantum speed-ups in supervis...

Accelerating Kernel Classifiers Through Borders Mapping

Support vector machines (SVM) and other kernel techniques represent a fa...

A Unified View of Localized Kernel Learning

Multiple Kernel Learning, or MKL, extends (kernelized) SVM by attempting...

Learning 2D Gabor Filters by Infinite Kernel Learning Regression

Gabor functions have wide-spread applications in image processing and co...

TV News Commercials Detection using Success based Locally Weighted Kernel Combination

Commercial detection in news broadcast videos involves judicious selecti...