Abstract
Abstract
In the learning process based on ISVM, how to effectively retain the history information and selectively discard some new training data, so as to maintain the classification accuracy and save the storage space after adding new samples every time, which is the key of the current ISVM classification algorithm. This thesis proposes a new incremental learning algorithm, that is, SVM incremental learning algorithm based on cluster diameter (CD-ISVM). This algorithm firstly calculates the two centers of the positive and negative samples, and then to build the boundary vector set by the coordinates of the two class centers. Moreover, KKT conditions are combined to filter incremental data and boundary vector set, and feedback information is provided to adjust the position of the boundary vector set. Then, the union of SV set and boundary vector set is taken as the increment set. After several increments, a classifier with strong generalization is finally trained.
Subject
General Physics and Astronomy
Reference15 articles.
1. On incremental and robust subspace learning [J];Yongmin;Pattern Recognition,2004
2. An improved incremental training algorithm for support vector machines using active query [J];Cheng;Pattern Recognition,2007
3. Product Quality Modelling Based on Incremental Support Vector Machine [J];Wang;Journal of Physics: Conference Series,2012
4. A SVM incremental learning algorithm [J];Xiao;Journal of Nanjing University: Natural Science Edition,2002
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献