{"title":"一种改进的反向传播/柯西机网络","authors":"T.-T. Lee, Jin-Tsong Jeng","doi":"10.1109/ISIE.1993.268787","DOIUrl":null,"url":null,"abstract":"To overcome the shortcomings of the backpropagation (Bp) algorithm, namely, slow convergence, local minimum, and paralysis problems, a combined backpropagation/Cauchy (Bp/Cauchy) machine has been proposed by Wasserman (1990). In this paper, a switching condition is introduced to improve the backpropagation/Cauchy machine network. To illustrate the effectiveness of the proposed method, examples of xor and the learning of a unknown function are included. Results show that the improved Bp/Cauchy machine is more effective in learning than the original Bp/Cauchy machine.<<ETX>>","PeriodicalId":267349,"journal":{"name":"ISIE '93 - Budapest: IEEE International Symposium on Industrial Electronics Conference Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An improved back-propagation/Cauchy machine network\",\"authors\":\"T.-T. Lee, Jin-Tsong Jeng\",\"doi\":\"10.1109/ISIE.1993.268787\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To overcome the shortcomings of the backpropagation (Bp) algorithm, namely, slow convergence, local minimum, and paralysis problems, a combined backpropagation/Cauchy (Bp/Cauchy) machine has been proposed by Wasserman (1990). In this paper, a switching condition is introduced to improve the backpropagation/Cauchy machine network. To illustrate the effectiveness of the proposed method, examples of xor and the learning of a unknown function are included. Results show that the improved Bp/Cauchy machine is more effective in learning than the original Bp/Cauchy machine.<<ETX>>\",\"PeriodicalId\":267349,\"journal\":{\"name\":\"ISIE '93 - Budapest: IEEE International Symposium on Industrial Electronics Conference Proceedings\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ISIE '93 - Budapest: IEEE International Symposium on Industrial Electronics Conference Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIE.1993.268787\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ISIE '93 - Budapest: IEEE International Symposium on Industrial Electronics Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIE.1993.268787","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An improved back-propagation/Cauchy machine network
To overcome the shortcomings of the backpropagation (Bp) algorithm, namely, slow convergence, local minimum, and paralysis problems, a combined backpropagation/Cauchy (Bp/Cauchy) machine has been proposed by Wasserman (1990). In this paper, a switching condition is introduced to improve the backpropagation/Cauchy machine network. To illustrate the effectiveness of the proposed method, examples of xor and the learning of a unknown function are included. Results show that the improved Bp/Cauchy machine is more effective in learning than the original Bp/Cauchy machine.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
