{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:49:54Z","timestamp":1744217394771},"reference-count":15,"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)00000-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"3-25","source":"Crossref","is-referenced-by-count":25,"title":["Combinatorial variability of vapnik-chervonenkis classes with applications to sample compression schemes"],"prefix":"10.1016","volume":"86","author":[{"given":"Shai","family":"Ben-David","sequence":"first","affiliation":[]},{"given":"Ami","family":"Litman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00000-6_BIB1","series-title":"Proc. Symp. on the Theory of Computing","first-page":"277","article-title":"Geometrical relation of set systems and probabilistic communication complexity","author":"Alon","year":"1985"},{"key":"10.1016\/S0166-218X(98)00000-6_BIB2","series-title":"Proc. 29th annual ACM symp. on theory of computing, (STOC'97)","first-page":"324","article-title":"A composition theorem for learning algorithms with applications to geometric concept classes","author":"Ben-David","year":"1996"},{"key":"10.1016\/S0166-218X(98)00000-6_BIB3","series-title":"Technion CS department manuscript","article-title":"On the embeddability of finite VC classes in classes of halfspaces","author":"Ben-David","year":"1997"},{"issue":"4","key":"10.1016\/S0166-218X(98)00000-6_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. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(98)00000-6_BIB5","series-title":"Model Theory","author":"Chang","year":"1990"},{"key":"10.1016\/S0166-218X(98)00000-6_BIB6","article-title":"A Course on Empirical Precesses","volume":"vol. 1997","author":"Dudley","year":"1984"},{"key":"10.1016\/S0166-218X(98)00000-6_BIB7","unstructured":"S. Floyd, On space bounded learning and the Vapnik-Chervonenkis dimension, Ph.D. thesis, International Computer Science Institute, Technical Report, TR-89-061."},{"key":"10.1016\/S0166-218X(98)00000-6_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00993593","article-title":"Sample compression, learnability, and the Vapnik-Chervonenkis dimension","volume":"21","author":"Floyd","year":"1995","journal-title":"Mach. Learning"},{"key":"10.1016\/S0166-218X(98)00000-6_BIB9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00993408","article-title":"Bounding the Vapnik-Chervonenkis dimension of concept classes parametrized by real numbers","volume":"18","author":"Goldberg","year":"1995","journal-title":"Mach. Learning"},{"issue":"2","key":"10.1016\/S0166-218X(98)00000-6_BIB10","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1112\/jlms\/s2-45.2.377","article-title":"Vapnik-Cervonenkis classes of definable sets","volume":"45","author":"Laskowski","year":"1992","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0166-218X(98)00000-6_BIB11","article-title":"Mistake bounds and logarithmic linear-threshold learning algorithms","author":"Littlestone","year":"1989"},{"key":"10.1016\/S0166-218X(98)00000-6_BIB12","series-title":"Relating data compression and learnability","author":"Littlestone","year":"1986"},{"key":"10.1016\/S0166-218X(98)00000-6_BIB13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF00114804","article-title":"On learning sets and function","volume":"4","author":"Natarajan","year":"1989","journal-title":"Mach. Learning"},{"key":"10.1016\/S0166-218X(98)00000-6_BIB14","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/0022-0000(90)90028-J","article-title":"Prediction preserving reducibility","volume":"41","author":"Pitt","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(98)00000-6_BIB15","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"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000006?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000006?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T19:27:16Z","timestamp":1556652436000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0166218X98000006"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00000-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}