Fast SVM Incremental Learning Based on Clustering Algorithm
In the incremental learning process of Support Vector Machines, the Non-support vectors which is close to support vector samples are discarded in tradition method. But it is likely to change into the Support Vector after adding new training samples. To resolve this problem, this paper proposes a new method that combines Support Vector Machine with clustering algorithm. In this method, firstly, use clustering algorithm to cluster the training sample set and get clustering particles ; secondly, look all centers of clustering particles as new samples training set and reconstruct the training samples set; then, train the new training samples set with Fuzzy Support Vector Machine (FSVM) and obtain the support vectors, and discard the samples that satisfy KKT conditions, put the samples that don not meet the KKT conditions and the support vectors together to reconstitute a new training set, train them again. Experimental results show that this method can enhance the classification accuracy rate and improve the speed of SVM training and classification speed, as keeping the generalization ability of SVM incremental learning.
Support vector machine Incremental learning cluster algorithm KKT condition
Du Hongle Teng Shaohua Zhu Qingfang
Faculty of Computer Guangdong University of technology Guangzhou,China College of Mathematics Luoyang normal university Luoyang,China
国际会议
上海
英文
13-17
2009-11-20（万方平台首次上网日期，不代表论文的发表时间）