Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (01): 142-145,237.

Previous Articles     Next Articles

New method for least squares support vector machine in the primal

ZHAO Yong-ping, SUN Jian-guo   

  1. Coll. of Energy and Power Engineering, Nanjing Univ. of Aeronautics and Astronautics, Nanjing 210016, China
  • Received:2007-09-06 Revised:2008-03-26 Online:2009-01-25 Published:2010-01-03

Abstract: In order to solve the shortcoming of lacking sparseness in the solution of least squares support vector machine in the primal,the pruning method,multi-fold cross validation(MFCV) method and improved multi-fold cross validation(IMFCV) method are proposed and the backward deletion feature selection(BDFS) method is modified and applied.These methods all realize the sparseness of the least squares support vector machine to a certain degree in the primal for a system without outliers.The predicted time of BDFS is shorter than the pruning’s;although the training time of BDFS is shorter than MFCV’s,its predicted time is longer.In the face of a system with outliers,the pruning almost loses effectiveness,and the training time of BDFS and MFCV are both shorter than IMFCV’s,but IMFCV can oppress outliers and reduces the predicted time remarkably.

CLC Number: 

[an error occurred while processing this directive]