.png){kind=icon}
返回
Adaptive robust learning framework for twin support vector machine classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2020.106536.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In general, introducing robust distance metrics and loss functions in the learning process can improve the robustness of the algorithms. In this work, we first propose a new robust loss function called adaptive capped L-theta epsilon-loss. For different problems, we can choose different loss functions through adaptive parameter theta during the learning process. Secondly, we propose a new robust distance metric induced by correntropy (CIM) that is based on Laplacian kernel. The CIM contains first and higher-order moments from samples. Further, we demonstrate some important and interesting properties of the L-theta epsilon-loss and CIM, such as robustness, boundedness, nonconvexity, etc. Finally, we apply the to L-theta epsilon-loss and CIM to twin support vector machine (TWSVM) and develop an adaptive robust learning framework, namely adaptive robust twin support vector machine (ARTSVM). The proposed ARTSVM not only inherits the advantages of TWSVM but also improves the robustness of classification problems. A non-convex optimization method, DC (difference of convex functions) programming algorithm (DCA) is used to solve the proposed ARTSVM, and the convergence of the algorithm is proved theoretically. Experiments on multiple datasets show that the proposed ARTSVM is competitive with existing methods. (C) 2020 Published by Elsevier B.V.
Keyword:
Robustness
Correntropy
Distance metric
Twin support vector machine
DC programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
查看更多内容