Kernelmatching pursuit for large datasets

Abstract

Kernel matching pursuit is a greedy algorithm for building an approximation of a discriminant function as a linear combination of some basis functions selected from a kernel-induced dictionary. Here we propose a modification of the kernel matching pursuit algorithm that aims at making the method practical for large datasets. Starting from an approximating… (More)

Topics

1 Figure or Table

Slides referencing similar topics