Generalized Discriminant Analysis Using a Kernel Approach
G. Baudat, F. Anouar · Neural Computation · 2000
We present a new method that we call generalized discriminant analysis (GDA) to deal with nonlinear discriminant analysis using kernel function operator. The underlying theory is close to the support vector machines (SVM) insofar as the GDA method provides a mapping of the input vectors into high-dimensional feature space. In the transformed space, linear properties make it easy to extend and generalize the classical linear discriminant analysis (LDA) to nonlinear discriminant analysis. The formulation is expressed as an eigenvalue problem resolution. Using a different kernel, one can cover a wide class of nonlinearities. For both simulated data and alternate kernels, we give classification results, as well as the shape of the decision function. The results are confirmed using real data to perform seed classification.
Cited by 1,673 works. doi:10.1162/089976600300014980
Authors
References
- The Nature of Statistical Learning Theory
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
- Introduction to Statistical Pattern Recognition
- A training algorithm for optimal margin classifiers
- Self-Organizing Maps
- A Tutorial on Support Vector Machines for Pattern Recognition
- Nonlinear Component Analysis as a Kernel Eigenvalue Problem
- Theoretical Foundations of the Potential Function Method in Pattern Recognition Learning
- Introduction to statistical pattern recognition (2nd ed.)
- Automation and Remote Control