A Kernel optimization method based on the localized Kernel Fisher criterion

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

Abstract

It is wildly recognized that whether the selected kernel matches the data controls the performance of kernel-based methods, Ideally it is expected that the data is linearly separable in the kernel induced feature space, therefore, Fisher linear discriminant criterion can be used as a kernel optimization rule. However, the data may not be linearly separable even after kernel transformation in many applications, a nonlinear classifier is preferred in this case, and obviously the Fisher criterion is not the best choice as a kernel optimization rule, Motivated by this issue, in this paper we present a novel kernel optimization method by maximizing the local class linear separability in kernel space to increase the local margins between embedded classes via localized kernel Fisher criterion, by which the classification performance of nonlinear classifier in the kernel induced feature space can be improved. Extensive experiments are carried out to evaluate the efficiency of the proposed method. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Chen, B., Liu, H., & Bao, Z. (2006). A Kernel optimization method based on the localized Kernel Fisher criterion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3971 LNCS, pp. 915–921). Springer Verlag. https://doi.org/10.1007/11759966_134

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