{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T10:45:59Z","timestamp":1760265959587,"version":"3.30.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"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":[[2000,9]]},"DOI":"10.1016\/s0925-2312(00)00311-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:12:37Z","timestamp":1027606357000},"page":"29-53","source":"Crossref","is-referenced-by-count":11,"title":["Pruning of basis functions in nonlinear approximators"],"prefix":"10.1016","volume":"34","author":[{"given":"Hema","family":"Chandrasekaran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung-Han","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael T.","family":"Manry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0925-2312(00)00311-8_BIB1","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1109\/TAC.1974.1100705","article-title":"A new look at the statistical model identification","volume":"AC-19","author":"Akaike","year":"1974","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/S0925-2312(00)00311-8_BIB2","first-page":"519","article-title":"A back-propagation algorithm with optimal use of hidden units","volume":"1","author":"Chauvin","year":"1989"},{"issue":"1\u20133","key":"10.1016\/S0925-2312(00)00311-8_BIB3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0925-2312(98)00109-X","article-title":"A neural network training algorithm utilizing multiple sets of linear equations","volume":"25","author":"Chen","year":"1999","journal-title":"Neurocomputing"},{"key":"10.1016\/S0925-2312(00)00311-8_BIB4","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/S0893-6080(05)80122-4","article-title":"Improving model selection by nonconvergent methods","volume":"6","author":"Finnoff","year":"1993","journal-title":"Neural Networks"},{"key":"10.1016\/S0925-2312(00)00311-8_BIB5","series-title":"Numerical Methods for Unconstrained Optimization","article-title":"Conjugate direction methods","author":"Fletcher","year":"1972"},{"issue":"2","key":"10.1016\/S0925-2312(00)00311-8_BIB6","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/36.134085","article-title":"Backscattering from a randomly rough dielectric surface","volume":"30","author":"Fung","year":"1992","journal-title":"IEEE Trans. Geosc. Remote Sensing"},{"issue":"1","key":"10.1016\/S0925-2312(00)00311-8_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/neco.1992.4.1.1","article-title":"Neural networks and the bias\/variance dilemma","volume":"4","author":"Gemen","year":"1992","journal-title":"Neural Comput."},{"key":"10.1016\/S0925-2312(00)00311-8_BIB8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1162\/neco.1995.7.2.219","article-title":"Regularization theory and neural networks architectures","volume":"7","author":"Girosi","year":"1995","journal-title":"Neural Comput."},{"key":"10.1016\/S0925-2312(00)00311-8_BIB9","doi-asserted-by":"crossref","unstructured":"B. Hassibi, D.G. Stork, G.J. Wolff, Optimal brain surgeon and general network pruning, IEEE International Conference on Neural Networks, 1993, 293\u2013299.","DOI":"10.1109\/ICNN.1993.298572"},{"key":"10.1016\/S0925-2312(00)00311-8_BIB10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1080\/02757259409532217","article-title":"Analysis and optimization of neural networks for remote sensing","volume":"9","author":"Jiang","year":"1994","journal-title":"Remote Sensing Rev."},{"issue":"2","key":"10.1016\/S0925-2312(00)00311-8_BIB11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/72.80236","article-title":"A simple procedure for pruning back-propagation trained neural networks","volume":"1","author":"Karnin","year":"1990","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0925-2312(00)00311-8_BIB12","doi-asserted-by":"crossref","unstructured":"S.Y. Kung, Y.H. Hu, A Frobenius approximation reduction method (FARM) for determining optimal number of hidden units, Proceedings of the International Joint Conference on Neural Networks, Seattle vol. 2, 1991, pp. 163\u2013165.","DOI":"10.1109\/IJCNN.1991.155331"},{"key":"10.1016\/S0925-2312(00)00311-8_BIB13","first-page":"598","article-title":"Optimal brain damage","volume":"2","author":"LeCun","year":"1990"},{"key":"10.1016\/S0925-2312(00)00311-8_BIB14","doi-asserted-by":"crossref","unstructured":"J. Moody, Prediction risk and architecture selection for neural networks in: V. Cherkassky, J.H. Friedman, H. Wechsler (Eds.), From Statistics to Neural Networks: Theory and Pattern Recognition Applications, NATO ASI Series F, Springer, Berlin, 1994.","DOI":"10.1007\/978-3-642-79119-2_7"},{"key":"10.1016\/S0925-2312(00)00311-8_BIB15","doi-asserted-by":"crossref","unstructured":"M.C. Mozer, P. Smolensky, Skeletonization: a technique for trimming the fat from a network via relevance assessment, in: D.S. Touretzky (Ed.), Advanced in Neural Information Processing, Vol. 1, 1989, pp. 107\u2013115.","DOI":"10.1080\/09540098908915626"},{"issue":"3","key":"10.1016\/S0925-2312(00)00311-8_BIB16","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/0893-6080(95)00123-9","article-title":"A quantitative study of experimental evaluations of neural network learning algorithms","volume":"9","author":"Prechelt","year":"1996","journal-title":"Neural Networks"},{"key":"10.1016\/S0925-2312(00)00311-8_BIB17","unstructured":"L. Prechelt, PROBEN1 \u2014 A set of neural network benchmark problems and benchmarking rules, Technical Report 21\/94, Universitat Karlsruhe, Germany, ftp:\/\/ftp.ira.uka.de\/pub\/papers\/techreports\/1994\/1994-21.ps.gz"},{"year":"1997","series-title":"Numerical Recipes","author":"Press","key":"10.1016\/S0925-2312(00)00311-8_BIB18"},{"issue":"5","key":"10.1016\/S0925-2312(00)00311-8_BIB19","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1109\/72.248452","article-title":"Pruning algorithms \u2014 A survey","volume":"4","author":"Reed","year":"1993","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0925-2312(00)00311-8_BIB20","doi-asserted-by":"crossref","unstructured":"D.E. Rumelhart, J.L. McClelland, Parallel Distributed Processing, Vol. 1, The MIT Press, Cambridge, MA, 1986.","DOI":"10.7551\/mitpress\/5236.001.0001"},{"key":"10.1016\/S0925-2312(00)00311-8_BIB21","doi-asserted-by":"crossref","unstructured":"A. Sankar, R.J. Mammone, Optimal pruning of neural tree networks for improved generalization, Proceedings of the International Joint Conference on Neural Networks, Seattle, Vol. 2, 1991, pp. 219\u2013224.","DOI":"10.1109\/IJCNN.1991.155341"},{"issue":"1","key":"10.1016\/S0925-2312(00)00311-8_BIB22","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1109\/78.157194","article-title":"A fast new algorithm for training feedforward neural networks","volume":"40","author":"Scalero","year":"1992","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/S0925-2312(00)00311-8_BIB23","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1111\/j.2517-6161.1977.tb01603.x","article-title":"An asymptotic equivalence of choice of model by cross-validation and Akaike's criterion","volume":"39","author":"Stone","year":"1977","journal-title":"J. Roy. Stat. Soc. Ser."}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231200003118?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231200003118?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T01:42:40Z","timestamp":1733276560000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231200003118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":23,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0925231200003118"],"URL":"https:\/\/doi.org\/10.1016\/s0925-2312(00)00311-8","relation":{},"ISSN":["0925-2312"],"issn-type":[{"type":"print","value":"0925-2312"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}