The improved GM(1,1) based on PSO with stochastic weight

Fanlin Meng, Tianhui Wang, Bing-jun Li
{"title":"The improved GM(1,1) based on PSO with stochastic weight","authors":"Fanlin Meng, Tianhui Wang, Bing-jun Li","doi":"10.1109/GSIS.2017.8077693","DOIUrl":null,"url":null,"abstract":"In order to improve the prediction accuracy of GM(1,1) this paper points out the disadvantages of using least square method to solve the parameters of model, attempts to use particle swarm optimization algorithm (PSO) to calculate the parameter of GM(1,1), introduces the stochastic strategy into PSO to endow the inertia weight of particle randomly, and then selects high-rising exponential sequence and low-rising exponential sequence to establish the improved GM(1,1), traditional GM(1,1) and DGM(1,1) to compare the fitting accuracy. In addition, the grey correlation analysis is used to measure the similarity between the fitting sequence and the original sequence of three models. The results show that: for the low-rising exponential sequence, the improved GM(1,1) is slightly better than traditional GM(1,1) and DGM(1,1); for the high-rising exponential sequence, the superiority of improved GM(1,1) is obviously higher than the other two models, especially the traditional GM(1,1); for these two types of sequences, the geometry of fitting sequence based on improved GM(1,1) is closer to the geometry of original sequence.","PeriodicalId":425920,"journal":{"name":"2017 International Conference on Grey Systems and Intelligent Services (GSIS)","volume":"149 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Grey Systems and Intelligent Services (GSIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GSIS.2017.8077693","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In order to improve the prediction accuracy of GM(1,1) this paper points out the disadvantages of using least square method to solve the parameters of model, attempts to use particle swarm optimization algorithm (PSO) to calculate the parameter of GM(1,1), introduces the stochastic strategy into PSO to endow the inertia weight of particle randomly, and then selects high-rising exponential sequence and low-rising exponential sequence to establish the improved GM(1,1), traditional GM(1,1) and DGM(1,1) to compare the fitting accuracy. In addition, the grey correlation analysis is used to measure the similarity between the fitting sequence and the original sequence of three models. The results show that: for the low-rising exponential sequence, the improved GM(1,1) is slightly better than traditional GM(1,1) and DGM(1,1); for the high-rising exponential sequence, the superiority of improved GM(1,1) is obviously higher than the other two models, especially the traditional GM(1,1); for these two types of sequences, the geometry of fitting sequence based on improved GM(1,1) is closer to the geometry of original sequence.
基于随机权值粒子群的改进GM(1,1)
为了提高GM(1,1)的预测精度,本文指出了使用最小二乘法求解模型参数的缺点,尝试使用粒子群优化算法(PSO)计算GM(1,1)的参数,并在PSO中引入随机策略,随机赋予粒子的惯性权值,然后选择高上升指数序列和低上升指数序列建立改进的GM(1,1)。比较传统GM(1,1)和DGM(1,1)的拟合精度。此外,利用灰色关联分析度量三个模型的拟合序列与原始序列的相似度。结果表明:对于低上升指数序列,改进GM(1,1)略优于传统GM(1,1)和DGM(1,1);对于高上升指数序列,改进GM(1,1)模型的优越性明显高于其他两个模型,尤其是传统GM(1,1)模型;对于这两类序列,改进GM(1,1)拟合序列的几何形状更接近原始序列的几何形状。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信