{"title":"一种逼近不连续函数的增量网络构造算法","authors":"Hyukjoon Lee, K. Mehrotra, C. Mohan, S. Ranka","doi":"10.1109/ICNN.1994.374556","DOIUrl":null,"url":null,"abstract":"Traditional neural network training techniques do not work well on problems with many discontinuities, such as those that arise in multicomputer communication cost modeling. We develop a new algorithm to solve this problem. This algorithm incrementally adds modules to the network, successively expanding the 'window' in the data space where the current module works well. The need for a new module is automatically recognized by the system. This algorithm performs very well on problems with many discontinuities, and requires fewer computations than traditional backpropagation.<<ETX>>","PeriodicalId":209128,"journal":{"name":"Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An incremental network construction algorithm for approximating discontinuous functions\",\"authors\":\"Hyukjoon Lee, K. Mehrotra, C. Mohan, S. Ranka\",\"doi\":\"10.1109/ICNN.1994.374556\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditional neural network training techniques do not work well on problems with many discontinuities, such as those that arise in multicomputer communication cost modeling. We develop a new algorithm to solve this problem. This algorithm incrementally adds modules to the network, successively expanding the 'window' in the data space where the current module works well. The need for a new module is automatically recognized by the system. This algorithm performs very well on problems with many discontinuities, and requires fewer computations than traditional backpropagation.<<ETX>>\",\"PeriodicalId\":209128,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94)\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNN.1994.374556\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNN.1994.374556","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An incremental network construction algorithm for approximating discontinuous functions
Traditional neural network training techniques do not work well on problems with many discontinuities, such as those that arise in multicomputer communication cost modeling. We develop a new algorithm to solve this problem. This algorithm incrementally adds modules to the network, successively expanding the 'window' in the data space where the current module works well. The need for a new module is automatically recognized by the system. This algorithm performs very well on problems with many discontinuities, and requires fewer computations than traditional backpropagation.<>