{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T09:51:53Z","timestamp":1672480313506},"reference-count":32,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5464,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0166-218x(98)00013-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"37-61","source":"Crossref","is-referenced-by-count":3,"title":["Scale-sensitive dimensions and skeleton estimates for classification"],"prefix":"10.1016","volume":"86","author":[{"given":"M\u00e1rta","family":"Horv\u00e1th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Lugosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00013-4_BIB1","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1993.366858","article-title":"Scale-sensitive dimensions, uniform convergence, and learnability","author":"Alon","year":"1993"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB31","unstructured":"An extended abstract appeared in the Proc. 1993 IEEE Symposium on the Foundations of Computer Science, IEEE Press, New York."},{"key":"10.1016\/S0166-218X(98)00013-4_BIB2","article-title":"Function learning from interpolation","author":"Anthony","year":"1994"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0166-218X(93)90126-9","article-title":"A result of Vapnik with applications","volume":"47","author":"Anthony","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00013-4_BIB4","article-title":"The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network","author":"Bartlett","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB5","doi-asserted-by":"crossref","DOI":"10.1109\/18.623181","article-title":"Covering numbers for real-valued function classes","author":"Bartlett","year":"1996"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB6","series-title":"Proc. 8th Annual Conf. Computational Learning Theory","first-page":"392","article-title":"More theorems about scale-sensitive dimensions and learning","author":"Bartlett","year":"1995"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB7","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1006\/jcss.1996.0033","article-title":"Fat-shattering and the learnability of real-valued functions","volume":"52","author":"Bartlett","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(98)00013-4_BIB8","series-title":"Computational Learning Theory: Proc. 1988 Workshop","first-page":"80","article-title":"Learnability by fixed distributions","author":"Benedek","year":"1988"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB9","series-title":"The Theory of Probabilities","author":"Bernstein","year":"1946"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB10","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik-Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB11","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1109\/9.489275","article-title":"Learning by canonical smooth estimation, Part I: Simultaneous estimation","volume":"41","author":"Buescher","year":"1996","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB12","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1109\/9.489276","article-title":"Learning by canonical smooth estimation, Part II: learning and choice of model complexity","volume":"41","author":"Buescher","year":"1996","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB13","series-title":"A Probabilistic Theory of Pattern Recognition","author":"Devroye","year":"1996"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB14","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/0031-3203(94)00141-8","article-title":"Lower bounds in pattern recognition and learning","volume":"28","author":"Devroye","year":"1995","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB15","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1109\/18.335898","article-title":"A metric entropy bound is not sufficient for learnability","volume":"40","author":"Dudley","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB16","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0890-5401(92)90010-D","article-title":"Decision theoretic generalizations of the PAC model for neural net and other learning applications","volume":"100","author":"Haussler","year":"1992","journal-title":"Inform. Comput."},{"key":"10.1016\/S0166-218X(98)00013-4_BIB17","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/S0022-0000(05)80062-5","article-title":"Efficient distribution-free learning of probabilistic concepts","volume":"48","author":"Kearns","year":"1994","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/S0166-218X(98)00013-4_BIB18","article-title":"Problems of computational and information complexity in machine vision and learning","author":"Kulkarni","year":"1991"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB19","doi-asserted-by":"crossref","first-page":"2118","DOI":"10.1109\/18.556601","article-title":"Efficient agnostic learning of neural networks with bounded fan-in","volume":"42","author":"Lee","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB20","series-title":"Adaptive model selection using empirical complexities","author":"Lugosi","year":"1996"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB21","series-title":"Proc. 9th Annual ACM Conf. Computational Learning Theory","first-page":"51","article-title":"A data-dependent skeleton estimate for learning","author":"Lugosi","year":"1996"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB22","article-title":"On uniform laws of averages","author":"Nobel","year":"1992"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB23","series-title":"Convergence of Stochastic Processes","author":"Pollard","year":"1984"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB24","article-title":"Rates of uniform almost sure convergence for empirical processes indexed by unbounded classes of functions","author":"Pollard","year":"1986","journal-title":"manuscript"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB25","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","article-title":"On the density of families of sets","volume":"13","author":"Sauer","year":"1972","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB26","series-title":"Proc. 9th Annual Conf. Computational Learning Theory","first-page":"68","article-title":"A framework for structural risk minimization","author":"Shawe-Taylor","year":"1996"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB27","series-title":"Estimation of Dependencies Based on Empirical Data","author":"Vapnik","year":"1982"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB28","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory Probab. Appl."},{"key":"10.1016\/S0166-218X(98)00013-4_BIB29_1","series-title":"Theory of Pattern Recognition","author":"Vapnik","year":"1974"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB29_2","series-title":"German translation: Theorie der Zeichenerkennung","author":"Vapnik","year":"1979"},{"key":"10.1016\/S0166-218X(98)00013-4_BIB30","first-page":"821","article-title":"Necessary and sufficient conditions for the uniform convergence of means to their expectations","volume":"26","author":"Vapnik","year":"1981","journal-title":"Theory Probab. Appl."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000134?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000134?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:51:40Z","timestamp":1556117500000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0166218X98000134"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00013-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}