.png){kind=icon}
返回
Improved robust nonparallel support vector machines
.png){kind=icon}
PRE
AI
DOI：10.1007/s41060-022-00356-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nonparallel Support Vector Machine (NPSVM) is a binary classification approach that combines the advantages of both support vector machine (SVM) and Twin SVM (TWSVM). It finds two nonparallel hyperplanes by solving two optimization problems such that each hyperplane is closer to one of the classes and as far as possible from the other class. To deal with data uncertainty, the chance-constrained Robust NPSVM (RNPSVM) is developed in Lopez et al. (Neurocomputing 364:227-238, 2019) that improved model fit. In this paper, we propose an improved version of RNPSVM (IRNPSVM) by replacing the epsilon-insensitive tube of each class by a chance constraint corresponding to its upper hyperplane while keeping its lower hyperplane. This results in reducing the number of missing data of the related class. It is reformulated as second-order cone programming problems. Experiments on both UCI and NDC datasets show that the improved model has better classification accuracy and its learning time is faster for the majority of the datasets compared to RNPSVM.
Keyword:
Support vector machines
Nonparallel support vector machines
Second-order cone
Robust optimization
期刊
I
IF:
2.8
论文数:
1.1K
被引数:
1.3K
机构
引用论文
Using unsupervised clustering approach to train the Support Vector Machine for text classification使用无监督聚类方法训练支持向量机进行文本分类.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
Discrete space reinforcement learning algorithm based on support vector machine classification基于支持向量机分类的离散空间强化学习算法
PREAI
分享收藏分享收藏
查看更多内容