An Efficient Classifier: Kernel SVM-LDA

Abstract

This study aims at designing an efficient combinatorial classifier, which fuses linear discriminant analysis (LDA) and kernel support vector machine (SVM) classifiers. The proposed method is called kernel SVM-LDA which benefits from global property of LDA, simultaneous with localized capability of SVM along with mapping ability of RBF kernel to project input data into a more separable high dimensional space. To assess the proposed scheme, Kernel SVM-LDA was applied to some standard datasets derived from UCI database and then compared to standard LDA and kernel SVM classifiers. Kernel SVM-LDA was also employed in cue-based brain computer interface to classify the left and right imagery movements. The results indicate that the introduced method is more superior to that of LDA and kernel SVM because it surpasses the counterparts in terms of robustness, complexity and performance.