期刊文献+

基于动量加速零阶减小方差的鲁棒支持向量机 被引量:4

Robust Support Vector Machine Based on Momentum Acceleration Zero-Order Variance Reduction
下载PDF
导出
摘要 在实际分类问题中,由于人为或其他因素的影响,数据中往往存在一定的噪声,而传统支持向量机(SVM)使用的铰链损失函数对噪声数据敏感,且分类性能较差。为消除噪声数据的影响,提出一种新的鲁棒SVM算法。通过引入新形式的损失函数,并基于间隔分布的思想,建立鲁棒SVM优化模型提高SVM的抗噪性,运用零阶减小方差算法并结合动量加速技术,给出一种新的优化模型求解方法。实验结果表明,该方法通过引入梯度修正项降低了方差对算法的影响,同时结合动量加速技术,明显提高了算法的收敛速度。 In the actual classification problem,there is often a certain amount of noise in the data caused by the influence of artificial or other factors,so it is very important to improve the anti-noise ability of the classifier.However,the hinge loss function used by the traditional Support Vector Machine(SVM)is sensitive to noisy data and has poor classification performance.In order to eliminate the influence of noisy data,this paper proposes a robust SVM based on momentum acceleration zero-order variance reduction.By introducing a new form of loss function and adopting the idea of margin distribution,a robust SVM optimization model is established to improve the anti-noise ability of SVM.By using the zero-order variance reduction algorithm and momentum acceleration technique,a new optimization model solution method is proposed.Experimental results show that this method reduces the influence of variance effectively by introducing the gradient correction item,and increases the convergence speed of the algorithm significantly by using the momentum acceleration technology.
作者 鲁淑霞 蔡莲香 张罗幻 LU Shuxia;CAI Lianxiang;ZHANG Luohuan(Hebei Province Key Laboratory of Machine Learning and Computational Intelligence,College of Mathematics and Information Science,Hebei University,Baoding,Hebei 071002,China)
出处 《计算机工程》 CAS CSCD 北大核心 2020年第12期88-95,104,共9页 Computer Engineering
基金 国家自然科学基金(61672205)。
关键词 噪声 零阶梯度 方差 动量加速 鲁棒支持向量机 noise zero-order gradient variance momentum acceleration robust Support Vector Machine(SVM)
  • 相关文献

参考文献3

二级参考文献23

  • 1蒋盛益,谢照青,余雯.基于代价敏感的朴素贝叶斯不平衡数据分类研究[J].计算机研究与发展,2011,48(S1):387-390. 被引量:21
  • 2Elkan C. The foundations of cost sensitive learning [C] // Proc of Int Joint Conf on Artificial Intelligence. San Francisco, CA Morgan Kaufmann, 2001. 973-978.
  • 3Zhou Zhihua, Liu Xuying. On multi-class cost sensitive learning [J]. Computational Intelligence, 2010, 26(3): 232- 257.
  • 4Ting K M. An instance-weighting method to induce cost- sensitive trees [J]. IEEE Trans on Knowledge and Data Engineering, 2002, 14(3): 659-665.
  • 5Zhou Zhihua, Liu Xuying. Training cost sensitive neural networks with methods addressing the class imbalance problem [J]. IEEE Trans on Knowledge and Data Engineering, 2006, 18(1): 63-77.
  • 6Maloof M A. Learning when data sets are imbalanced and when costs are unequal and unknown [C] //Proe of ICML- 2003 Workshop on Learning from Imbalanced Data Sets II. Menlo Park, CA AAAI Press, 2003.
  • 7Bahnsen A C, Aouada D, Ottersten /3. Example-dependent cost-sensitive decision trees [J]. Expert Systems with Applications, 2015, 42(19): 6609-6619.
  • 8Ghazikhani A, Monsefi R, Yazdi H S. Online cost-sensitive neural network classifiers for non-stationary and imbalanced data streams [J]. Neural Computing Applications, 2013, 23(5) : 1283-1295.
  • 9Brefetd U, Geibel P, Wysotzki F. Support vector machines with example dependent costs [C] //Proc of European Conf on Machine Learning. Berlin: Springer, 2003:23-34.
  • 10Raudys S, Raudys A. Pairwise costs in multiclass perceptrons [J]. IEEE Trans on Pattern Analysis and Machine Intelligence, 2010, 32(7): 1324-1328.

共引文献26

同被引文献41

引证文献4

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部