{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:15:12Z","timestamp":1775067312298,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030209117","type":"print"},{"value":"9783030209124","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-20912-4_23","type":"book-chapter","created":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T19:02:29Z","timestamp":1558897349000},"page":"236-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constructive Cascade Learning Algorithm for Fully Connected Networks"],"prefix":"10.1007","author":[{"given":"Xing","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawel","family":"Rozycki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janusz","family":"Kolbusz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bogdan M.","family":"Wilamowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,24]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"DE Rumelhart","year":"1986","unstructured":"Rumelhart, D.E., Hinton, G.E., Williams, R.J.: Learning representations by back-propagating errors. Nature 323, 533\u2013536 (1986)","journal-title":"Nature"},{"key":"23_CR2","first-page":"38","volume-title":"Proceedings of the 1988 Connectionist Models Summer School (Pittsburgh, 1988)","author":"SE Fahlman","year":"1989","unstructured":"Fahlman, S.E.: Fast learning variations on back-propagation: an empirical study. In: Touretzky, D., Hinton, G., Sejnowski, T. (eds.) Proceedings of the 1988 Connectionist Models Summer School (Pittsburgh, 1988), pp. 38\u201351. Morgan Kaufmann, San Mateo (1989)"},{"key":"23_CR3","unstructured":"Riedmiller, M., Braun, H.: A direct adaptive method for faster backpropagation learning: the RPROP algorithm. In: Ruspini, H. (ed.) Proceeding of the IEEE International Conference on Neural Networks (ICNN), San Francisco, pp. 586\u2013591 (1993)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1109\/72.329697","volume":"5","author":"MT Hagan","year":"1994","unstructured":"Hagan, M.T., Menhaj, M.: Training feedforward networks with the Marquardt algorithm. IEEE Trans. Neural Networks 5, 989\u2013993 (1994)","journal-title":"IEEE Trans. Neural Networks"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Battiti, R., Masulli, F.: BFGS optimization for faster automated supervised learning. In: International Neural-Network Conference, vol. 2, pp. 757\u2013760 (1990)","DOI":"10.1007\/978-94-009-0643-3_68"},{"issue":"5","key":"23_CR6","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1109\/72.623214","volume":"8","author":"TY Kwok","year":"1997","unstructured":"Kwok, T.Y., Yeung, D.Y.: Objective functions for training new hidden units in constructive neural networks. IEEE Trans. Neural Networks 8(5), 1131\u20131148 (1997)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1109\/TIE.2014.2361600","volume":"62","author":"S Hussain","year":"2015","unstructured":"Hussain, S., Mokhtar, M., Howe, J.M.: Sensor failure detection, identification, and accommodation using fully connected cascade neural network. IEEE Trans. Industr. Electron. 62(3), 1683\u20131692 (2015)","journal-title":"IEEE Trans. Industr. Electron."},{"issue":"12","key":"23_CR8","doi-asserted-by":"publisher","first-page":"2668","DOI":"10.1109\/TCYB.2014.2379621","volume":"45","author":"G Deshpande","year":"2015","unstructured":"Deshpande, G., Wang, P., Rangaprakash, D., Wilamowski, B.M.: Fully connected cascade artificial neural network architecture for attention deficit hyperactivity disorder classification from functional magnetic resonance imaging data. IEEE Trans. Cybern. 45(12), 2668\u20132679 (2015)","journal-title":"IEEE Trans. Cybern."},{"issue":"4","key":"23_CR9","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1109\/TNN.2006.875977","volume":"17","author":"G-B Huang","year":"2006","unstructured":"Huang, G.-B., Chen, L., Siew, C.-K.: Universal approximation using incremental constructive feedforward networks with random hidden nodes. IEEE Trans. Neural Networks 17(4), 879\u2013892 (2006)","journal-title":"IEEE Trans. Neural Networks"},{"key":"23_CR10","first-page":"524","volume-title":"Advances in Neural Information Processing Systems","author":"SE Fahlman","year":"1990","unstructured":"Fahlman, S.E., Lebiere, C.: The cascade-correlation learning architecture. In: Touretzky, D.S. (ed.) Advances in Neural Information Processing Systems, vol. 2, pp. 524\u2013532. Morgan Kaufmann, San Mateo (1990)"},{"key":"23_CR11","unstructured":"Kwok, T.K., Young, D.Y.: Experimental analysis of input weight freezing in constructive neural networks. In: Proceedings of IEEE International Conference Neural Networks, San Francisco, pp. 511\u2013516 (1993)"},{"key":"23_CR12","unstructured":"Baluja, S., Fahlman, S.: Reducing network depth in the cascade-correlation learning architecture, Technical report, Carnegie Mellon University, Pittsburgh"},{"issue":"5","key":"23_CR13","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1016\/S0893-6080(96)00115-3","volume":"10","author":"L Prechelt","year":"1997","unstructured":"Prechelt, L.: Investigating the cascor family of learning algorithms. Neural Networks 10(5), 885\u2013896 (1997)","journal-title":"Neural Networks"},{"issue":"11","key":"23_CR14","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1109\/TCSI.2012.2189060","volume":"59","author":"G-B Huang","year":"2012","unstructured":"Huang, G.-B., Chen, L.: Orthogonal least squares algorithm for training cascade neural networks. IEEE Trans. Circuits Syst. I Regul. Pap. 59(11), 2629\u20132637 (2012)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/BFb0032532","volume-title":"Biological and Artificial Computation: From Neuroscience to Technology","author":"NK Treadgold","year":"1997","unstructured":"Treadgold, N.K., Gedeon, T.D.: A cascade network algorithm employing progressive RPROP. In: Mira, J., Moreno-D\u00edaz, R., Cabestany, J. (eds.) IWANN 1997. LNCS, vol. 1240, pp. 733\u2013742. Springer, Heidelberg (1997). \n                      https:\/\/doi.org\/10.1007\/BFb0032532"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-39378-0_15","volume-title":"Artificial Intelligence and Soft Computing","author":"X Wu","year":"2016","unstructured":"Wu, X., Rozycki, P., Wilamowski, B.M.: Single layer feedforward networks construction based on orthogonal least square and particle swarm optimization. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2016. LNCS (LNAI), vol. 9692, pp. 158\u2013169. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-39378-0_15"},{"issue":"8","key":"23_CR17","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1109\/TNNLS.2014.2350957","volume":"26","author":"X Wu","year":"2015","unstructured":"Wu, X., Rozycki, P., Wilamowski, B.M.: A hybrid constructive algorithm for single layer feedforward networks learning. IEEE Trans Neural Networks Learn. Syst. 26(8), 1659\u20131668 (2015)","journal-title":"IEEE Trans Neural Networks Learn. Syst."},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/72.485631","volume":"7","author":"JN Hwang","year":"1996","unstructured":"Hwang, J.N., You, S.S., Lay, S.R., Jou, I.C.: The cascade-correlation learning: a projection pursuit learning perspective. IEEE Trans. Neural Networks 7, 278\u2013289 (1996)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"6","key":"23_CR19","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1109\/TNN.2010.2045657","volume":"21","author":"BM Wilamowski","year":"2010","unstructured":"Wilamowski, B.M., Yu, H.: Improved computation for Levenberg-Marquardt training. IEEE Trans. Neural Networks 21(6), 930\u2013937 (2010)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"11","key":"23_CR20","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1109\/TNN.2010.2073482","volume":"21","author":"BM Wilamowski","year":"2010","unstructured":"Wilamowski, B.M., Yu, H.: Neural network learning without backpropagation. IEEE Trans. Neural Networks 21(11), 1793\u20131803 (2010)","journal-title":"IEEE Trans. Neural Networks"},{"key":"23_CR21","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Network, Perth, Australia, pp. 1942\u20131948 (1995)"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1109\/72.286906","volume":"5","author":"JN Hwang","year":"1994","unstructured":"Hwang, J.N., Lay, S.R., Maechler, M., Martin, D., Schimert, J.: Regression modeling in backpropagation and projection pursuit learning. IEEE Trans. Neural Networks 5, 342\u2013353 (1994)","journal-title":"IEEE Trans. Neural Networks"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/72.701179","volume":"9","author":"NK Treadgold","year":"1998","unstructured":"Treadgold, N.K., Gedeon, T.D.: Simulated annealing and weigh decay in adaptive learning: the SARPROP algorithm. IEEE Trans. Neural Networks 9, 662\u2013668 (1998)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"2","key":"23_CR24","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1109\/TII.2012.2187914","volume":"8","author":"D Hunter","year":"2012","unstructured":"Hunter, D., Yu, H., Pukish, M.S., Kolbusz, J., Wilamowski, B.M.: Selection of proper neural network sizes and architectures-a comparative study. IEEE Trans. Industr. Inf. 8(2), 228\u2013240 (2012)","journal-title":"IEEE Trans. Industr. Inf."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20912-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T19:14:13Z","timestamp":1558898053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20912-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030209117","9783030209124"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20912-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Soft Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zakopane","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/icaisc.eu\/About","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Own online software","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"333","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"122","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}