Computational performance optimization of support vector machine based on support vectors

The computational performance of support vector machine (SVM) mainly depends on the size and dimension of training sample set. Because of the importance of support vectors in the determination of SVM classification hyperplane, a kind of method for computational performance optimization of SVM based on support vectors is proposed. On one hand, at the same time of the selection of super-parameters of SVM, according to Karush-Kuhn-Tucker condition and on the precondition of no loss of potential support vectors, we eliminate non-support vectors from training sample set to reduce sample size and thereby to reduce the computation complexity of SVM. On the other hand, we propose a simple intrinsic dimension estimation method for SVM training sample set by analyzing the correlation between number of support vectors and intrinsic dimension. Comparative experimental results indicate the proposed method can effectively improve computational performance. (C) 2016 Elsevier B.V. All rights reserved.