{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T05:45:52Z","timestamp":1713419152362},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":8233,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0890-5401(91)90058-a","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"33-49","source":"Crossref","is-referenced-by-count":28,"title":["Results on learnability and the Vapnik-Chervonenkis dimension"],"prefix":"10.1016","volume":"90","author":[{"given":"Nathan","family":"Linial","sequence":"first","affiliation":[]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[]},{"given":"Ronald L.","family":"Rivest","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90058-A_BIB1","article-title":"Types of Queries for Concept Learning","author":"Angluin","year":"1986"},{"key":"10.1016\/0890-5401(91)90058-A_BIB2","author":"Benedek","year":"1988","journal-title":"Ph. D. dissertation"},{"key":"10.1016\/0890-5401(91)90058-A_BIB3","series-title":"ICALP, July 1988","first-page":"82","article-title":"Nonuniform learnability","author":"Benedek","year":"1988"},{"key":"10.1016\/0890-5401(91)90058-A_BIB4","series-title":"Proceedings, Eighteenth Annual ACM Symposium on Theory of Computing","first-page":"273","article-title":"Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension","author":"Blumer","year":"1986"},{"key":"10.1016\/0890-5401(91)90058-A_BIB5_1","author":"Blumer","year":"1987"},{"key":"10.1016\/0890-5401(91)90058-A_BIB5_2","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"Blumer","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90058-A_BIB6_1","author":"Ehrenfeucht","year":"1987"},{"issue":"No. 3","key":"10.1016\/0890-5401(91)90058-A_BIB6_2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","volume":"82","author":"Ehrenfeucht","year":"1989","journal-title":"Inform. and Comp."},{"key":"10.1016\/0890-5401(91)90058-A_BIB7","series-title":"First Workshop on Computational Learning Theory","first-page":"42","article-title":"Equivalence of models for polynomial learnability","author":"Haussler","year":"1988"},{"key":"10.1016\/0890-5401(91)90058-A_BIB18","unstructured":"Inform. and Comput., to appear."},{"key":"10.1016\/0890-5401(91)90058-A_BIB8","series-title":"Proceedings, Nineteenth Annual ACM Symposium on Theory of Computing","first-page":"285","article-title":"On the learnability of boolean formulae","author":"Kearns","year":"1987"},{"key":"10.1016\/0890-5401(91)90058-A_BIB9","series-title":"Proceedings, Fourth International Workshop on Machine Learning","first-page":"337","article-title":"Recent results on boolean concept learning","author":"Kearns","year":"1987"},{"issue":"Nos. 2\u20133","key":"10.1016\/0890-5401(91)90058-A_BIB10","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0304-3975(88)90131-4","article-title":"On finding a minimum dominating set in a tournament","volume":"61","author":"Megiddo","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90058-A_BIB11","author":"Pollard","year":"1984"},{"issue":"No. 3","key":"10.1016\/0890-5401(91)90058-A_BIB12","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","article-title":"Inferring decision trees using the minimum description length principle","volume":"80","author":"Quinlan","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0890-5401(91)90058-A_BIB13","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","article-title":"Modeling by shortest data description","volume":"14","author":"Rissanen","year":"1978","journal-title":"Automatica"},{"issue":"No. 3","key":"10.1016\/0890-5401(91)90058-A_BIB14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF00058680","article-title":"Learning decision lists","volume":"2","author":"Rivest","year":"1987","journal-title":"Mach. Learning"},{"issue":"No. 11","key":"10.1016\/0890-5401(91)90058-A_BIB15","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\/0890-5401(91)90058-A_BIB16","author":"Vapnik","year":"1982"},{"issue":"No. 2","key":"10.1016\/0890-5401(91)90058-A_BIB17","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."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190058A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190058A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T13:25:34Z","timestamp":1549027534000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190058A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["089054019190058A"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90058-a","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}