We study the use of kernel subspace methods that learn low-dimensional subspace representations for classification tasks. In particular, we propose a new method called kernel weighted nonlinear discriminant analysis (KWNDA) which possesses several appealing properties. First, like all kernel methods, it handles nonlinearity in a disciplined manner that is also computationally attractive. Second, by introducing weighting functions into the discriminant criterion, it outperforms existing kernel discriminant analysis methods in terms of the classification accuracy. Moreover, it also effectively deals with the small sample size problem. We empirically compare different subspace methods with respect to their classification performance of facial images based on the simple nearest neighbor rule. Experimental results show that KWNDA substantially outperforms competing linear as well as nonlinear subspace methods.
Nonlinear dimensionality reduction for classification using kernel weighted subspace method
01.01.2005
261083 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Nonlinear Dimensionality Reduction for Classification using Kernel Weighted Subspace Method
British Library Conference Proceedings | 2005
|Multiple Similarities Based Kernel Subspace Learning for Image Classification
British Library Conference Proceedings | 2006
|Kernel-Based Adaptive-Subspace Self-Organizing Map As A Nonlinear Subspace Pattern Recognition
British Library Conference Proceedings | 2004
|Coupled kernel-based subspace learning
IEEE | 2005
|Riemannian Manifold Learning for Nonlinear Dimensionality Reduction
British Library Conference Proceedings | 2006
|