A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In this paper we recall two kernel methods for discriminant analysis. The first one is the kernel counterpart of the ubiquitous Linear Discriminant Analysis (Kernel-LDA), while the second one is a method we named Kernel Springy Discriminant Analysis (Kernel-SDA). It seeks to separate classes just as Kernel-LDA does, but by means of defining attractive and repulsive forces. First we give technical details about these methods and then we employ them on phoneme classification tasks. We demonstratedoi:10.1007/11427445_58 fatcat:eu6qfehmpfdsnnujof72mzwdwu