Online Sequential Extreme Learning Machine With Dynamic Forgetting Factor

被引:31
作者
Cao, Weipeng [1 ]
Ming, Zhong [1 ]
Xu, Zhiwu [1 ]
Zhang, Jiyong [2 ]
Wang, Qiang [3 ]
机构
[1] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China
[2] Hangzhou Dianzi Univ, Sch Automat, Hangzhou 310018, Peoples R China
[3] Southern Univ Sci & Technol, Dept Comp Sci & Engn, Shenzhen 518055, Peoples R China
基金
中国国家自然科学基金;
关键词
Extreme learning machine; online sequential learning; forgetting factor; timeliness; ALGORITHM; IMBALANCE; PREDICTION;
D O I
10.1109/ACCESS.2019.2959032
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Online sequential extreme learning machine (OS-ELM) and its variants provide a promising way to solve data stream problems, but most of them do not take the timeliness of the problems into account, which may degrade the performance of the model. The main reason is that these algorithms are unable to adapt to the latest data accordingly when the distribution of the data stream changes. To mitigate this limitation, the forgetting factor is introduced into the relevant models, which is used to balance the relative importance of past data and new data when necessary. However, there is no efficient way to set the forgetting factor properly so far. In this paper, we have developed a novel updating strategy for setting the forgetting factor and proposed a dynamic forgetting factor based OS-ELM algorithm (DOS-ELM). In the sequential learning phase of DOS-ELM, the forgetting factor can be adjusted dynamically according to the change degree of the model accuracy in each learning epoch. This updating process does not require setting any parameters artificially and thus greatly improves the flexibility of the model. The experimental results on ten classification problems, five regression problems, one time-series problem show that DOS-ELM can deal well with both stationary and non-stationary data stream problems. In addition, we have extended DOS-ELM to an online deep model named ML-DOS-ELM, which can handle more complex tasks such as the face recognition problem and the handwritten digit recognition problem. Our experimental evaluations show that both DOS-ELM and ML-DOS-ELM can achieve higher prediction accuracy compared to the other similar algorithms.
引用
收藏
页码:179746 / 179757
页数:12
相关论文
共 51 条
[1]  
Blake C., 1998, 01 U CAL DEP INF COM
[2]   Fuzziness-based online sequential extreme learning machine for classification problems [J].
Cao, Weipeng ;
Gao, Jinzhu ;
Ming, Zhong ;
Cai, Shubin ;
Shan, Zhiguang .
SOFT COMPUTING, 2018, 22 (11) :3487-3494
[3]   A review on neural networks with random weights [J].
Cao, Weipeng ;
Wang, Xizhao ;
Ming, Zhong ;
Gao, Jinzhu .
NEUROCOMPUTING, 2018, 275 :278-287
[4]   Kernel based online learning for imbalance multiclass classification [J].
Ding, Shuya ;
Mirza, Bilal ;
Lin, Zhiping ;
Cao, Jiuwen ;
Lai, Xiaoping ;
Nguyen, Tam V. ;
Sepulveda, Jose .
NEUROCOMPUTING, 2018, 277 :139-148
[5]  
Fan Wei., 2004, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '04, P128
[6]  
Golub G. H., 2012, Matrix Computation, V3
[7]  
Graham D. B., 1998, Face Recognition, P446
[8]  
Graves A, 2013, INT CONF ACOUST SPEE, P6645, DOI 10.1109/ICASSP.2013.6638947
[9]   TOSELM: Timeliness Online Sequential Extreme Learning Machine [J].
Gu, Yang ;
Liu, Junfa ;
Chen, Yiqiang ;
Jiang, Xinlong ;
Yu, Hanchao .
NEUROCOMPUTING, 2014, 128 :119-127
[10]  
Guan Ziyu., 2016, IJCAI, P3719