Kernel discriminant analysis for positive definite and indefinite kernels.
Kernel methods are a class of well established and successful algorithms for pattern analysis thanks to their mathematical elegance and good performance. Numerous nonlinear extensions of pattern recognition techniques have been proposed so far based on the so-called kernel trick. The objective of this paper is twofold. First, we derive an additional kernel tool that is still missing, namely kernel quadratic discriminant (KQD). We discuss different formulations of KQD based on the regularized kernel Mahalanobis distance in both complete and class-related subspaces. Secondly, we propose suitable extensions of kernel linear and quadratic discriminants to indefinite kernels. We provide classifiers that are applicable to kernels defined by any symmetric similarity measure. This is important in practice because problem-suited proximity measures often violate the requirement of positive definiteness. As in the traditional case, KQD can be advantageous for data with unequal class spreads in the kernel-induced spaces, which cannot be well separated by a linear discriminant. We illustrate this on artificial and real data for both positive definite and indefinite kernels.
School of Computer Science, University of Manchester, Oxford Road, M13 9PL Manchester, UK. pekalska@cs.man.ac.uk
Elzbieta
E
Pekalska
Bernard
B
Haasdonk
D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D016002:Discriminant Analysis; D008962:Models, Theoretical; D010363:Pattern Recognition, Automated / Q000379:methods*