{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T13:21:01Z","timestamp":1778592061366,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2007,7,17]],"date-time":"2007-07-17T00:00:00Z","timestamp":1184630400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Comput Applic"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s00521-007-0135-5","type":"journal-article","created":{"date-parts":[[2007,7,17]],"date-time":"2007-07-17T02:36:54Z","timestamp":1184639814000},"page":"433-439","source":"Crossref","is-referenced-by-count":50,"title":["A new constrained learning algorithm for function approximation by encoding a priori information into feedforward neural networks"],"prefix":"10.1007","volume":"17","author":[{"given":"Fei","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"De-Shuang","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,17]]},"reference":[{"issue":"6","key":"135_CR1","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1109\/TNN.2004.836237","volume":"15","author":"SC Ng","year":"2004","unstructured":"Ng SC, Cheung CC, Leung SH (2004) Magnified gradent function with deterministic weight modification in adaptive learning. IEEE Trans Neural Netw 15(6):1411\u20131423","journal-title":"IEEE Trans Neural Netw"},{"issue":"1","key":"135_CR2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1162\/neco.1989.1.1.151","volume":"1","author":"E Baum","year":"1989","unstructured":"Baum E, Haussler D (1989) What size net gives valid generalization? Neural Comput 1(1):151\u2013160","journal-title":"Neural Comput"},{"issue":"2","key":"135_CR3","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TNN.2004.824424","volume":"15","author":"DS Huang","year":"2004","unstructured":"Huang DS (2004) A constructive approach for finding arbitrary roots of polynomials by neural networks. IEEE Trans Neural Netw 15(2):477\u2013491","journal-title":"IEEE Trans Neural Netw"},{"issue":"2","key":"135_CR4","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1360\/01yf0437","volume":"47","author":"DS Huang","year":"2004","unstructured":"Huang DS, Zheru Chi (2004) Finding roots of arbitrary high order polynomials based on neural network recursive partitioning method. Sci China Ser F Inf Sci 47(2):232\u2013245","journal-title":"Sci China Ser F Inf Sci"},{"issue":"8","key":"135_CR5","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1162\/089976604774201668","volume":"16","author":"DS Huang","year":"2004","unstructured":"Huang DS, Ip HHS, Chi Z (2004) A neural root finder of polynomials based on root momnets. Neural Comput 16(8):1721\u20131762","journal-title":"Neural Comput"},{"issue":"5\u20136","key":"135_CR6","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0375-9601(03)00216-0","volume":"309","author":"DS Huang","year":"2003","unstructured":"Huang DS, Ip HHS, Chi Z, Wong HS (2003) Dilation method for finding close roots of polynomials based on constrained learning neural networks. Phys Lett A 309(5\u20136):443\u2013451","journal-title":"Phys Lett A"},{"issue":"6","key":"135_CR7","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1109\/72.471365","volume":"6","author":"DA Karras","year":"1995","unstructured":"Karras DA (1995) An efficient constrained training algorithm for feedforward networks. IEEE Trans Neural Netw 6(6):1420\u20131434","journal-title":"IEEE Trans Neural Netw"},{"key":"135_CR8","unstructured":"LeCun Y, Denker JS, Solla SA (1990) Optimal brain damage. In: Advances in neural information processing systems, vol 2. Morgan Kaufmann, San Mateo, pp 598\u2013605"},{"key":"135_CR9","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1126\/science.247.4945.978","volume":"247","author":"T Poggio","year":"1990","unstructured":"Poggio T, Girosi F (1990) Regularization algorithms for learning that are equivalent to multilayer networks. Science 247:978\u2013982","journal-title":"Science"},{"issue":"5","key":"135_CR10","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1109\/72.248452","volume":"4","author":"R Reed","year":"1993","unstructured":"Reed R (1993) Pruning algorithms\u2014a survey. IEEE Trans Neural Netw 4(5):740\u2013747","journal-title":"IEEE Trans Neural Netw"},{"key":"135_CR11","first-page":"70","volume-title":"Systematic theory of neural networks for pattern recognition","author":"DS Huang","year":"1996","unstructured":"Huang DS (1996) Systematic theory of neural networks for pattern recognition. Publishing House of Electronic Industry of China, Beijing, pp 70\u2013118"},{"issue":"5","key":"135_CR12","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1109\/72.248466","volume":"4","author":"CM Bishop","year":"1993","unstructured":"Bishop CM (1993) Curvature-driven smoothing: a learning algorithm for feedforward networks. IEEE Trans Neural Netw 4(5):882\u2013884","journal-title":"IEEE Trans Neural Netw"},{"issue":"6","key":"135_CR13","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1109\/72.471372","volume":"6","author":"M Cottrell","year":"1995","unstructured":"Cottrell M, Girard B et\u00a0al (1995) Neural modeling for time series: a statistical stepwise method for weight limitation. IEEE Trans Neural Netw 6(6):1355\u20131364","journal-title":"IEEE Trans Neural Netw"},{"key":"135_CR14","unstructured":"Huang DS (2002) Constrained learning algorithms for finding the roots of polynomials: a case study. In: IEEE Region 10 technical conference on computers, communications, control and power engineering, vol. III, Beijing, China, pp 1516\u20131520"},{"key":"135_CR15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0925-2312(00)00296-4","volume":"35","author":"SY Jeong","year":"2000","unstructured":"Jeong SY, Lee SY (2000) Adaptive learning algorithms to incorporate additional functional constraints into neural networks. Neurocomputing 35:73\u201390","journal-title":"Neurocomputing"},{"issue":"7","key":"135_CR16","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1016\/0893-6080(96)00042-1","volume":"9","author":"D-G Jeong","year":"1996","unstructured":"Jeong D-G, Lee S-Y (1996) Merging back-propagation and Hebbian learning rules for robust classifications. Neural Netw 9(7):1213\u20131222","journal-title":"Neural Netw"},{"key":"135_CR17","doi-asserted-by":"crossref","unstructured":"Han Fei, Huang DS, Yiu-Ming Cheung, Guang-Bin Huang (2005) A new modified hybrid learning algorithm for feedforward neural networks. Lecture Notes in Computer Science, vol 3496. Springer, Heidelberg, pp 572\u2013577 (International Symposium on Neural Network, Chongqing, May 30\u2013June 1, China)","DOI":"10.1007\/11427391_91"},{"key":"135_CR18","first-page":"106","volume-title":"Mathematical analysis lectures","author":"Y Liu","year":"1992","unstructured":"Liu Y, Fu P (1992) Mathematical Analysis Lectures, vol II, 3rd edn. Higher Education Press, Beijing, pp 106\u2013127","edition":"vol II, 3rd edn"},{"issue":"2","key":"135_CR19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0893-6080(94)00067-V","volume":"8","author":"SJ Perantonis","year":"1995","unstructured":"Perantonis SJ, Karras DA (1995) An efficient constrained learning algorithm with momentum acceleration. Neural Netw 8(2):237\u2013249","journal-title":"Neural Netw"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-007-0135-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-007-0135-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-007-0135-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T02:06:56Z","timestamp":1559095616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-007-0135-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,17]]},"references-count":19,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["135"],"URL":"https:\/\/doi.org\/10.1007\/s00521-007-0135-5","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,17]]}}}