{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T06:32:46Z","timestamp":1716273166183},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0020-0190(03)00311-9","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T09:57:08Z","timestamp":1056967028000},"page":"229-234","source":"Crossref","is-referenced-by-count":8,"title":["An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution"],"prefix":"10.1016","volume":"87","author":[{"given":"Philip M.","family":"Long","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0020-0190(03)00311-9_BIB001","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1006\/jcss.1998.1593","article-title":"Approximating hyper-rectangles: learning and pseudo-random sets","volume":"57","author":"Auer","year":"1998","journal-title":"J. Computer System Sci."},{"issue":"2","key":"10.1016\/S0020-0190(03)00311-9_BIB002","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."},{"issue":"4","key":"10.1016\/S0020-0190(03)00311-9_BIB003","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":"J. ACM"},{"key":"10.1016\/S0020-0190(03)00311-9_BIB004","unstructured":"H.P. Boas, Peeling an onion, Tel Aviv University Math 696 course notes, 1995"},{"key":"10.1016\/S0020-0190(03)00311-9_BIB005","series-title":"Random Graphs","author":"Bollobas","year":"1985"},{"key":"10.1016\/S0020-0190(03)00311-9_BIB006","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/PGEC.1965.264137","article-title":"Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition","volume":"EC-14","author":"Cover","year":"1965","journal-title":"IEEE Trans. Electron. Comput."},{"issue":"2","key":"10.1016\/S0020-0190(03)00311-9_BIB007","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1006\/inco.1994.1097","article-title":"Predicting {0,1}-functions on randomly drawn points","volume":"115","author":"Haussler","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(03)00311-9_BIB008","series-title":"Proceedings of the 1989 Workshop on Computational Learning Theory","first-page":"269","article-title":"From on-line to batch learning","author":"Littlestone","year":"1989"},{"issue":"6","key":"10.1016\/S0020-0190(03)00311-9_BIB009","doi-asserted-by":"crossref","first-page":"1556","DOI":"10.1109\/72.471352","article-title":"On the sample complexity of PAC learning halfspaces against the uniform distribution","volume":"6","author":"Long","year":"1995","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0020-0190(03)00311-9_BIB010","series-title":"Convergence of Stochastic Processes","author":"Pollard","year":"1984"},{"key":"10.1016\/S0020-0190(03)00311-9_BIB011","doi-asserted-by":"crossref","first-page":"26","DOI":"10.2307\/2308012","article-title":"A remark on Stirling's formula","volume":"62","author":"Robbins","year":"1955","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0020-0190(03)00311-9_BIB012","series-title":"Proceedings of the 1999 Conference on Computational Learning Theory","first-page":"296","article-title":"On PAC learning using Winnow, Perceptron, and a Perceptron-like algorithm","author":"Servedio","year":"1999"},{"key":"10.1016\/S0020-0190(03)00311-9_BIB013","series-title":"Calculus","author":"Stewart","year":"1995"},{"issue":"11","key":"10.1016\/S0020-0190(03)00311-9_BIB014","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\/S0020-0190(03)00311-9_BIB015","series-title":"Estimation of Dependencies based on Empirical Data","author":"Vapnik","year":"1982"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003003119?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003003119?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T15:20:57Z","timestamp":1552922457000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003003119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0020019003003119"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00311-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}