首页 | 官方网站   微博 | 高级检索  
     

基于FCM与KKT条件的增量学习方法
引用本文:张国兵,郎荣玲.基于FCM与KKT条件的增量学习方法[J].国外电子元器件,2014(10):25-27,31.
作者姓名:张国兵  郎荣玲
作者单位:北京航空航天大学电子信息工程学院,北京100191
基金项目:基金项目:国家自然科学基金(61202078)
摘    要:增量学习方法的思想是仅利用部分相关的样本集参与训练,即能够保留历史样本知识,又能够不断地吸收新的知识,提高机器学习效率和精度,解决了大量样本训练时间长和存储空间不足的问题。因此,如何有效地丢弃大量无效的样本点是增量学习算法研究的重点。文中提出了一种FCM(Fuzzy C-Means)和KKT(Karush-KuhnTucker)条件结合的增量学习方法,分别从历史样本集和新增样本集两个阶段对无效样本进行过滤,利用余下的样本进行训练。最后,利用UCI数据库中的4组数据进行实验分析,结果证明训练精度与全数据样本的训练精度几乎完全拟合。

关 键 词:FCM  KKT  训练精度  支持向量  UCI数据库

An incremental learning approach based on FCM and KKT
ZHANG Guo-Bing,LANG Rong-ling.An incremental learning approach based on FCM and KKT[J].International Electronic Elements,2014(10):25-27,31.
Authors:ZHANG Guo-Bing  LANG Rong-ling
Affiliation:(School of Ele c tronic and Information Enginee ring, Be ijing Unive rs ity of A e ronautics and A s tronautics , Beijing 100191, China)
Abstract:The aim of the incremental learning approach is to be capable of not only reserving the historical sample knowledge, but also continuously absorbing new information, with only part of relevant sample set to train, which improves the learning efficiency and accuracy of machine and solves the problems of long training time for a large number of samples and not enough storage space. Therefore, the focus on the study of the incremental learning algorithm is how to effectively abandon plenty of useless sample points. This paper presents an incremental learning algorithm combining FCM (Fuzzy C-Means) term with KKT (Karnsh-Kuhn-Tucker) term, which filters useless samples from the stage of historical samples set to the stage of new samples set and uses the remaining samples to train. At last, the experimental analysis has been made based on the four groups of data in UCI database, and the results shows that the training accuracy using this method is almost completely fitting to that of using the total samples.
Keywords:FCM  KKT  the training accuracy  support vector  UCI dataset
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号