摘要
According to the classic Karush-Kuhn-Tucker(KKT)theorem,at every step of incremental support vector machine(SVM)learning,the newly adding sample which violates the KKT conditions will be a new support vector(SV)and migrate the old samples between SV set and non-support vector(NSV)set,and at the same time the learning model should be updated based on the SVs.However,it is not exactly clear at this moment that which of the old samples would change between SVs and NSVs.Additionally,the learning model will be unnecessarily updated,which will not greatly increase its accuracy but decrease the training speed.Therefore,how to choose the new SVs from old sets during the incremental stages and when to process incremental steps will greatly influence the accuracy and efficiency of incremental SVM learning.In this work,a new algorithm is proposed to select candidate SVs and use the wrongly predicted sample to trigger the incremental processing simultaneously.Experimental results show that the proposed algorithm can achieve good performance with high efficiency,high speed and good accuracy.
According to the classic Karush-Kuhn-Tucker(KKT)theorem,at every step of incremental support vector machine(SVM)learning,the newly adding sample which violates the KKT conditions will be a new support vector(SV)and migrate the old samples between SV set and non-support vector(NSV)set,and at the same time the learning model should be updated based on the SVs.However,it is not exactly clear at this moment that which of the old samples would change between SVs and NSVs.Additionally,the learning model will be unnecessarily updated,which will not greatly increase its accuracy but decrease the training speed.Therefore,how to choose the new SVs from old sets during the incremental stages and when to process incremental steps will greatly influence the accuracy and efficiency of incremental SVM learning.In this work,a new algorithm is proposed to select candidate SVs and use the wrongly predicted sample to trigger the incremental processing simultaneously.Experimental results show that the proposed algorithm can achieve good performance with high efficiency,high speed and good accuracy.
基金
supported by the National Natural Science Foundation of China(Nos.U1509207 and 61325019)