Online parameters updating method for least squares support vector machine using Unscented Kalman filter

Liu Xiaoyong, Zhou Shufang, Yang Changguo, Lu Guangyi, Zhang Qiang
{"title":"Online parameters updating method for least squares support vector machine using Unscented Kalman filter","authors":"Liu Xiaoyong, Zhou Shufang, Yang Changguo, Lu Guangyi, Zhang Qiang","doi":"10.1109/CCDC.2018.8407698","DOIUrl":null,"url":null,"abstract":"It is well known that the performance of Least Squares Support Vector Machine (LSSVM) is guaranteed by k-fold cross-validation (k-CS) or other optimized approaches to choose an appropriate setting of a number of parameters including such as the regularization parameter (7) and the kernel parameter (σ) and so on. However, it is mentioned in a large number of research on k-CS that it need more computational time and large computational burden in the process of optimizing parameters for LSSVM. Moreover, the obtained parameters by CS method are fixed and it lead easily to a poor generalization capabilities in various application. In order to avoid k-CS and to implement parameters update online, this paper proposes a novel method which applied Unscented Kalman Filter (UKF) to dynamically implement parameter updating problem for LSSVM. To estimate LSSVM's parameters online, the state and measurement equations of UKF are first constructed by considering LSSVM's parameter choice as state variable and treating LSSVM model as the measurement equation, respectively. Then, the UKF approach is used to update the LSSVM parameters timely according to the last obtained instance. Applying the proposed method, LSSVM parameters are not any more fixed as tuned parameters on the training dataset, but are adjusted dynamically as new measurements arrived. Finally, the viability and superiority of the proposed method are verified by simulation.","PeriodicalId":6588,"journal":{"name":"2017 29th Chinese Control And Decision Conference (CCDC)","volume":"74 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 29th Chinese Control And Decision Conference (CCDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCDC.2018.8407698","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

It is well known that the performance of Least Squares Support Vector Machine (LSSVM) is guaranteed by k-fold cross-validation (k-CS) or other optimized approaches to choose an appropriate setting of a number of parameters including such as the regularization parameter (7) and the kernel parameter (σ) and so on. However, it is mentioned in a large number of research on k-CS that it need more computational time and large computational burden in the process of optimizing parameters for LSSVM. Moreover, the obtained parameters by CS method are fixed and it lead easily to a poor generalization capabilities in various application. In order to avoid k-CS and to implement parameters update online, this paper proposes a novel method which applied Unscented Kalman Filter (UKF) to dynamically implement parameter updating problem for LSSVM. To estimate LSSVM's parameters online, the state and measurement equations of UKF are first constructed by considering LSSVM's parameter choice as state variable and treating LSSVM model as the measurement equation, respectively. Then, the UKF approach is used to update the LSSVM parameters timely according to the last obtained instance. Applying the proposed method, LSSVM parameters are not any more fixed as tuned parameters on the training dataset, but are adjusted dynamically as new measurements arrived. Finally, the viability and superiority of the proposed method are verified by simulation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于Unscented卡尔曼滤波的最小二乘支持向量机参数在线更新方法
众所周知,最小二乘支持向量机(LSSVM)的性能是通过k-fold交叉验证(k-CS)或其他优化方法来选择合适的参数设置来保证的,这些参数包括正则化参数(7)和核参数(σ)等。然而,在大量关于k-CS的研究中提到,LSSVM在参数优化过程中需要更多的计算时间和较大的计算负担。此外,CS方法得到的参数是固定的,容易导致在各种应用中泛化能力较差。为了避免k-CS,实现参数在线更新,本文提出了一种利用无气味卡尔曼滤波(UKF)动态实现LSSVM参数更新问题的新方法。为了在线估计LSSVM的参数,首先将LSSVM的参数选择作为状态变量,将LSSVM模型作为测量方程,分别构建UKF的状态方程和测量方程。然后,根据最后获得的实例,使用UKF方法及时更新LSSVM参数。应用该方法,LSSVM参数不再作为训练数据集上的调优参数固定,而是随着新测量值的到来而动态调整。最后,通过仿真验证了该方法的可行性和优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
UPQC Harmonic Detection Algorithm Based on Improved p-q Theory and Design of Low-Pass Filter Online parameters updating method for least squares support vector machine using Unscented Kalman filter Quadratic stabilization and L2 gain analysis of switched affine systems 3PL inventory pledge decision analysis under the unified credit logistics model Design and implementation of LiDAR navigation system based on triangulation measurement
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1