Reformative nonlinear feature extraction using kernel MSE

In this paper, we propose an efficient nonlinear feature extraction method using kernel-based minimum squared error (KMSE). This improved method is referred to as reformative KMSE (RKMSE). In RKMSE, we use a linear combination of a small portion of samples that are selected from the training sample set, i.e. ''significant nodes'', to approximate to the transform vector of KMSE in kernel space. As a result, RKMSE is much superior to naive KMSE in computational efficiency of feature extraction. Experimental results on several benchmark datasets illustrate that RKMSE can efficiently classify the data with high recognition correct rate.

[1]  David Zhang,et al.  A method for speeding up feature extraction based on KPCA , 2007, Neurocomputing.

[2]  Sheng Chen,et al.  Sparse kernel regression modeling using combined locally regularized orthogonal least squares and D-optimality experimental design , 2003, IEEE Trans. Autom. Control..

[3]  Nello Cristianini,et al.  Kernel Methods: A Paradigm for Pattern Analysis , 2006 .

[4]  Jing-Yu Yang,et al.  An efficient kernel-based nonlinear regression method for two-class classification , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[5]  Jian Yang,et al.  A reformative kernel Fisher discriminant analysis , 2004, Pattern Recognit..

[6]  Xuegong Zhang,et al.  Kernel MSE algorithm: a unified framework for KFD, LS-SVM and KRR , 2001, IJCNN'01. International Joint Conference on Neural Networks. Proceedings (Cat. No.01CH37222).

[7]  Yang Jing-yu,et al.  A Fast Kernel-Based Nonlinear Discriminant Analysis Method , 2005 .

[8]  S. Chen,et al.  Kernel-based data modelling using orthogonal least squares selection with local regularisation , 2001 .

[9]  B. Scholkopf,et al.  Fisher discriminant analysis with kernels , 1999, Neural Networks for Signal Processing IX: Proceedings of the 1999 IEEE Signal Processing Society Workshop (Cat. No.98TH8468).