Local Class Boundaries for Support Vector Machine
The support vector machine (SVM) has proved effective in classification.However,SVM easily becomes intractable in its memory and time requirements to deal with the large data, and also can not nicely deal with noisy, sparse, and imbalanced data. To overcome these issues, this paper presents a new local support vector machine that first finds k nearest neighbors from each class respectively for the query sample and then SVM is trained locally on all these selected nearest neighbors to perform the classification. This approach is efficient,sirnple and easy to implement. The conducted experiments on challenging benchmark data sets validate the proposed approach in terms of classification accuracy and robustness.
Guihua Wen Caihui Zhou Jia Wei Lijun Jiang
South China University of Technology,Guangzhou 510641, China
国际会议
无锡
英文
225-233
2010-09-17(万方平台首次上网日期,不代表论文的发表时间)