返回
Multi-parameter safe sample elimination rule for accelerating nonlinear multi-class support vector machines
DOI:10.1016/j.patcog.2019.05.037.png)
摘要
En 中文
K-SVCR and Twin-KSVC are two novel algorithms to deal with multi-class problems. They have achieved good performance since they evaluate all training samples into a 1-versus-1-versus-rest structure. But they are extremely time consuming, so it remains challenging to apply them into large-scale problems directly. Inspired by the sparse solution of SVMs, in this paper, we propose a safe sample elimination rule (SSE) for multi-class classifiers K-SVCR and Twin-KSVC, termed as SSE-K-SVCR and SSE-T-KSVC, to reduce computation time. With our rule, many redundant samples of all classes can be identified and deleted before actually solving the problem, so the scale of dual problems can be reduced a lot. And our methods are safe, i.e., they can derive identical optimal solutions as K-SVCR and Twin-KSVC, respectively. So the testing accuracy keeps unchanged. Besides, the methods can be embedded into grid search method to accelerate the whole training process, and they are effective both for penalty parameter and kernel parameter. Finally, a fast algorithm clipDCD is introduced to reduce the computation time for larger datatset. Experimental results on one artificial dataset and seventeen benchmark datasets demonstrate the effectiveness and safety of our proposed methods. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
K-SVCR
Twin-KSVC
Safe elimination rule
Multi-class classification
Multi-parameter
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Recent advances in quantile regression models - A practical guideline for empirical research分位数回归模型的最新进展-实证研究的实用指南
Training cost-sensitive neural networks with methods addressing the class imbalance problem用解决类不平衡问题的方法训练代价敏感的神经网络

