.png){kind=icon}
返回
Nonparallel least square support vector machine for classification
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-016-0820-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nonparallel support vector machine based on one optimization problem (NSVMOOP) aims at finding two nonparallel hyper-planes by maximizing the intersection angle of their normal vectors w (1) and w (2). As maximum intersection angle preserves both compactness and separation of data, NSVMOOP yields good forecasting accuracy. However, as it solves one large quadratic programming problem (QPP), it costs high running time. In order to improve its learning speed, a novel nonparallel least square support vector machine (NLSSVM) is proposed in this paper. NLSSVM solves a linear system of equations instead of solving one large QPP. As both intersection angle and least square version are applied on our NLSSVM, it performs better generalization performance than other algorithms. Experimental results on twenty benchmark datasets demonstrate its validity.
Keyword:
Support vector machine
Nonparallel hyper-planes
Intersection angle
Least square
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容