{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T12:57:18Z","timestamp":1648558638526},"reference-count":18,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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":[[2000,3]]},"DOI":"10.1016\/s0020-0190(00)00024-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:52:29Z","timestamp":1027612349000},"page":"213-220","source":"Crossref","is-referenced-by-count":0,"title":["Learning unions of high-dimensional boxes over the reals"],"prefix":"10.1016","volume":"73","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0020-0190(00)00024-7_ID006","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"Vol. 2","author":"Angluin","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/S0020-0190(00)00024-7_ID007","series-title":"Proc. 29th Symp. on Theory of Computing","first-page":"314","article-title":"Approximating hyper-rectangles: Learning and pseudorandom sets","author":"Auer","year":"1997"},{"key":"10.1016\/S0020-0190(00)00024-7_ID008","series-title":"Proc. 37th Symp. on Foundations of Computer Science","first-page":"349","article-title":"On the applications of multiplicity automata in learning","author":"Beimel","year":"1996"},{"key":"10.1016\/S0020-0190(00)00024-7_ID009","series-title":"3rd European Conf. on Computational Learning Theory (EuroCOLT '97)","first-page":"3","article-title":"Learning boxes in high dimension","volume":"Vol. 1208","author":"Beimel","year":"1997"},{"key":"10.1016\/S0020-0190(00)00024-7_ID010","series-title":"Proc. 29th Symp. on Theory of Computing","first-page":"324","article-title":"A composition theorem for learning algorithms with applications to geometric concept classes","author":"Ben-David","year":"1997"},{"key":"10.1016\/S0020-0190(00)00024-7_ID011","series-title":"Complexity and Real Computation","author":"Blum","year":"1998"},{"key":"10.1016\/S0020-0190(00)00024-7_ID012","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik\u2013Chervonenkis dimension","volume":"Vol. 36","author":"Blumer","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(00)00024-7_ID013","series-title":"Proc. 35th Annual IEEE Symp. on Foundations of Computer Science","first-page":"54","article-title":"On learning discretized geometric concepts","author":"Bshouty","year":"1994"},{"key":"10.1016\/S0020-0190(00)00024-7_ID014","series-title":"Proc. 28th Annual Symp. on Theory of Computing","first-page":"151","article-title":"Noise-tolerant distribution-free learning of general geometric concepts","author":"Bshouty","year":"1996"},{"key":"10.1016\/S0020-0190(00)00024-7_ID015","series-title":"Algebraic Complexity Theory","author":"B\u00fcrgisser","year":"1997"},{"key":"10.1016\/S0020-0190(00)00024-7_ID016","series-title":"Minimizing disagreements for geometric regions, using dynamic programming, with applications in machine learning","author":"Fischer","year":"1996"},{"issue":"3","key":"10.1016\/S0020-0190(00)00024-7_ID017","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1006\/jcss.1996.0035","article-title":"Learning from a consistently ignorant teacher","volume":"Vol. 52","author":"Frazier","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(00)00024-7_ID018","series-title":"Proc. 25th Annual ACM Symp. on Theory of Computing","first-page":"392","article-title":"Efficient noise-tolerant learning from statistical queries","author":"Kearns","year":"1993"},{"key":"10.1016\/S0020-0190(00)00024-7_ID019","series-title":"An Introduction to Computational Learning Theory","author":"Kearns","year":"1994"},{"key":"10.1016\/S0020-0190(00)00024-7_ID020","series-title":"Proc. 9th Annual ACM Conf. on Comput. Learning Theory","first-page":"244","article-title":"PAC learning intersections of halfspaces with membership queries","author":"Kwek","year":"1996"},{"issue":"2","key":"10.1016\/S0020-0190(00)00024-7_ID021","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1006\/inco.1994.1071","article-title":"Composite geometric concepts and polynomial predictability","volume":"Vol. 113","author":"Long","year":"1994","journal-title":"Inform. and Comput."},{"issue":"1","key":"10.1016\/S0020-0190(00)00024-7_ID022","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/inco.1997.2686","article-title":"Efficient learning with virtual threshold gates","volume":"Vol. 141","author":"Maass","year":"1998","journal-title":"Inform. and Comput."},{"issue":"11","key":"10.1016\/S0020-0190(00)00024-7_ID023","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"Vol. 27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000247?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000247?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T17:54:38Z","timestamp":1556301278000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":18,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0020019000000247"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00024-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}