{"title":"一种基于模拟退火算法的改进BP神经算法","authors":"Kai Bai, Jing Xiong","doi":"10.1109/WGEC.2009.39","DOIUrl":null,"url":null,"abstract":"This paper analyses the BP algorithm in detail, including the number of hidden layer, the amount of neural node and training algorithm. In order to improve the training speed, this paper adopts the automatic and adaptive step to perfect the BP algorithm. In addition, because the traditional BP neural network is easy to trap into local minimum, this paper makes use of the characteristic of simulated annealing algorithm and let it unite with BP algorithm. Because the simulated annealing algorithm can get optimal approximation by searching local, it can help BP algorithm not to trap into local minimum.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Method of Improved BP Neural Algorithm Based on Simulated Annealing Algorithm\",\"authors\":\"Kai Bai, Jing Xiong\",\"doi\":\"10.1109/WGEC.2009.39\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper analyses the BP algorithm in detail, including the number of hidden layer, the amount of neural node and training algorithm. In order to improve the training speed, this paper adopts the automatic and adaptive step to perfect the BP algorithm. In addition, because the traditional BP neural network is easy to trap into local minimum, this paper makes use of the characteristic of simulated annealing algorithm and let it unite with BP algorithm. Because the simulated annealing algorithm can get optimal approximation by searching local, it can help BP algorithm not to trap into local minimum.\",\"PeriodicalId\":277950,\"journal\":{\"name\":\"2009 Third International Conference on Genetic and Evolutionary Computing\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Third International Conference on Genetic and Evolutionary Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WGEC.2009.39\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Third International Conference on Genetic and Evolutionary Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WGEC.2009.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Method of Improved BP Neural Algorithm Based on Simulated Annealing Algorithm
This paper analyses the BP algorithm in detail, including the number of hidden layer, the amount of neural node and training algorithm. In order to improve the training speed, this paper adopts the automatic and adaptive step to perfect the BP algorithm. In addition, because the traditional BP neural network is easy to trap into local minimum, this paper makes use of the characteristic of simulated annealing algorithm and let it unite with BP algorithm. Because the simulated annealing algorithm can get optimal approximation by searching local, it can help BP algorithm not to trap into local minimum.