{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T19:10:41Z","timestamp":1741201841653,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642211041"},{"type":"electronic","value":"9783642211058"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21105-8_59","type":"book-chapter","created":{"date-parts":[[2011,5,20]],"date-time":"2011-05-20T12:33:53Z","timestamp":1305894833000},"page":"514-520","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Construction of Multilayer Neural Networks for Classification"],"prefix":"10.1007","author":[{"given":"Jiqian","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunde","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"59_CR1","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","volume":"2","author":"K. Hornik","year":"1989","unstructured":"Hornik, K., Stinchcombe, M., White, H.: Multilayer feedforward networks are universal approximators. Neural Networks\u00a02, 359\u2013366 (1989)","journal-title":"Neural Networks"},{"key":"59_CR2","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1109\/31.31313","volume":"36","author":"G. Mirchandani","year":"1989","unstructured":"Mirchandani, G., Cao, W.: On hidden nodes for neural nets. IEEE Transactions on Circuits and Systems\u00a036, 661\u2013664 (1989)","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"59_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/neco.1992.4.1.1","volume":"4","author":"S. Geman","year":"1992","unstructured":"Geman, S., Bienenstock, E., Doursat, R.: Neural Networks and the Bias\/Variance Dilemma. Neural Computation\u00a04, 1\u201358 (1992)","journal-title":"Neural Computation"},{"key":"59_CR4","unstructured":"Lawrence, S., Giles, C.L., Tsoi, A.C.: What Size Neural Network Gives Optimal Generalization? In: Convergence Properties of Backpropagation. Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742 (1996)"},{"key":"59_CR5","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/18.661502","volume":"44","author":"P.L. Bartlett","year":"1998","unstructured":"Bartlett, P.L.: The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network. IEEE Transaction on Information Theory\u00a044, 525\u2013536 (1998)","journal-title":"IEEE Transaction on Information Theory"},{"key":"59_CR6","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1080\/09540098908915647","volume":"1","author":"T. Ash","year":"1989","unstructured":"Ash, T.: Dynamic Node Creation in Backpropagation Networks. Connection Science\u00a01, 365\u2013375 (1989)","journal-title":"Connection Science"},{"key":"59_CR7","first-page":"162","volume-title":"Advances in Neural Information Processing Systems","author":"A. Elisseeff","year":"1997","unstructured":"Elisseeff, A., PaugamMoisy, H.: Size of multilayer networks for exact learning: analytic approach. In: Michael, I., Jordan, M.C.M., Petsche, T. (eds.) Advances in Neural Information Processing Systems, vol.\u00a09, pp. 162\u2013168. The MIT Press, Cambridge (1997)"},{"key":"59_CR8","doi-asserted-by":"crossref","unstructured":"Fletcher, L., Katkovnik, S.F., Engelbrecht, A.: Optimizing the number of hidden nodes of a feedforward artificial neural network. In: IEEE International Joint Conference on Neural Networks, vol.\u00a02, pp. 1608\u20131612 (1998)","DOI":"10.1109\/IJCNN.1998.686018"},{"key":"59_CR9","unstructured":"Sarle, W.S.: Stopped training and other remedies for overfitting. In: 27th Symposium on the Interface, pp. 352\u2013360 (1995)"},{"key":"59_CR10","first-page":"43","volume-title":"Theoretical Aspects of Neural Computation: A Multidisciplinary Perspective","author":"L. Xu","year":"1997","unstructured":"Xu, L.: Bayesian Ying-Yang System and Theory as A Unified Statistical Learning Approach (III) Models and Algorithms for Dependence Reduction, Data Dimension Reduction, ICA and Supervised Learning. In: Wong, K.M., King, I., Yeung, D.-Y. (eds.) Theoretical Aspects of Neural Computation: A Multidisciplinary Perspective, pp. 43\u201360. Springer, Heidelberg (1997)"},{"key":"59_CR11","unstructured":"Xu, S., Chen, L.: A novel approach for determining the optimal number of hidden layer neurons for FNN\u2019s and its application in data mining. In: 5th International Conference on Information Technology and Applications, pp. 683\u2013686 (2008)"},{"key":"59_CR12","first-page":"273","volume":"20","author":"V. Vapnik","year":"1995","unstructured":"Vapnik, V.: Support-vector networks. Machine Learning\u00a020, 273\u2013297 (1995)","journal-title":"Machine Learning"},{"key":"59_CR13","first-page":"1","volume":"208","author":"J. Platt","year":"1998","unstructured":"Platt, J.: Sequential minimal optimization: A fast algorithm for training support vector machines. Advances in Kernel MethodsSupport Vector Learning\u00a0208, 1\u201321 (1998)","journal-title":"Advances in Kernel MethodsSupport Vector Learning"},{"key":"59_CR14","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Communications of the ACM\u00a027, 1134\u20131142 (1984)","journal-title":"Communications of the ACM"},{"key":"59_CR15","doi-asserted-by":"crossref","unstructured":"Schapire, R.E.: The Strength of Weak Learnability. In: 30th Annual Symposium on Foundations of Computer Science, pp. 28\u201333 (1989)","DOI":"10.1109\/SFCS.1989.63451"},{"key":"59_CR16","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R.E. Schapire","year":"1998","unstructured":"Schapire, R.E., Freund, Y., Bartlett, P., Lee, W.S.: Boosting the margin: a new explanation for the effectiveness of voting methods. The Annals of Statistics\u00a026, 1651\u20131686 (1998)","journal-title":"The Annals of Statistics"}],"container-title":["Lecture Notes in Computer Science","Advances in Neural Networks \u2013 ISNN 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21105-8_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T18:16:20Z","timestamp":1741198580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21105-8_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642211041","9783642211058"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21105-8_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}