{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T04:56:17Z","timestamp":1648616177037},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":3760,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0304-3975(01)00265-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"37-63","source":"Crossref","is-referenced-by-count":0,"title":["PAC learning of probability distributions over a discrete domain"],"prefix":"10.1016","volume":"299","author":[{"given":"Letizia","family":"Magnoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Mirolli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Montagna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulia","family":"Simi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(01)00265-1_BIB1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","article-title":"Inductive inference of formal languages from positive data","volume":"45","author":"Angluin","year":"1980","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(01)00265-1_BIB2","doi-asserted-by":"crossref","unstructured":"D. Angluin, Identifying languages from stochastic examples, Technical Report 614, University of Yale, 1988.","DOI":"10.1007\/BF00116829"},{"key":"10.1016\/S0304-3975(01)00265-1_BIB3","doi-asserted-by":"crossref","unstructured":"S. Ben David, M. Lindenbaum, Learning distributions by their density levels, Lecture Notes in Computer Science, 1996, pp. 53\u201368.","DOI":"10.1007\/3-540-59119-2_168"},{"key":"10.1016\/S0304-3975(01)00265-1_BIB4","series-title":"Probability and Measure","author":"Billingsey","year":"1986"},{"key":"10.1016\/S0304-3975(01)00265-1_BIB5","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(01)00265-1_BIB6","doi-asserted-by":"crossref","unstructured":"M.J. Kearnes, Y. Mansour, D. Ron, R.E. Schapire, L. Sellie, On the learnability of discrete distributions, Proc. 26th ACM STOC 94, 1994, pp. 273\u2013282.","DOI":"10.1145\/195058.195155"},{"key":"10.1016\/S0304-3975(01)00265-1_BIB7","doi-asserted-by":"crossref","unstructured":"M.J. Kearnes, R.E. Schapire, Efficient distribution-free learning of probabilistic concepts, J. Comput. System Sci. 48, 464\u2013497.","DOI":"10.1016\/S0022-0000(05)80062-5"},{"key":"10.1016\/S0304-3975(01)00265-1_BIB8","series-title":"An Introduction to Computational Learning Theory","author":"Kearnes","year":"1994"},{"key":"10.1016\/S0304-3975(01)00265-1_BIB9","doi-asserted-by":"crossref","unstructured":"F. Montagna, Investigations in measure-one identification of classes of languages, Inform. Comput. 143, 74\u2013107.","DOI":"10.1006\/inco.1998.2714"},{"key":"10.1016\/S0304-3975(01)00265-1_BIB10","doi-asserted-by":"crossref","unstructured":"B.K. Natarajan, Probably approximate learning over classes of distributions, SIAM J. Comput. 21, 438\u2013449.","DOI":"10.1137\/0221029"},{"key":"10.1016\/S0304-3975(01)00265-1_BIB11","series-title":"Classical Recursion Theory","author":"Odifreddi","year":"1989"},{"key":"10.1016\/S0304-3975(01)00265-1_BIB12","unstructured":"P. Odifreddi, Classical Recursion Theory, Vol II, book in preparation."},{"key":"10.1016\/S0304-3975(01)00265-1_BIB13","series-title":"Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"Osherson","year":"1986"},{"issue":"2","key":"10.1016\/S0304-3975(01)00265-1_BIB14","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/62044.62053","article-title":"Probabilistic inductive inference","volume":"36","author":"Pitt","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00265-1_BIB15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0890-5401(88)90046-6","article-title":"Probability and plurality for aggregations of learning machines","volume":"77","author":"Pitt","year":"1988","journal-title":"Inform. Comput."},{"issue":"11","key":"10.1016\/S0304-3975(01)00265-1_BIB16","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002651?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002651?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T10:43:19Z","timestamp":1584528199000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0304397501002651"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00265-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}