{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T03:00:18Z","timestamp":1648782018634},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[1998,9]]},"abstract":"<jats:p> A study of the function approximation capabilities of single hidden layer neural networks strongly motivates the investigation of constructive learning techniques as a means of realizing established error bounds. Learning characteristics employed by constructive algorithms provide ideas for development of new algorithms applicable to the function approximation problem. In addition, constructive techniques offer efficient methods for network construction and weight determination. The development of a novel neural network algorithm, the Constructive Locally Fit Sigmoids (CLFS) function approximation algorithm, is presented in detail. Basis functions of global extent (piecewise linear sigmoidal functions) are locally fit to the target function, resulting in a pool of candidate hidden layer nodes from which a function approximation is obtained. This algorithm provides a methodology of selecting nodes in a meaningful way from the infinite set of possibilities and synthesizes an n node single hidden layer network with empirical and analytical results that strongly indicate an O(1\/n) mean squared training error bound under certain assumptions. The algorithm operates in polynomial time in the number of network nodes and the input dimension. Empirical results demonstrate its effectiveness on several multidimensional function approximate problems relative to contemporary constructive and nonconstructive algorithms. <\/jats:p>","DOI":"10.1142\/s0218213098000172","type":"journal-article","created":{"date-parts":[[2003,5,9]],"date-time":"2003-05-09T11:55:54Z","timestamp":1052481354000},"page":"373-398","source":"Crossref","is-referenced-by-count":0,"title":["A CONSTRUCTIVE NEURAL NETWORK ALGORITHM FOR FUNCTION APPROXIMATION USING LOCALLY FIT SIGMOIDS"],"prefix":"10.1142","volume":"07","author":[{"given":"TIM","family":"DRAELOS","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM 87131, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DON","family":"HUSH","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM 87131, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1989.1.3.312"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1109\/18.256500"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1109\/72.80287"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1109\/18.256506"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02551274"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1142\/S0129065795000056"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.2307\/2287576"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(89)90020-8"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176348546"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1109\/18.567673"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(09)80009-9"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(05)80057-7"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1142\/S0129065795000056"},{"key":"p_25","doi-asserted-by":"publisher","DOI":"10.1109\/72.508939"}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213098000172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T17:46:23Z","timestamp":1565199983000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213098000172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":14,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1998,9]]}},"alternative-id":["10.1142\/S0218213098000172"],"URL":"https:\/\/doi.org\/10.1142\/s0218213098000172","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}