{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:31:01Z","timestamp":1759336261010},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1007\/bf00117813","type":"journal-article","created":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T02:09:24Z","timestamp":1099188564000},"page":"129-139","source":"Crossref","is-referenced-by-count":20,"title":["Improving backpropagation learning with feature selection"],"prefix":"10.1007","volume":"6","author":[{"given":"Rudy","family":"Setiono","sequence":"first","affiliation":[]},{"given":"Huan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"no. 4","key":"CR1","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1080\/09540098908915647","volume":"1","author":"T. Ash","year":"1989","unstructured":"T. Ash, ?Dynamic node creation in backpropagation networks,? Connection Science, vol. 1, no. 4, pp. 365?375, 1989.","journal-title":"Connection Science"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"C.G. Broyden, ?The convergence of a class of double rank minimization, Algorithm 2, the new algorithm,? Journal of the Institute of Mathematics and Applications, no. 6, pp. 222?231, 1970.","DOI":"10.1093\/imamat\/6.3.222"},{"key":"CR3","first-page":"524","volume-title":"Advances in Neural Information Processing Systems II","author":"S.E. Fahlman","year":"1989","unstructured":"S.E. Fahlman and C. Lebiere, ?The cascade-correlation learning architecture,? in Advances in Neural Information Processing Systems II, edited by D. Touretzky, Morgan Kaufmann: San Mateo, CA, pp. 524?532, 1989."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"R. Fletcher, ?A new approach to variable metric algorithms,? Computer Journal, no. 13, pp. 317?322, 1970.","DOI":"10.1093\/comjnl\/13.3.317"},{"issue":"no. 2","key":"CR5","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1162\/neco.1990.2.2.198","volume":"2","author":"M. Frean","year":"1990","unstructured":"M. Frean, ?The upstart algorithm: a method for constructing and training feedforward neural networks,? Neural Computation, vol. 2, no. 2, pp. 198?209, 1990.","journal-title":"Neural Computation"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"D. Goldfarb, ?A family of variable metric algorithms derived by variational means,? Mathematics of Computation, no. 24, pp. 23?26, 1970.","DOI":"10.1090\/S0025-5718-1970-0258249-6"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"W. Iba, J. Wogulis, and P. Langley, ?Trading off simplicity and coverage in incremental concept learning,? in Proceedings of the 5th International Conference on Machine Learning, Ann Arbor, Michigan, 1988, pp. 73?79.","DOI":"10.1016\/B978-0-934613-64-4.50013-X"},{"key":"CR8","first-page":"52","volume-title":"Proceedings of the 1988 Connectionist Model Summer School","author":"K.J. Lang","year":"1988","unstructured":"K.J. Lang and M.J. Witbrock, ?Learning to tell two spirals apart,? in Proceedings of the 1988 Connectionist Model Summer School, edited by D. Touretzky, G. Hinton, and T. Sejnowski, Morgan Kaufmann: San Mateo, CA, 1988, pp. 52?59."},{"issue":"no. 12","key":"CR9","doi-asserted-by":"crossref","first-page":"2191","DOI":"10.1088\/0305-4470\/22\/12\/019","volume":"22","author":"M. Mezard","year":"1989","unstructured":"M. Mezard and J.P. Nadal, ?Learning in feedforward layered networks: The tiling algorithm,? Journal of Physics A, vol. 22, no. 12, pp. 2191?2203, 1989.","journal-title":"Journal of Physics A"},{"key":"CR10","volume-title":"UCI Repository of machine learning databases [Machine-readable data repository]","author":"P.M. Murphy","year":"1992","unstructured":"P.M. Murphy and D.W. Aha, UCI Repository of machine learning databases [Machine-readable data repository], University of California, Department of Information and Computer Science, Irvine, CA, 1992."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0893-6080(92)90008-7","volume":"5","author":"A. Ooyen van","year":"1992","unstructured":"A. van Ooyen and B. Nienhuis, ?Improving the convergence of the backpropagation algorithm,? Neural Networks, vol. 5, pp. 465?471, 1992.","journal-title":"Neural Networks"},{"key":"CR12","unstructured":"P.K.H. Phua and R. Setiono, ?Combined quasi-Newton updates for unconstrained optimization,? Dept. of Information Systems and Computer Science, National University of Singapore, Technical Report TR41\/92, 1992."},{"issue":"no. 1","key":"CR13","first-page":"81","volume":"1","author":"J.R. Quinlan","year":"1986","unstructured":"J.R. Quinlan, ?Induction of decision trees,? Machine Learning, vol. 1, no. 1, pp. 81?106, 1986.","journal-title":"Machine Learning"},{"key":"CR14","series-title":"Technical Report","volume-title":"Concept acquisition through representational adjustment","author":"J.S. Schlimmer","year":"1987","unstructured":"J.S. Schlimmer, ?Concept acquisition through representational adjustment,? Dept. of Information and Computer Science, University of California, Irvine, Technical Report 87?19, 1987."},{"issue":"no. 1","key":"CR15","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1109\/72.363426","volume":"6","author":"R. Setiono","year":"1995","unstructured":"R. Setiono and L.C.K. Hui, ?Use of quasi-Newton method in a feedforward neural network construction algorithm,? IEEE Transactions on Neural Networks, vol. 6, no. 1, pp. 273?277, 1995.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"no. 2","key":"CR16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1080\/09540099550039327","volume":"7","author":"R. Setiono","year":"1995","unstructured":"R. Setiono, ?A neural network construction algorithm which maximizes the likelihood function,? Connection Science, vol. 7, no. 2, pp. 147?166, 1995.","journal-title":"Connection Science"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"D.F. Shanno, ?Conditioning of quasi-Newton methods for function minimization,? Mathematics of Computation, no. 24, pp. 647?656, 1970.","DOI":"10.1090\/S0025-5718-1970-0274029-X"},{"issue":"no. 1","key":"CR18","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/72.80209","volume":"1","author":"M.F. Tenorio","year":"1990","unstructured":"M.F. Tenorio and W. Lee, ?Self-organizing network for optimum supervised learning,? IEEE Transactions on Neural Networks, vol. 1, no. 1, pp. 100?110, 1990.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"CR19","unstructured":"S.B. Thrun et al., ?The MONK's Problems?A performance comparison of different learning algorithms,? Department of Computer Science, Carnegie Mellon University, CMU-CS-91-197, 1991."}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00117813.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00117813\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00117813","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T14:09:56Z","timestamp":1554732596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00117813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["BF00117813"],"URL":"https:\/\/doi.org\/10.1007\/bf00117813","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}