CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2011 vol.33 Issue No.03 - March
Issue No.03 - March (2011 vol.33)
Di You , The Ohio State University, Columbus
Onur C. Hamsici , The Ohio State University, Columbus
Aleix M. Martinez , The Ohio State University, Columbus
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.
Kernel functions, kernel optimization, feature extraction, discriminant analysis, nonlinear classifiers, face recognition, object recognition, pattern recognition, machine learning.
Di You, Onur C. Hamsici, Aleix M. Martinez, "Kernel Optimization in Discriminant Analysis", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.33, no. 3, pp. 631-638, March 2011, doi:10.1109/TPAMI.2010.173