{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:06Z","timestamp":1740107826932,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura Cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["GA19-05704S"],"award-info":[{"award-number":["GA19-05704S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004462","name":"Consiglio Nazionale delle Ricerche","doi-asserted-by":"publisher","award":["PDGP2018\/20 DIT.AD016.001"],"award-info":[{"award-number":["PDGP2018\/20 DIT.AD016.001"]}],"id":[{"id":"10.13039\/501100004462","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s00500-021-05938-4","type":"journal-article","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T12:02:57Z","timestamp":1623758577000},"page":"12641-12648","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Correlations of random classifiers on large data sets"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8181-2128","authenticated-orcid":false,"given":"V\u011bra","family":"K\u016frkov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcello","family":"Sanguineti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"5938_CR1","doi-asserted-by":"publisher","first-page":"357","DOI":"10.2748\/tmj\/1178243286","volume":"19","author":"K Azuma","year":"1967","unstructured":"Azuma K (1967) Weighted sums of certain dependent random variables. Tohoku Math J 19:357\u2013367","journal-title":"Tohoku Math J"},{"key":"5938_CR2","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1109\/18.256500","volume":"39","author":"AR Barron","year":"1993","unstructured":"Barron AR (1993) Universal approximation bounds for superpositions of a sigmoidal function. IEEE Trans Inf Theory 39:930\u2013945","journal-title":"IEEE Trans Inf Theory"},{"key":"5938_CR3","volume-title":"Dynamic Programming","author":"R Bellman","year":"1957","unstructured":"Bellman R (1957) Dynamic Programming. Princeton University Press, Princeton"},{"key":"5938_CR4","first-page":"107","volume":"18","author":"Y Bengio","year":"2006","unstructured":"Bengio Y, Delalleau O, Roux NL (2006) The curse of highly variable functions for local kernel machines. Adv Neural Inf Process Syst 18:107\u2013114","journal-title":"Adv Neural Inf Process Syst"},{"key":"5938_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/15427951.2006.10129115","volume":"3","author":"F Chung","year":"2005","unstructured":"Chung F, Lui L (2005) Concentration inequalities and martingale inequalities: a survey. Internet Math 3:79\u2013127","journal-title":"Internet Math"},{"key":"5938_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of measure for the analysis of randomized algorithms","author":"D Dubhashi","year":"2009","unstructured":"Dubhashi D, Panconesi A (2009) Concentration of measure for the analysis of randomized algorithms. Cambridge University Press, Cambridge"},{"doi-asserted-by":"crossref","unstructured":"Gallicchio C, Scardapane S (2020) Deep randomized neural networks. In: Oneto L, Navarin N, Sperduti A, Anguita D (eds) Recent trends in learning from data. Studies in computational intelligence, vol 896. Springer, Switzeland, pp 44\u201368","key":"5938_CR7","DOI":"10.1007\/978-3-030-43883-8_3"},{"key":"5938_CR8","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.neunet.2011.05.014","volume":"24","author":"G Gnecco","year":"2011","unstructured":"Gnecco G, K\u016frkov\u00e1 V, Sanguineti M (2011) Can dictionary-based computational models outperform the best linear ones? Neural Netw 24:881\u2013887","journal-title":"Neural Netw"},{"key":"5938_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.neunet.2010.10.002","volume":"24","author":"G Gnecco","year":"2011","unstructured":"Gnecco G, K\u016frkov\u00e1 V, Sanguineti M (2011) Some comparisons of complexity in dictionary-based and linear computational models. Neural Netw 24:171\u2013182","journal-title":"Neural Netw"},{"issue":"4","key":"5938_CR10","first-page":"153","volume":"2","author":"G Gnecco","year":"2008","unstructured":"Gnecco G, Sanguineti M (2008) Approximation error bounds via Rademacher\u2019s complexity. Appl Math Sci 2(4):153\u2013176","journal-title":"Appl Math Sci"},{"key":"5938_CR11","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/TIT.2010.2090198","volume":"57","author":"G Gnecco","year":"2011","unstructured":"Gnecco G, Sanguineti M (2011) On a variational norm tailored to variable-basis approximation schemes. IEEE Trans Inf Theory 57:549\u2013558","journal-title":"IEEE Trans Inf Theory"},{"key":"5938_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ins.2015.09.021","volume":"364\u2013365","author":"A Gorban","year":"2016","unstructured":"Gorban A, Tyukin I, Prokhorov D, Sofeikov K (2016) Approximation with random bases: Pro et contra. Inf Sci 364\u2013365:129\u2013145","journal-title":"Inf Sci"},{"key":"5938_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.plrev.2018.09.005","volume":"29","author":"AN Gorban","year":"2019","unstructured":"Gorban AN, Makarov VA, Tyukin IY (2019) The unreasonable effectiveness of small neural ensembles in high-dimensional brain. Phys Life Rev 29:55\u201388","journal-title":"Phys Life Rev"},{"key":"5938_CR14","first-page":"69","volume":"17","author":"Y Ito","year":"1992","unstructured":"Ito Y (1992) Finite mapping by neural networks and truth functions. Math Sci 17:69\u201377","journal-title":"Math Sci"},{"key":"5938_CR15","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1137\/S1052623402401233","volume":"14","author":"P Kainen","year":"2003","unstructured":"Kainen P, K\u016frkov\u00e1 V, Sanguineti M (2003) Minimization of error functionals over variable-basis functions. SIAM J Optim 14:732\u2013742","journal-title":"SIAM J Optim"},{"issue":"3","key":"5938_CR16","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0893-9659(93)90023-G","volume":"6","author":"PC Kainen","year":"1993","unstructured":"Kainen PC, K\u016frkov\u00e1 V (1993) Quasiorthogonal dimension of Euclidean spaces. Appl Math Lett 6(3):7\u201310","journal-title":"Appl Math Lett"},{"doi-asserted-by":"crossref","unstructured":"Kainen PC, K\u016frkov\u00e1 V (2020) Quasiorthogonal dimension. In: Beyond traditional probabilistic data processing techniques: interval, fuzzy, etc. Methods and their applications. Studies in computational intelligence, vol 835, pp 615\u2013629. Springer","key":"5938_CR17","DOI":"10.1007\/978-3-030-31041-7_35"},{"key":"5938_CR18","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/TIT.2011.2169531","volume":"58","author":"PC Kainen","year":"2012","unstructured":"Kainen PC, K\u016frkov\u00e1 V, Sanguineti M (2012) Dependence of computational models on input dimension: tractability of approximation and optimization tasks. IEEE Trans Inf Theory 58:1203\u20131214","journal-title":"IEEE Trans Inf Theory"},{"key":"5938_CR19","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 (2012) Complexity estimates based on integral transforms induced by computational units. Neural Netw 33:160\u2013167","journal-title":"Neural Netw"},{"key":"5938_CR20","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.neucom.2015.07.014","volume":"171","author":"V K\u016frkov\u00e1","year":"2016","unstructured":"K\u016frkov\u00e1 V, Sanguineti M (2016) Model complexities of shallow networks representing highly varying functions. Neurocomputing 171:598\u2013604","journal-title":"Neurocomputing"},{"key":"5938_CR21","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.neunet.2017.04.003","volume":"91","author":"V K\u016frkov\u00e1","year":"2017","unstructured":"K\u016frkov\u00e1 V, Sanguineti M (2017) Probabilistic lower bounds for approximation by shallow perceptron networks. Neural Netw 91:34\u201341","journal-title":"Neural Netw"},{"issue":"9","key":"5938_CR22","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1109\/TNNLS.2018.2888517","volume":"30","author":"V K\u016frkov\u00e1","year":"2019","unstructured":"K\u016frkov\u00e1 V, Sanguineti M (2019) Classification by sparse neural networks. IEEE Trans Neural Netw Learning Syst 30(9):2746\u20132754","journal-title":"IEEE Trans Neural Netw Learning Syst"},{"key":"5938_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on discrete geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek J (2002) Lectures on discrete geometry. Springer, New York"},{"key":"5938_CR24","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.jco.2003.11.004","volume":"20","author":"HN Mhaskar","year":"2004","unstructured":"Mhaskar HN (2004) On the tractability of multivariate integration and approximation by neural networks. J Complex 20:561\u2013590","journal-title":"J Complex"},{"key":"5938_CR25","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"A Tropp","year":"2004","unstructured":"Tropp A (2004) Greed is good: algorithmic results for sparse approximation. IEEE Trans Inf Theory 50:2231\u20132242","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05938-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-05938-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05938-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T12:33:44Z","timestamp":1631536424000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-05938-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":25,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["5938"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-05938-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"3 June 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2021","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Communicated by removal","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Author V\u011bra K\u016frkov\u00e1 declares that she has no conflict of interest. Author Marcello Sanguineti declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}]}}