文献类型：期刊文献

英文题名：An efficient Kernel-based matrixized least squares support vector machine

作者：Wang, Zhe[1];He, Xisheng[2];Gao, Daqi[1];Xue, Xiangyang[2]

机构：[1]E China Univ Sci & Technol, Dept Comp Sci & Engn, Shanghai 200237, Peoples R China;[2]Fudan Univ, Coll Comp Sci, Shanghai 200433, Peoples R China

年份：2013

卷号：22

期号：1

起止页码：143

外文期刊名：NEURAL COMPUTING & APPLICATIONS

收录：;EI(收录号：20130215895569);WOS:【SCI-EXPANDED(收录号:WOS:000313062100016)】；

基金：The authors would like to thank Natural Science Foundations of China under Grant No. 60903091, and the Specialized Research Fund for the Doctoral Program of Higher Education under Grant No. 20090074120003 for partial support. This work is also supported by the Open Projects Program of National Laboratory of Pattern Recognition.

语种：英文

外文关键词：Least squares support vector machine; Kernel-based method; Matrix pattern; Ensemble learning; Classifier design

摘要：Matrix-pattern-oriented linear classifier design has been proven successful in improving classification performance. This paper proposes an efficient kernelized classifier for Matrixized Least Square Support Vector Machine (MatLSSVM). The classifier is realized by introducing a kernel-induced distance metric and a majority-voting technique into MatLSSVM, and thus is named Kernel-based Matrixized Least Square Support Vector Machine (KMatLSSVM). Firstly, the original Euclidean distance for optimizing MatLSSVM is replaced by a kernel-induced distance, then different initializations for the weight vectors are given and the correspondingly generated sub-classifiers are combined with the majority vote rule, which can expand the solution space and mitigate the local solution of the original MatLSSVM. The experiments have verified that one iteration is enough for each sub-classifier of the presented KMatLSSVM to obtain a superior performance. As a result, compared with the original linear MatLSSVM, the proposed method has significant advantages in terms of classification accuracy and computational complexity.