{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:54Z","timestamp":1759638174604},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":7168,"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":[[1993,12]]},"DOI":"10.1016\/0166-218x(93)90126-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"207-217","source":"Crossref","is-referenced-by-count":43,"title":["A result of Vapnik with applications"],"prefix":"10.1016","volume":"47","author":[{"given":"Martin","family":"Anthony","sequence":"first","affiliation":[]},{"given":"John","family":"Shawe-Taylor","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90126-9_BIB1","series-title":"COLT '90, Proceedings of the Third Annual Workshop on Computational Learning Theory Rochester, NY, 1990","first-page":"246","article-title":"The learnability of formal concepts","author":"Anthony","year":"1990"},{"key":"10.1016\/0166-218X(93)90126-9_BIB2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1162\/neco.1989.1.1.151","article-title":"What size net gives valid generalization","volume":"1","author":"Baum","year":"1989","journal-title":"Neural Comput."},{"key":"10.1016\/0166-218X(93)90126-9_BIB3","doi-asserted-by":"crossref","unstructured":"N. Biggs, Combinatorics and connectionism, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(92)00048-V"},{"key":"10.1016\/0166-218X(93)90126-9_BIB4","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\/0166-218X(93)90126-9_BIB5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0004-3702(88)90002-1","article-title":"Quantifying inductive bias: AI learning algorithms and Valiant's learning framework","volume":"36","author":"Haussler","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0166-218X(93)90126-9_BIB6","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. and Comput."},{"key":"10.1016\/0166-218X(93)90126-9_BIB7","series-title":"Tech. Rept. UCSC-CRL-89-30","article-title":"Generalizing the PAC model for neural net and other learning applications","author":"Haussler","year":"1989"},{"key":"10.1016\/0166-218X(93)90126-9_BIB8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF00114804","article-title":"On learning sets and functions","volume":"4","author":"Natarajan","year":"1989","journal-title":"Mach. Learning"},{"key":"10.1016\/0166-218X(93)90126-9_BIB9","series-title":"Convergence of Stochastic Processes","author":"Pollard","year":"1984"},{"key":"10.1016\/0166-218X(93)90126-9_BIB10","article-title":"Parallel Distributed Processing","year":"1986"},{"key":"10.1016\/0166-218X(93)90126-9_BIB11","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. Combin. Theory Ser A"},{"key":"10.1016\/0166-218X(93)90126-9_BIB12","series-title":"Tech. Rept. CSD-TR-618","article-title":"Bounding sample size with the Vapnik-Chervonenkis dimension","author":"Shawe-Taylor","year":"1989"},{"key":"10.1016\/0166-218X(93)90126-9_BIB13","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(93)90126-9_BIB14","series-title":"Estimation of Dependences Based on Empirical Data","author":"Vapnik","year":"1982"},{"key":"10.1016\/0166-218X(93)90126-9_BIB15","doi-asserted-by":"crossref","first-page":"265","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":"Theoret. Prob. Appl."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93901269?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93901269?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:26:32Z","timestamp":1555136792000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X93901269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["0166218X93901269"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90126-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}