{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:50:20Z","timestamp":1744217420147},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"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":7047,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,4]]},"DOI":"10.1016\/s0022-0000(05)80005-4","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"311-323","source":"Crossref","is-referenced-by-count":6,"title":["Nonuniform learnability"],"prefix":"10.1016","volume":"48","author":[{"given":"Gyora M.","family":"Benedek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alon","family":"Itai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80005-4_bib1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Mach. Learning"},{"key":"10.1016\/S0022-0000(05)80005-4_bib2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF00116829","article-title":"Learning from noisy examples","volume":"2","author":"Angluin","year":"1988","journal-title":"Mach. Learning"},{"issue":"No. 3","key":"10.1016\/S0022-0000(05)80005-4_bib3","doi-asserted-by":"crossref","DOI":"10.1145\/356914.356918","article-title":"Inductive inference: Theory and methods","volume":"15","author":"Angluin","year":"1983","journal-title":"Comput. Surveys"},{"key":"10.1016\/S0022-0000(05)80005-4_bib4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80005-4_bib5","article-title":"Measurability Constraints on PAC Learnability","author":"Ben-David","year":"1992"},{"key":"10.1016\/S0022-0000(05)80005-4_bib6","article-title":"Parameterization scheme for classifying models of learnability","volume":"108","author":"Ben-David","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80005-4_bib7","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0304-3975(91)90026-X","article-title":"Learnability by fixed distributions","volume":"88","author":"Benedek","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80005-4_bib8","series-title":"15th International Colloquium on Automata, Languages and Programming, (ICALP), Tampere, Finland, 1988","article-title":"Nonuniform learnability","volume":"Vol. 317","author":"Benedek","year":"1988"},{"issue":"No. 4","key":"10.1016\/S0022-0000(05)80005-4_bib9","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\/S0022-0000(05)80005-4_bib10","first-page":"377","article-title":"Occam's razor","volume":"24","author":"Blumer","year":"1987"},{"key":"10.1016\/S0022-0000(05)80005-4_bib11","series-title":"COLT'88","article-title":"A general lower bound on the number of examples needed for learning","author":"Ehrenfeucht","year":"1988"},{"key":"10.1016\/S0022-0000(05)80005-4_bib12","series-title":"Measure Theory","author":"Halmos","year":"1950"},{"key":"10.1016\/S0022-0000(05)80005-4_bib13","series-title":"COLT'88","article-title":"Equivalence of models for polynomial learnability","author":"Haussler","year":"1988"},{"key":"10.1016\/S0022-0000(05)80005-4_bib14","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0022-0000(05)80005-4_bib15","series-title":"Proceedings, 19th Symp. Theory of Comput.","first-page":"285","article-title":"On the learnability of Boolean formulae","author":"Kearns","year":"1987"},{"key":"10.1016\/S0022-0000(05)80005-4_bib16","series-title":"Proceedings, 29th FOCS","first-page":"120","article-title":"Results on learnability and the Vapnik-Chervonenkis dimension","author":"Lineal","year":"1988"},{"key":"10.1016\/S0022-0000(05)80005-4_bib17","series-title":"Proceedings, 19th Symp. Theory of Comput.","first-page":"296","article-title":"On learning Boolean functions","author":"Natarajan","year":"1987"},{"key":"10.1016\/S0022-0000(05)80005-4_bib18","series-title":"Computational Limitations on Learning from Examples","author":"Pitt","year":"1986"},{"key":"10.1016\/S0022-0000(05)80005-4_bib19","unstructured":"S. Shelah, unpublished manuscript."},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80005-4_bib20","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."},{"issue":"No. 11","key":"10.1016\/S0022-0000(05)80005-4_bib21","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\/S0022-0000(05)80005-4_bib22","first-page":"560","article-title":"Learning disjunctions of conjunctions","volume":"Vol. 1","author":"Valiant","year":"1985"},{"key":"10.1016\/S0022-0000(05)80005-4_bib23","series-title":"Deductive learning","author":"Valiant","year":"1984"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800054?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800054?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:27:42Z","timestamp":1548196062000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["S0022000005800054"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80005-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}