{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:02:04Z","timestamp":1774796524940,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[1993,11]]},"DOI":"10.1016\/0925-2312(93)90041-z","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T04:56:11Z","timestamp":1060318571000},"page":"273-286","source":"Crossref","is-referenced-by-count":25,"title":["Optimization of the neural net connectivity pattern using a backpropagation algorithm"],"prefix":"10.1016","volume":"5","author":[{"given":"K.","family":"KrishnaKumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-2312(93)90041-Z_BIB1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF00204596","article-title":"On the ability of neural networks to perform generalization by induction","volume":"61","author":"Anshelevich","year":"1989","journal-title":"Biol. Cybernet."},{"key":"10.1016\/0925-2312(93)90041-Z_BIB2","first-page":"265","article-title":"Why two hidden layers are better than one","volume":"Vol. I","author":"Chester","year":"1991"},{"key":"10.1016\/0925-2312(93)90041-Z_BIB3","series-title":"Advances in Neural Information Processing Systems 2","article-title":"The cascade-correlation learning architecture","author":"Fahlman","year":"1990"},{"key":"10.1016\/0925-2312(93)90041-Z_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0893-6080(91)90032-Z","article-title":"Backpropagation algorithm which varies the number of hidden units","volume":"4","author":"Hirose","year":"1990","journal-title":"Neural Networks"},{"key":"10.1016\/0925-2312(93)90041-Z_BIB5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0893-6080(91)90009-T","article-title":"Approximation capabilities of multi-layer feedforward networks","volume":"4","author":"Hornik","year":"1991","journal-title":"Neural Networks"},{"key":"10.1016\/0925-2312(93)90041-Z_BIB6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0925-2312(92)90040-V","article-title":"Supporting supervised learning by self-organization","volume":"4","author":"Hrycej","year":"1992","journal-title":"Neurocomputing"},{"key":"10.1016\/0925-2312(93)90041-Z_BIB7","series-title":"BER Report # 506-177","article-title":"Synthesis and experimental verification of a simulator-based automated helicopter hover trainer","author":"KrishnaKumar","year":"1990"},{"key":"10.1016\/0925-2312(93)90041-Z_BIB8","series-title":"Tech. Rpt. CU-CS-421-89","article-title":"Skeletonization: A technique for trimming the fat from a network via relevance assessment","author":"Mozer","year":"1989"},{"key":"10.1016\/0925-2312(93)90041-Z_BIB9","author":"Rumelhart","year":"1986"},{"key":"10.1016\/0925-2312(93)90041-Z_BIB10","first-page":"19","article-title":"A non-iterative method for training feed-forward networks","volume":"Vol. II","author":"Schmidt","year":"1991"},{"key":"10.1016\/0925-2312(93)90041-Z_BIB11","first-page":"447","article-title":"Fault tolerance of pruned multilayer networks","volume":"Vol. II","author":"Segee","year":"1991"},{"key":"10.1016\/0925-2312(93)90041-Z_BIB12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0893-6080(91)90033-2","article-title":"Creating artificial neural networks that generalize","volume":"4","author":"Sietsma","year":"1991","journal-title":"Neural Networks"},{"key":"10.1016\/0925-2312(93)90041-Z_BIB13","series-title":"Proc. 1990 Connectionist Models Summer School","first-page":"105","article-title":"Backpropagation, weight-elimination and time series prediction","author":"Weigend","year":"1990"},{"key":"10.1016\/0925-2312(93)90041-Z_BIB14","first-page":"1550","article-title":"Backpropagation through time: What it does and how to do it","volume":"78","author":"Werbos","year":"1990"}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092523129390041Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092523129390041Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T01:55:09Z","timestamp":1552614909000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092523129390041Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["092523129390041Z"],"URL":"https:\/\/doi.org\/10.1016\/0925-2312(93)90041-z","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}