Fast regularized kernel function approximation

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a simple formulation for regularized kernel function approximation. The regression function is obtained by minimizing an unconstrained quadratic function. Further reduced kernel technique is also employed in its formulation which enables it to handle large database. The solution of this objective function is obtained by solving a system of linear equations and thus no need for any quadratic programming problem solver. Its simple MATLAB implementation is also very fast. Computational results on artificial and real world data sets and comparisons are given to demonstrate the fast training time and low prediction error of the proposed formulation.

Cite

CITATION STYLE

APA

Ghorai, S., Mukherjee, A., & Dutta, P. K. (2008). Fast regularized kernel function approximation. In IEEE Region 10 Annual International Conference, Proceedings/TENCON. https://doi.org/10.1109/TENCON.2008.4766523

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free