{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:52:19Z","timestamp":1743155539229,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319193236"},{"type":"electronic","value":"9783319193243"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19324-3_4","type":"book-chapter","created":{"date-parts":[[2015,6,4]],"date-time":"2015-06-04T15:39:34Z","timestamp":1433432374000},"page":"39-48","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of Shallow Networks Representing Finite Mappings"],"prefix":"10.1007","author":[{"given":"V\u011bra","family":"K\u016frkov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"Feedforward Neural Network Methodology","author":"T.L. Fine","year":"1999","unstructured":"Fine, T.L.: Feedforward Neural Network Methodology. Springer, Heidelberg (1999)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1162\/neco.2006.18.7.1527","volume":"18","author":"G.E. Hinton","year":"2006","unstructured":"Hinton, G.E., Osindero, S., Teh, Y.W.: A fast learning algorithm for deep belief nets. Neural Computation\u00a018, 1527\u20131554 (2006)","journal-title":"Neural Computation"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000006","volume":"2","author":"Y. Bengio","year":"2009","unstructured":"Bengio, Y.: Learning deep architectures for AI. Foundations and Trends in Machine Learning\u00a02, 1\u2013127 (2009)","journal-title":"Foundations and Trends in Machine Learning"},{"key":"4_CR4","first-page":"69","volume":"17","author":"Y. Ito","year":"1992","unstructured":"Ito, Y.: Finite mapping by neural networks and truth functions. Mathematical Scientist\u00a017, 69\u201377 (1992)","journal-title":"Mathematical Scientist"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01893414","volume":"2","author":"C.A. Micchelli","year":"1986","unstructured":"Micchelli, C.A.: Interpolation of scattered data: Distance matrices and conditionally positive definite functions. Constructive Approximation\u00a02, 11\u201322 (1986)","journal-title":"Constructive Approximation"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0893-6080(98)00039-2","volume":"11","author":"V. K\u016frkov\u00e1","year":"1998","unstructured":"K\u016frkov\u00e1, V., Savick\u00fd, P., Hlav\u00e1\u010dkov\u00e1, K.: Representations and rates of approximation of real-valued Boolean functions by neural networks. Neural Networks\u00a011, 651\u2013659 (1998)","journal-title":"Neural Networks"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jat.2006.12.009","volume":"147","author":"P.C. Kainen","year":"2007","unstructured":"Kainen, P.C., K\u016frkov\u00e1, V., Vogt, A.: A Sobolev-type upper bound for rates of approximation by linear combinations of heaviside plane waves. Journal of Approximation Theory\u00a0147, 1\u201310 (2007)","journal-title":"Journal of Approximation Theory"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.jco.2008.08.001","volume":"25","author":"P.C. Kainen","year":"2009","unstructured":"Kainen, P.C., K\u016frkov\u00e1, V., Sanguineti, M.: Complexity of Gaussian radial-basis networks approximating smooth functions. J. of Complexity\u00a025, 63\u201374 (2009)","journal-title":"J. of Complexity"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/TIT.2011.2169531","volume":"58","author":"P.C. Kainen","year":"2012","unstructured":"Kainen, P.C., K\u016frkov\u00e1, V., Sanguineti, M.: Dependence of computational models on input dimension: Tractability of approximation and optimization tasks. IEEE Trans. on Information Theory\u00a058, 1203\u20131214 (2012)","journal-title":"IEEE Trans. on Information Theory"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.neunet.2012.05.002","volume":"33","author":"V. K\u016frkov\u00e1","year":"2012","unstructured":"K\u016frkov\u00e1, V.: Complexity estimates based on integral transforms induced by computational units. Neural Networks\u00a033, 160\u2013167 (2012)","journal-title":"Neural Networks"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1006\/jath.1998.3304","volume":"99","author":"V. Maiorov","year":"1999","unstructured":"Maiorov, V.: On best approximation by ridge functions. J. of Approximation Theory\u00a099, 68\u201394 (1999)","journal-title":"J. of Approximation Theory"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0925-2312(98)00111-8","volume":"25","author":"V. Maiorov","year":"1999","unstructured":"Maiorov, V., Pinkus, A.: Lower bounds for approximation by MLP neural networks. Neurocomputing\u00a025, 81\u201391 (1999)","journal-title":"Neurocomputing"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1017\/S0962492900002919","volume":"8","author":"A. Pinkus","year":"1999","unstructured":"Pinkus, A.: Approximation theory of the MLP model in neural networks. Acta Numerica\u00a08, 143\u2013195 (1999)","journal-title":"Acta Numerica"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-1-4615-2696-4_1","volume-title":"Theoretical Advances in Neural Computation and Learning","author":"V. Roychowdhury","year":"1994","unstructured":"Roychowdhury, V., Siu, K.Y., Orlitsky, A.: Neural models and spectral methods. In: Roychowdhury, V., Siu, K., Orlitsky, A. (eds.) Theoretical Advances in Neural Computation and Learning, pp. 3\u201336. Springer, New York (1994)"},{"key":"4_CR15","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-07173-2_7","volume-title":"Artificial Intelligence and Soft Computing","author":"V. K\u016frkov\u00e1","year":"2014","unstructured":"K\u016frkov\u00e1, V.: Representations of highly-varying functions by one-hidden-layer networks. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2014, Part I. LNCS (LNAI), vol.\u00a08467, pp. 67\u201376. Springer, Heidelberg (2014)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-3-319-11179-7_42","volume-title":"Artificial Neural Networks and Machine Learning \u2013 ICANN 2014","author":"V. K\u016frkov\u00e1","year":"2014","unstructured":"K\u016frkov\u00e1, V., Sanguineti, M.: Complexity of shallow networks representing functions with large variations. In: Wermter, S., Weber, C., Duch, W., Honkela, T., Koprinkova-Hristova, P., Magg, S., Palm, G., Villa, A.E.P. (eds.) ICANN 2014. LNCS, vol.\u00a08681, pp. 331\u2013338. Springer, Heidelberg (2014)"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1109\/PGEC.1965.264137","volume":"14","author":"T. Cover","year":"1965","unstructured":"Cover, T.: Geometrical and statistical properties of systems of linear inequailities with applictions in pattern recognition. IEEE Trans. on Electronic Computers\u00a014, 326\u2013334 (1965)","journal-title":"IEEE Trans. on Electronic Computers"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Schl\u00e4fli, L.: Theorie der vielfachen Kontinuit\u00e4t. Z\u00fcrcher & Furrer, Z\u00fcrich (1901)","DOI":"10.1007\/978-3-0348-5118-3"},{"key":"4_CR19","first-page":"461","volume":"34","author":"J. Sylvester","year":"1867","unstructured":"Sylvester, J.: Thoughts on inverse orthogonal matrices, simultaneous sign successions, and tessellated pavements in two or more colours, with applications to Newton\u2019s rule, ornamental tile-work, and the theory of numbers. Philosophical Magazine\u00a034, 461\u2013475 (1867)","journal-title":"Philosophical Magazine"},{"key":"4_CR20","unstructured":"Erd\u00f6s, P., Spencer, J.H.: Probabilistic Methods in Combinatorics. Academic Press (1974)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19324-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:34:32Z","timestamp":1676943272000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19324-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193236","9783319193243"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19324-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}