Kernel optimization in discriminant analysis
| Autor: | Aleix M. Martinez, Di You, Onur C. Hamsici |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
Databases
Factual Kernel principal component analysis Article Pattern Recognition Automated String kernel Artificial Intelligence Image Interpretation Computer-Assisted Computer Simulation Mathematics Models Statistical business.industry Applied Mathematics Discriminant Analysis Pattern recognition Bayes Theorem Fractals Computational Theory and Mathematics Nonlinear Dynamics Variable kernel density estimation Kernel embedding of distributions Kernel (statistics) Radial basis function kernel Computer Vision and Pattern Recognition Artificial intelligence Tree kernel Kernel Fisher discriminant analysis business Algorithms Software |
| Zdroj: | IEEE transactions on pattern analysis and machine intelligence. 33(3) |
| ISSN: | 1939-3539 |
| Popis: | Kernel mapping is one of the most used approaches to intrinsically derive nonlinear classifiers. The idea is to use a kernel function which maps the original nonlinearly separable problem to a space of intrinsically larger dimensionality where the classes are linearly separable. A major problem in the design of kernel methods is to find the kernel parameters that make the problem linear in the mapped representation. This paper derives the first criterion that specifically aims to find a kernel representation where the Bayes classifier becomes linear. We illustrate how this result can be successfully applied in several kernel discriminant analysis algorithms. Experimental results, using a large number of databases and classifiers, demonstrate the utility of the proposed approach. The paper also shows (theoretically and experimentally) that a kernel version of Subclass Discriminant Analysis yields the highest recognition rates. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|