On the generalization of kernel machines

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

Abstract

Taking advantage of the linear properties in high dimensional spaces, a general kind of kernel machines is formulated under a unified framework. These methods include KPCA, KFD and SVM. The theoretical framework will show a strong connection between KFD and SVM. The main practical result under the proposed framework is the solution of KFD for an arbitrary number of classes. The framework allows also the formulation of multiclass-SVM. The main goal of this article is focused in finding new solutions and not in the optimization of them.

Cite

CITATION STYLE

APA

Navarrete, P., & Del Solar, J. R. (2002). On the generalization of kernel machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2388, pp. 24–39). Springer Verlag. https://doi.org/10.1007/3-540-45665-1_3

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