返回
Scaling KNN multi-class twin support vector machine via safe instance reduction
DOI:10.1016/j.knosys.2018.02.018.png)
摘要
En 中文
k-nearest neighbor-based weighted multi-class twin support vector machine(KMTSVM) is an effective algorithm to deal with multi-class optimization problems. The superiority of KMTSVM is that it adopts a 1-versus-1-versus-rest structure, and takes the distribution information of all the instances into consideration. However, it costs much time to handle large scale problems. Motivated by the sparse solution of KMTSVM, in this paper, we propose a safe instance reduction rule to improve its computational efficiency, termed as SIR-KMTSVM. The SIR-KMTSVM can delete a majority of redundant instances both for focused classes and remaining classes, then the operation speed can be accelerated greatly. And our instance reduction rule is safe in the sense that the reduced problem can derive an identical optimal solution as the original one. More importantly, we analysis that the different k-nearest neighbors will have different acceleration effect on our SIR-KMTSVM. Besides, a fast algorithm DCDM is introduced to handle relatively large scale problems more efficiently. Sequential versions of SIR-KMTSVM are further introduced to substantially accelerate the whole training process. Experimental results on an artificial dataset, seventeen benchmark datasets and a real dataset confirm the effectiveness of our proposed algorithm. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
KMTSVM
Instance reduction rule
Large scale problem
Support vectors
Multi-class problem
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Recent advances in quantile regression models - A practical guideline for empirical research分位数回归模型的最新进展-实证研究的实用指南
Multiple recursive projection twin support vector machine for multi-class classification用于多类分类的多递归投影孪生支持向量机

