基于支持向量机的多类分类算法

Lei Sun, Z. Duan
{"title":"基于支持向量机的多类分类算法","authors":"Lei Sun, Z. Duan","doi":"10.1109/ICCIAUTOM.2011.6183968","DOIUrl":null,"url":null,"abstract":"Support vector machine (SVM) constructs an optimal hyperplane utilizing a small set of vectors near boundary. The proximal SVM is an extremely simple procedure to generate linear and nonlinear classifier based on proximity to one of two parallel planes that are separated as far as possible. However, when the two-class are very unbalanced, the proximal SVM tends to fit better the class with more samples and has higher error in fewer samples. Further more, this draw back exists in K-category classification by using one-from-the-rest (OFR) separation for each class. To solve the problem, an improved SVM algorithm is presented in this paper. Experimental results show that the novel approach is prior to the proximal SVM.","PeriodicalId":177039,"journal":{"name":"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A classification algorithm for multi-classes based on SVM\",\"authors\":\"Lei Sun, Z. Duan\",\"doi\":\"10.1109/ICCIAUTOM.2011.6183968\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Support vector machine (SVM) constructs an optimal hyperplane utilizing a small set of vectors near boundary. The proximal SVM is an extremely simple procedure to generate linear and nonlinear classifier based on proximity to one of two parallel planes that are separated as far as possible. However, when the two-class are very unbalanced, the proximal SVM tends to fit better the class with more samples and has higher error in fewer samples. Further more, this draw back exists in K-category classification by using one-from-the-rest (OFR) separation for each class. To solve the problem, an improved SVM algorithm is presented in this paper. Experimental results show that the novel approach is prior to the proximal SVM.\",\"PeriodicalId\":177039,\"journal\":{\"name\":\"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIAUTOM.2011.6183968\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIAUTOM.2011.6183968","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

支持向量机(SVM)利用边界附近的小向量集构造最优超平面。近端支持向量机是一个非常简单的过程,它基于与两个尽可能分开的平行平面之一的接近度来生成线性和非线性分类器。然而,当两类非常不平衡时,近端支持向量机往往更适合样本较多的类,并且在样本较少的情况下误差较大。此外,这种缺陷存在于k类分类中,通过对每个类使用一个从其余的(OFR)分离。为了解决这一问题,本文提出了一种改进的支持向量机算法。实验结果表明,该方法优于近端支持向量机。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A classification algorithm for multi-classes based on SVM
Support vector machine (SVM) constructs an optimal hyperplane utilizing a small set of vectors near boundary. The proximal SVM is an extremely simple procedure to generate linear and nonlinear classifier based on proximity to one of two parallel planes that are separated as far as possible. However, when the two-class are very unbalanced, the proximal SVM tends to fit better the class with more samples and has higher error in fewer samples. Further more, this draw back exists in K-category classification by using one-from-the-rest (OFR) separation for each class. To solve the problem, an improved SVM algorithm is presented in this paper. Experimental results show that the novel approach is prior to the proximal SVM.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信