A new combined KSVM and KFD model for classification and recognition

The Kernel Support Vector Machine (KSVM) is a powerful nonlinear classification methodology where, the Support Vectors (SVs) fully describe the decision surface by incorporating local information in the Kernel space. On the other hand, the Kernel Fisher Discriminant(KFD) is a non-linear classifier which has proven to be powerful and competitive to several state-of-the-art classifiers. This paper proposes a novel KSVM + KFD model which combines these two methods. This model can be viewed as an extension to the KSVM by incorporating 'global' characteristics of the data to estimate the decision boundary in the Kernel space. On the other hand, this new model could also be considered as an improvement to the KFD by incorporating the Support Vectors (local margin concept) into the KFD formulation. The KSVM + KFD model can be reduced to the classical KSVM model so that existing KSVM software can be used for easy implementation. An extensive comparison of the KSVM + KFD to the KFD, KSVM, Linear Discriminant Analysis (LDA), Linear Support Vector Machine (LSVM) and the combined LSVM and LDA, performed on real data sets, has shown the advantages of our proposed model. In particular, the experiments on face recognition have clearly shown the superiority of the KSVM + KFD over other methods.

[1]  Anthony Widjaja,et al.  Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond , 2003, IEEE Transactions on Neural Networks.

[2]  David J. Kriegman,et al.  The yale face database , 1997 .

[3]  David G. Stork,et al.  Pattern Classification , 1973 .

[4]  Gunnar Rätsch,et al.  Soft Margins for AdaBoost , 2001, Machine Learning.

[5]  Sebastian Mika,et al.  Kernel Fisher Discriminants , 2003 .

[6]  Thomas M. Cover,et al.  Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition , 1965, IEEE Trans. Electron. Comput..

[7]  Man Lung Yiu,et al.  Iterative projected clustering by subspace mining , 2005, IEEE Transactions on Knowledge and Data Engineering.

[8]  Hua Yu,et al.  A direct LDA algorithm for high-dimensional data - with application to face recognition , 2001, Pattern Recognit..

[9]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[10]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[11]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[12]  David G. Stork,et al.  Pattern classification, 2nd Edition , 2000 .

[13]  Tao Xiong,et al.  A combined SVM and LDA approach for classification , 2005, Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005..

[14]  Nello Cristianini,et al.  An Introduction to Support Vector Machines and Other Kernel-based Learning Methods , 2000 .

[15]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[16]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .