Sparse KELM Online Prediction Model Based on Forgetting Factor

Jinling Dai, Aiqiang Xu, Xing Liu, Ruifeng Li
{"title":"Sparse KELM Online Prediction Model Based on Forgetting Factor","authors":"Jinling Dai, Aiqiang Xu, Xing Liu, Ruifeng Li","doi":"10.1109/AUTEEE50969.2020.9315722","DOIUrl":null,"url":null,"abstract":"In the process of online prediction of nonstationary time series by kernel extreme learning machine (KELM), two problems appear that the order of kernel matrix is increasing and the system dynamic characteristics are difficult to be determined. A sparse KELM state prediction model based on forgetting factor (FF) is proposed. Firstly, by introducing the forgetting factor, a new objective function is constructed to make the elements in the sparse dictionary have different weights according to the time distance, so as to ensure the effective tracking of the dynamic changes of the model. By studying the relationship between KELM and kernel recursive least-squares (KRLS), KRLS is extended to the online sparse KELM framework. To control the growth of network structure, and realize the recursion and update of dictionary parameters, the samples are sparse by using approximate linear dependence (ALD) criterion. The experimental results show that compared with KB-KELM, FOKELM, NOS-KELM and KRLSELM, FF-KRLSELM can reduce the average root mean square error by 48% and 36%, and the average relative error by 37% and 36%, and has good dynamic tracking ability and adaptability.","PeriodicalId":6767,"journal":{"name":"2020 IEEE 3rd International Conference on Automation, Electronics and Electrical Engineering (AUTEEE)","volume":"73 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 3rd International Conference on Automation, Electronics and Electrical Engineering (AUTEEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AUTEEE50969.2020.9315722","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the process of online prediction of nonstationary time series by kernel extreme learning machine (KELM), two problems appear that the order of kernel matrix is increasing and the system dynamic characteristics are difficult to be determined. A sparse KELM state prediction model based on forgetting factor (FF) is proposed. Firstly, by introducing the forgetting factor, a new objective function is constructed to make the elements in the sparse dictionary have different weights according to the time distance, so as to ensure the effective tracking of the dynamic changes of the model. By studying the relationship between KELM and kernel recursive least-squares (KRLS), KRLS is extended to the online sparse KELM framework. To control the growth of network structure, and realize the recursion and update of dictionary parameters, the samples are sparse by using approximate linear dependence (ALD) criterion. The experimental results show that compared with KB-KELM, FOKELM, NOS-KELM and KRLSELM, FF-KRLSELM can reduce the average root mean square error by 48% and 36%, and the average relative error by 37% and 36%, and has good dynamic tracking ability and adaptability.
基于遗忘因子的稀疏KELM在线预测模型
在利用核极值学习机对非平稳时间序列进行在线预测的过程中,出现了核矩阵阶数不断增加和系统动态特性难以确定的两个问题。提出了一种基于遗忘因子(FF)的稀疏KELM状态预测模型。首先,通过引入遗忘因子,构造新的目标函数,使稀疏字典中的元素根据时间距离具有不同的权值,从而保证对模型动态变化的有效跟踪;通过研究KELM与核递归最小二乘(KRLS)之间的关系,将KRLS扩展到在线稀疏KELM框架。为了控制网络结构的增长,实现字典参数的递归和更新,采用近似线性相关准则对样本进行稀疏处理。实验结果表明,与KB-KELM、FOKELM、NOS-KELM和KRLSELM相比,FF-KRLSELM的平均均方根误差分别降低48%和36%,平均相对误差分别降低37%和36%,具有良好的动态跟踪能力和自适应能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信