首页 | 本学科首页   官方微博 | 高级检索  
     

快速支持向量机增量学习算法
引用本文:赵耀红,王快妮,钟萍,王来生.快速支持向量机增量学习算法[J].计算机工程与设计,2010,31(1).
作者姓名:赵耀红  王快妮  钟萍  王来生
作者单位:中国农业大学,理学院,北京,100083
基金项目:国家自然科学基金项目 
摘    要:支持向量机对数据的学习往往因为规模过大造成学习困难,增量学习通过把数据集分割成历史样本集和新增样本集,利用历史样本集的几何分布信息,通过定义样本的遗忘因子,提取历史样本集中的那些可能成为支持向量的边界向量进行初始训练.在增量学习过程中对学习样本的知识进行积累,有选择地淘汰学习样本.实验结果表明,该算法在保证学习的精度和推广能力的同时,提高了训练速度,适合于大规模分类和在线学习问题.

关 键 词:支持向量机  增量学习  边界向量  遗忘因子  核函数

Incremental support vector machine based on border samples
ZHAO Yao-hong,WANG Kuai-ni,ZHONG Ping,WANG Lai-sheng.Incremental support vector machine based on border samples[J].Computer Engineering and Design,2010,31(1).
Authors:ZHAO Yao-hong  WANG Kuai-ni  ZHONG Ping  WANG Lai-sheng
Affiliation:ZHAO Yao-hong,WANG Kuai-ni,ZHONG Ping,WANG Lai-sheng(College of Science,China Agricultural University,Beijing 100083,China)
Abstract:To learn for large scale datasets is difficult using support vector machine.Datasets are divided into histor ydataset and incremental datasets.a new algorithm based on the geometrical knowledge of history samples is presented.Firstly,the border vectors of history samples are selected by redefining forgetting factor of sample,and then SVM is fast trained by these border vectors.Secondly,all samples'knowledge is accumulated and some samples is discarded effectively in the incremental learning process.The numerical experiments on benchmark datasets show that the proposed algorithm is considerably faster than the standard SVM and the classical incremental algorithm.
Keywords:support vegtor machine  incremental learning  border vector  forgetting factor  kernel function
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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