{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T16:07:04Z","timestamp":1725638824597},"publisher-location":"Vienna","reference-count":12,"publisher":"Springer Vienna","isbn-type":[{"type":"print","value":"9783211830871"},{"type":"electronic","value":"9783709164921"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-7091-6492-1_109","type":"book-chapter","created":{"date-parts":[[2011,12,4]],"date-time":"2011-12-04T00:33:01Z","timestamp":1322958781000},"page":"495-499","source":"Crossref","is-referenced-by-count":1,"title":["Upper Bounds on the Approximation Rates of Real-valued Boolean Functions by Neural Networks"],"prefix":"10.1007","author":[{"given":"K.","family":"Hlav\u00e1\u010dkov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"K\u016frkov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Savick\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"109_CR1","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1109\/18.256500","volume":"39","author":"AR Barron","year":"1993","unstructured":"A.R. Barron. Universal approximation bounds for superpositions of a sigmoidal function. IEEE Transactions on Information Theory, 39:930\u2013945, 1993.","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"A. Hajnal, W. Maass, P. Pudl\u00e1k, M. Szegedy, and G. Tur\u00e1n. Threshold circuits of bounded depth. In Proceedings of the 28th Annual Symposium on Foundations of Computer Science, pages 99\u2013110. IEEE Computer Society Press, 1987.","key":"109_CR2","DOI":"10.1109\/SFCS.1987.59"},{"unstructured":"K. Hlav\u00e1\u010dkov\u00e1 and V. K\u016frkov\u00e1. Rates of approximation of real-valued Boolean functions by neural networks. In Proceedings of ESANN\u201996, pages 167\u2013172. Bruges 1996, Belgium, 1996.","key":"109_CR3"},{"key":"109_CR4","first-page":"69","volume":"17","author":"Y Ito","year":"1992","unstructured":"Y. Ito. Finite mapping by neural networks and truth functions. Math. Scientist, 17:69\u201377, 1992.","journal-title":"Math. Scientist"},{"key":"109_CR5","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1214\/aos\/1176348546","volume":"20","author":"LK Jones","year":"1992","unstructured":"L.K. Jones. A simple lemma on greedy approximation in hilbert space and convergence rates for projection pursuit regression and neural network training. Annals of Statistics, 20:601\u2013613, 1992.","journal-title":"Annals of Statistics"},{"doi-asserted-by":"crossref","unstructured":"V. K\u016frkov\u00e1. Dimension-independent rates of approximation by neural networks. Birkhauser, 1997. in press.","key":"109_CR6","DOI":"10.1007\/978-1-4612-1996-5_16"},{"doi-asserted-by":"crossref","unstructured":"V. K\u016frkov\u00e1, P. C. Kainen, and V. Kreinovich. Estimates of the number of hidden units and variation with respect to half-spaces. Neural Networks, 1997. in press.","key":"109_CR7","DOI":"10.1016\/S0893-6080(97)00028-2"},{"doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and Y. Mansour. Learning decision trees using the fourier spectrum. In Proceedings of 23rd STOC, pages 455\u2013464, 1991.","key":"109_CR8","DOI":"10.1145\/103418.103466"},{"doi-asserted-by":"crossref","unstructured":"H.N. Mhaskar and C.A. Micchelli. Dimension-independent bounds on the degree of approximation by neural networks. IBM Journal of Research and Development, 38(3), May 1994.","key":"109_CR9","DOI":"10.1147\/rd.383.0277"},{"key":"109_CR10","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0097-3165(76)90024-8","volume":"20","author":"OS Rothaus","year":"1976","unstructured":"O.S. Rothaus. On \u201cbent\u201d functions. J. Combin. Theory, Ser. A, 20:300\u2013305, 1976.","journal-title":"J. Combin. Theory, Ser. A"},{"key":"109_CR11","first-page":"145","volume":"1","author":"TJ Sejnowski","year":"1987","unstructured":"T.J. Sejnowski and C. Rosenberg. Parallel networks that learn to pronounce english text. Complex Systems, 1:145\u2013168, 1987.","journal-title":"Complex Systems"},{"key":"109_CR12","volume-title":"Applications of discrete and continuous Fourier analysis","author":"HJ Weaver","year":"1983","unstructured":"H.J. Weaver. Applications of discrete and continuous Fourier analysis. John Wiley, New York, 1983."}],"container-title":["Artificial Neural Nets and Genetic Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-7091-6492-1_109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T04:43:58Z","timestamp":1606106638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-7091-6492-1_109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783211830871","9783709164921"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-7091-6492-1_109","relation":{},"subject":[],"published":{"date-parts":[[1998]]}}}