.png){kind=icon}
返回
Finding Potential Support Vectors in Separable Classification Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2013.2264731.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers the classification problem using support vector (SV) machines and investigates how to maximally reduce the size of the training set without losing information. Under separable data set assumptions, we derive the exact conditions stating which observations can be discarded without diminishing the overall information content. For this purpose, we introduce the concept of potential SVs, i.e., those data that can become SVs when future data become available. To complement this, we also characterize the set of discardable vectors (DVs), i.e., those data that, given the current data set, can never become SVs. Thus, these vectors are useless for future training purposes and can eventually be removed without loss of information. Then, we provide an efficient algorithm based on linear programming that returns the potential and DVs by constructing a simplex tableau. Finally, we compare it with alternative algorithms available in the literature on some synthetic data as well as on data sets from standard repositories.
Keyword:
Data discardability conditions
discardable vectors
linear programming
potential support vectors
separable data sets
support vector machines
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
A scalable support vector machine for distributed classification in ad hoc sensor networks用于ad hoc传感器网络分布式分类的可扩展支持向量机.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏Behavioural and biochemical alterations in gammarids as induced by chronic metallic exposures (Cd, Cu and Pb): Implications for freshwater biomonitoringChemosphere
ChemosphereIF0
PREAI
分享收藏
查看更多内容