基于改进K-Means算法的RBF神经网络及其在时间序列建模中的应用

Yiping Jiao, Yu-zhi Shen, Shu-ming Fei
{"title":"基于改进K-Means算法的RBF神经网络及其在时间序列建模中的应用","authors":"Yiping Jiao, Yu-zhi Shen, Shu-ming Fei","doi":"10.1109/DCABES.2015.126","DOIUrl":null,"url":null,"abstract":"In this paper, a modified K-means based RBFNN is discussed. To improve the performance of RBFNN, an initial cluster centers (ICCs) selection strategy is proposed for K-means algorithm. The algorithm takes breadth preferred subset of samples as ICCs to cover the sample space using greedy strategy. The results shows that the proposed algorithm can improve the performance of RBFNN remarkably in chaotic time series modelling.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Modified K-Means Algorithm Based RBF Neural Network and Its Application in Time Series Modelling\",\"authors\":\"Yiping Jiao, Yu-zhi Shen, Shu-ming Fei\",\"doi\":\"10.1109/DCABES.2015.126\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a modified K-means based RBFNN is discussed. To improve the performance of RBFNN, an initial cluster centers (ICCs) selection strategy is proposed for K-means algorithm. The algorithm takes breadth preferred subset of samples as ICCs to cover the sample space using greedy strategy. The results shows that the proposed algorithm can improve the performance of RBFNN remarkably in chaotic time series modelling.\",\"PeriodicalId\":444588,\"journal\":{\"name\":\"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCABES.2015.126\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCABES.2015.126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文讨论了一种改进的基于k均值的RBFNN。为了提高RBFNN的性能,提出了K-means算法的初始聚类中心选择策略。该算法以样本的宽度偏好子集作为icc,利用贪心策略覆盖样本空间。结果表明,该算法能显著提高RBFNN在混沌时间序列建模中的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Modified K-Means Algorithm Based RBF Neural Network and Its Application in Time Series Modelling
In this paper, a modified K-means based RBFNN is discussed. To improve the performance of RBFNN, an initial cluster centers (ICCs) selection strategy is proposed for K-means algorithm. The algorithm takes breadth preferred subset of samples as ICCs to cover the sample space using greedy strategy. The results shows that the proposed algorithm can improve the performance of RBFNN remarkably in chaotic time series modelling.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信