一种基于极限学习机的在线负增量算法  

AN ONLINE NEGATIVE INCREMENTAL ALGORITHM BASED ON EXTREME LEARNING MACHINE

作　　者：谢林森[1] 任婷婷[2] 卢诚波[1] 

机构地区：[1]丽水学院工程与设计学院,浙江丽水323000 [2]浙江师范大学数理与信息工程学院,浙江金华321004

出　　处：《计算机应用与软件》2016年第9期269-272,共4页Computer Applications and Software

基　　金：国家自然科学基金面上项目(11171137);浙江省自然科学基金项目(LY13A010008)

摘　　要：在剔除影响单隐层前馈神经网络性能的"脏数据"后,传统的极限学习机算法需要重新训练整个网络,这会增加很多额外的训练时间。针对这一问题,在传统的极限学习机算法的基础上,提出一种在线负增量学习算法:剔除"脏训练样本"后,不需要再重新训练整个网络,而只需在原有的基础上,通过更新外权矩阵来完成网络更新。算法复杂性分析和仿真实验的结果表明所提出的算法具有更高的执行速度。After weeding out the dirty data that affecting the performance of single hidden layer feedforward network, traditional extreme learning machine has the need to train the entire networks. However, this will increase a lot of extra training time. In light of this issue, the paper proposes an online negative incremental algorithm based on traditional extreme learning machine algorithm：after the ＂dirty training sample＂ being eliminated, there has no need to train the whole networks once again, but only need to accomplish the network update by updating output weights matrix on the basis of original. The complexity analysis of the algorithm and the result of simulation experiment show that the proposed algorithm has higher execution speed.

关 键 词：极限学习机 负增量算法 算法复杂性 仿真实验 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]