作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2022, Vol. 48 ›› Issue (12): 104-111,118. doi: 10.19678/j.issn.1000-3428.0063542

• 人工智能与模式识别 • 上一篇    下一篇

加权光滑投影孪生支持向量回归算法

徐奔业, 顾斌杰, 潘丰, 熊伟丽   

  1. 江南大学 物联网工程学院, 江苏 无锡 214122
  • 收稿日期:2021-12-15 修回日期:2022-01-24 发布日期:2022-12-07
  • 作者简介:徐奔业(1996—),男,硕士研究生,主研方向为机器学习、模式识别;顾斌杰(通信作者),副教授、博士;潘丰、熊伟丽,教授、博士。
  • 基金资助:
    国家自然科学基金(61773182)。

Weighted Smooth Projection Twin Support Vector Regression Algorithm

XU Benye, GU Binjie, PAN Feng, XIONG Weili   

  1. School of Internet of Things Engineering, Jiangnan University, Wuxi, Jiangsu 214122, China
  • Received:2021-12-15 Revised:2022-01-24 Published:2022-12-07

摘要: 现有双边移位投影孪生支持向量回归(PPTSVR)算法在训练阶段没有考虑不同位置样本对超平面构造的影响,当样本中存在异常点时会降低算法拟合性能。针对该问题,提出一种加权光滑投影孪生支持向量回归算法。采用孤立森林法赋予每个样本不同的权值,并且赋予样本中异常点很小的权值,通过将权值引入算法目标函数,削弱异常点对超平面构造的影响。为直接在原空间中寻求最优超平面,引入正号函数,将有约束优化问题转化为无约束优化问题,并采用Sigmoid光滑函数对目标函数进行光滑处理,证明其任意阶可微且严格凸的特性,进而在原空间中采用牛顿迭代法进行求解。在基准数据集和人工测试函数上的实验结果表明,该算法相比于现有代表性回归算法具备更好的拟合性能和更快的训练速度,尤其当训练样本中存在异常点时,相比于PPTSVR算法拟合性能提升更明显。

关键词: 投影, 孪生支持向量回归, 孤立森林, Sigmoid光滑函数, 牛顿迭代法

Abstract: The existing Pair-shifted Projection Twin Support Vector Regression(PPTSVR) algorithm ignores the effects of samples at different locations on the hyperplane construction during the training process.If there are outliers in the samples, the fitting capacity of the algorithm will be weakened.Therefore, this study proposes a Weighted Smooth Projection Twin Support Vector Regression(WSPTSVR) algorithm.First, an isolation forest approach is utilized to assign different weights to each sample, and the effects of outliers on the hyperplane construction are weakened by assigning tiny weights to them.Second, to find the optimal hyperplane directly in the original space, the algorithm adopts a plus function to convert the constrained optimization problems into unconstrained ones, and utilizes a Sigmoid smooth function to smooth the objective function.It is proved that the objective function is differentiable and strictly convex at any order;then, a Newton iteration method is employed to solve the unconstrained optimization problems in the primal space.Finally, the effectiveness of the proposed algorithm is validated on benchmark datasets and an artificial test function.The experimental results show that the WSPTSVR algorithm outperforms several state-of-the-art algorithms in terms of fitting capacity and training speed.Especially, if there are outliers in the training samples, the fitting capacity of the proposed algorithm is greatly improved compared to that of the PPTSVR algorithm.

Key words: projection, Twin Support Vector Regression(TSVR), isolated forest, Sigmoid smooth function, Newton iteration method

中图分类号: