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

• 制导、导航与控制 • 上一篇    下一篇

原空间中最小二乘支持向量机的新算法

赵永平, 孙健国   

  1. 南京航空航天大学能源与动力学院, 江苏, 南京, 210016
  • 收稿日期:2007-09-06 修回日期:2008-03-26 出版日期:2009-01-20 发布日期:2010-01-03
  • 作者简介:赵永平(1982- ),男,博士研究生,主要研究方向为机器学习,控制理论和控制方法.E-mail:Y.P.zhao@nuaa.edu.cn
  • 基金资助:
    国家自然科学基金资助课题(50576033)

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-20 Published:2010-01-03

摘要: 为了解决原空间中最小二乘支持向量机的解缺乏稀疏性的缺点,提出了Pruning法、MFCV法和IMFCV法并对BDFS法进行了修改和运用。对一个不含有奇异点的系统而言,Pruning法、BDFS法和MFCV法在一定程度上都能实现原空间中最小二乘支持向量机解的稀疏性。BDFS法无论是训练时间还是预测时间都比Pruning法短;和MFCV法比起来,虽然BDFS法的训练时间短,但比MFCV的预测时间长。对一个含有奇异点的系统而言,Pruning法几乎失去了效用;虽然BDFS和MFCV法的训练时间都比IMFCV法的训练时间短,但IMFCV法能成功抑制奇异点从而缩短预测时间。

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.

中图分类号: