{"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}
引用次数: 0
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.