{"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}
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.