4.7 Article

Twin K-class support vector classification with pinball loss

期刊

APPLIED SOFT COMPUTING
卷 113, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.asoc.2021.107929

关键词

Hinge loss; Pinball loss; Quantile distance; Noise insensitivity; TKSVC

向作者/读者索取更多资源

The novel algorithm Pin-TKSVC is proposed to improve the robustness of multiclass classification by introducing pinball loss. Experimental results show its superior performance on various datasets.
The twin K-class support vector classification (TKSVC) is an effective and efficient algorithm for multiclass classification problem. However, due to the use of hinge loss function, it is very sensitive to feature noises and not stable for re-sampling. To avoid the above flaws, we present a novel twin K-class support vector classification with pinball loss (Pin-TKSVC) in this paper. The structure of Pin-TKSVC is analogous to that of TKSVC. Namely, it adopts One-vs.-One-vs.-Rest'' structure to do multi-class classification and solves two smaller sized quadratic programming problems to save the running time. Besides, the introduction of pinball loss does not increase the additional computational complexity. More importantly, the Pin-TKSVC maximizes the quantile distance between different categories, making it a more robust classifier. To testify its performance, we do numerical experiments on twenty datasets with different noises, and compare it with five state-of-the-art algorithms. The experimental results confirm the validity of our algorithm. (C) 2021 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据