返回
Robust nonparallel support vector machines via second-order cone programming
DOI:10.1016/j.neucom.2019.07.072.png)
摘要
En 中文
A novel binary classification approach is proposed in this paper, extending the ideas behind nonparallel support vector machine (NPSVM) to robust machine learning. NPSVM constructs two twin hyperplanes by solving two independent quadratic programming problems and generalizes the well-known twin support vector machine (TWSVM) method. Robustness is conferred on the NPSVM approach by using a probabilistic framework for maximizing model fit, which is cast into two second-order cone programming (SOCP) problems by assuming a worst-case setting for the data distribution of the training patterns. Experiments on benchmark datasets confirmed the theoretical virtues of our approach, showing superior average performance compared with various SVM formulations. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Support vector machines
Twin support vector machines
Nonparallel support vector machines
Second-order cone programming
Robustness
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
An efficient weighted Lagrangian twin support vector machine for imbalanced data classification一种有效的加权拉格朗日孪生支持向量机,用于不平衡数据分类
PATTERN RECOGNITION
IF7.6

