{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T13:56:11Z","timestamp":1712843771473},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"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":5829,"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":[[1997,8]]},"DOI":"10.1006\/jcss.1997.1507","type":"journal-article","created":{"date-parts":[[2002,9,18]],"date-time":"2002-09-18T14:19:44Z","timestamp":1032358784000},"page":"171-182","source":"Crossref","is-referenced-by-count":26,"title":["Learning Distributions by Their Density Levels: A Paradigm for Learning without a Teacher"],"prefix":"10.1006","volume":"55","author":[{"given":"Shai","family":"Ben-David","sequence":"first","affiliation":[]},{"given":"Michael","family":"Lindenbaum","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jcss.1997.1507_SS971507RF1","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":"Machine Learning"},{"key":"10.1006\/jcss.1997.1507_SS971507RF2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0304-3975(91)90026-X","article-title":"Learnability with respect to fixed distributions","volume":"86","author":"Benedek","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1006\/jcss.1997.1507_SS971507RF3","doi-asserted-by":"crossref","unstructured":"S. Ben-David, M. Lindebaum, Localization vs identification of semi-algebraic sets, Proc. 6th COLT, 1993, 327, 336","DOI":"10.1145\/168304.168364"},{"key":"10.1006\/jcss.1997.1507_SS971507RF4","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik\u2013Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"Assoc. Comput. Machine"},{"key":"10.1006\/jcss.1997.1507_SS971507RF5","unstructured":"R. Canetti, G. Even, O. Goldreich, 1993, Lower bounds for sampling algorithms for estimating the average, Technion\u2013Israel Institute of Technology"},{"key":"10.1006\/jcss.1997.1507_SS971507RF6","unstructured":"E. Dichterman"},{"key":"10.1006\/jcss.1997.1507_SS971507RF7","series-title":"Pattern Classification and Scene Analysis","author":"Duda","year":"1973"},{"key":"10.1006\/jcss.1997.1507_SS971507RF8","series-title":"A Course on Empirical Processes","volume":"1097","author":"Dudley","year":"1984"},{"key":"10.1006\/jcss.1997.1507_SS971507RF9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","article-title":"A general lower bound on the number of examples needed for learning","volume":"82","author":"Ehrenfeucht","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1006\/jcss.1997.1507_SS971507RF10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00993408","article-title":"Bounding the Vapnik\u2013Chervonenkis dimension of concept classes parameterized by real numbers","volume":"18","author":"Goldberg","year":"1995","journal-title":"Machine Learning"},{"key":"10.1006\/jcss.1997.1507_SS971507RF11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0734-189X(88)80033-1","article-title":"A survey of Hough transform","volume":"44","author":"Illingworth","year":"1988","journal-title":"Comput. Vision, Graphics, and Image Process."},{"key":"10.1006\/jcss.1997.1507_SS971507RF12","doi-asserted-by":"crossref","unstructured":"M. Karpinski, A. MacIntyre, Polynomial bounds for VC-dimension of sigmoidal neural networks, Proceedings of 27th STOC, 1995, 200, 208","DOI":"10.1145\/225058.225118"},{"key":"10.1006\/jcss.1997.1507_SS971507RF13","article-title":"Fewnomials","volume":"88","author":"Khovanskii","year":"1981","journal-title":"Transl. Math. Mono- graphs"},{"key":"10.1006\/jcss.1997.1507_SS971507RF14","doi-asserted-by":"crossref","unstructured":"M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Shapire, L. Sellie, On the learnability of discrete distributions, Proceedings of 26th ACM STOC, 1994, 273, 282","DOI":"10.1145\/195058.195155"},{"key":"10.1006\/jcss.1997.1507_SS971507RF15","doi-asserted-by":"crossref","unstructured":"M. Kearns, R. E. Shapire, Efficient distribution-free learning of probabilistic concepts, Proc. of 31st FOCS, 1994, 382, 392","DOI":"10.1016\/S0022-0000(05)80062-5"},{"key":"10.1006\/jcss.1997.1507_SS971507RF16","doi-asserted-by":"crossref","unstructured":"M. W. Kim, Learning by smoothing: A morphological approach, Proc. of 4th COLT, 1991, 43, 57","DOI":"10.1016\/B978-1-55860-213-7.50009-2"},{"key":"10.1006\/jcss.1997.1507_SS971507RF17","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1137\/0220021","article-title":"Probably approximate learning of sets and functions","volume":"20","author":"Natarajan","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jcss.1997.1507_SS971507RF18","series-title":"Probability, Random Variables, and Stochastic Processes","author":"Papoulis","year":"1984"},{"key":"10.1006\/jcss.1997.1507_SS971507RF19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1006\/jcss.1996.0019","article-title":"General bounds on the number of examples needed for learning probabilistic concepts","volume":"52","author":"Simon","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1006\/jcss.1997.1507_SS971507RF20","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. and Its Appl."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000097915075?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000097915075?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T07:54:08Z","timestamp":1557388448000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000097915075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0022000097915075"],"URL":"https:\/\/doi.org\/10.1006\/jcss.1997.1507","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}