{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:37:44Z","timestamp":1725471464170},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540466499"},{"type":"electronic","value":"9783540466505"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11894841_7","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T11:29:53Z","timestamp":1159961393000},"page":"32-47","source":"Crossref","is-referenced-by-count":2,"title":["Learning Unions of \u03c9(1)-Dimensional Rectangles"],"prefix":"10.1007","author":[{"given":"Alp","family":"At\u0131c\u0131","sequence":"first","affiliation":[]},{"given":"Rocco A.","family":"Servedio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldwasser, S., Safra, S.: Proving Hard Core Predicates Using List Decoding. In: Proc. 44th IEEE Found. Comp. Sci., pp. 146\u2013156 (2003)","DOI":"10.1109\/SFCS.2003.1238189"},{"issue":"6","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1137\/S0097539794274398","volume":"27","author":"H. Aizenstein","year":"1998","unstructured":"Aizenstein, H., Blum, A., Khardon, R., Kushilevitz, E., Pitt, L., Roth, D.: On Learning Read-k Satisfy-j DNF. SIAM Journal on Computing\u00a027(6), 1515\u20131530 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR3","unstructured":"At\u0131c\u0131, A., Servedio, R.: Learning Unions of \u03c9(1)-Dimensional Rectangles, available at: http:\/\/arxiv.org\/abs\/cs.LG\/0510038"},{"issue":"1\/2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/PL00013835","volume":"22","author":"A. Beimel","year":"1998","unstructured":"Beimel, A., Kushilevitz, E.: Learning Boxes in High Dimension. Algorithmica\u00a022(1\/2), 76\u201390 (1998)","journal-title":"Algorithmica"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/0403015","volume":"3","author":"J. Bruck","year":"1990","unstructured":"Bruck, J.: Harmonic Analysis of Polynomial Threshold Functions. SIAM Journal on Discrete Mathematics\u00a03(2), 168\u2013177 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0168-0072(95)00019-4","volume":"77","author":"Z. Chen","year":"1996","unstructured":"Chen, Z., Homer, S.: The Bounded Injury Priority Method and The Learnability of Unions of Rectangles. Annals of Pure and Applied Logic\u00a077(2), 143\u2013168 (1996)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"2\/3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1022671717849","volume":"17","author":"Z. Chen","year":"1994","unstructured":"Chen, Z., Maass, W.: On-line Learning of Rectangles and Unions of Rectangles. Machine Learning\u00a017(2\/3), 23\u201350 (1994)","journal-title":"Machine Learning"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Freund, Y.: Boosting a Weak Learning Algorithm by Majority. Information and Computation\u00a0121(2), 256\u2013285 (1995)","journal-title":"Information and Computation"},{"issue":"5","key":"7_CR9","first-page":"771","volume":"14","author":"Y. Freund","year":"1999","unstructured":"Freund, Y., Schapire, R.: A Short Introduction to Boosting. Journal of the Japanese Society for Artificial Intelligence\u00a014(5), 771\u2013780 (1999)","journal-title":"Journal of the Japanese Society for Artificial Intelligence"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Goldberg, P.W., Goldman, S.A., Mathias, H.D.: Learning Unions of Boxes with Membership and Equivalence Queries. In: COLT 1994: Proc. of the 7th annual conference on computational learning theory, pp. 198\u2013207 (1994)","DOI":"10.1145\/180139.181102"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0022-0000(93)90001-D","volume":"46","author":"A. Hajnal","year":"1993","unstructured":"Hajnal, A., Maass, W., Pudl\u00e1k, P., Szegedy, M., Turan, G.: Threshold Circuits of Bounded Depth. J. Comp. & Syst. Sci.\u00a046, 129\u2013154 (1993)","journal-title":"J. Comp. & Syst. Sci."},{"key":"7_CR12","volume-title":"Computational Limitations for Small Depth Circuits","author":"J. H\u00e5stad","year":"1986","unstructured":"H\u00e5stad, J.: Computational Limitations for Small Depth Circuits. MIT Press, Cambridge, MA (1986)"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1006\/jcss.1997.1533","volume":"55","author":"J.C. Jackson","year":"1997","unstructured":"Jackson, J.C.: An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution. J. Comp. & Syst. Sci.\u00a055(3), 414\u2013440 (1997)","journal-title":"J. Comp. & Syst. Sci."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Jackson, J.C., Klivans, A.R., Servedio, R.A.: Learnability Beyond AC 0. In: Proc. of the 34th annual ACM symposium on theory of computing (STOC), pp. 776\u2013784 (2002)","DOI":"10.1145\/509907.510018"},{"issue":"5","key":"7_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0190(94)90057-4","volume":"49","author":"R. Khardon","year":"1994","unstructured":"Khardon, R.: On Using the Fourier Transform to Learn Disjoint DNF. Information Processing Letters\u00a049(5), 219\u2013222 (1994)","journal-title":"Information Processing Letters"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.jcss.2003.07.007","volume":"68","author":"A.R. Klivans","year":"2004","unstructured":"Klivans, A.R., Servedio, R.A.: Learning DNF in Time $2^{\\tilde{O}(n^{1\/3})}$ . J. Comp. & Syst. Sci.\u00a068(2), 303\u2013318 (2004)","journal-title":"J. Comp. & Syst. Sci."},{"issue":"4","key":"7_CR17","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/s000370050015","volume":"7","author":"M. Krause","year":"1998","unstructured":"Krause, M., Pudl\u00e1k, P.: Computing Boolean Functions by Polynomials and Threshold Circuits. Computational Complexity\u00a07(4), 346\u2013370 (1998)","journal-title":"Computational Complexity"},{"issue":"6","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1137\/0222080","volume":"22","author":"E. Kushilevitz","year":"1993","unstructured":"Kushilevitz, E., Mansour, Y.: Learning Decision Trees using the Fourier Spectrum. SIAM Journal on Computing\u00a022(6), 1331\u20131348 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/inco.1997.2686","volume":"141","author":"W. Maass","year":"1998","unstructured":"Maass, W., Warmuth, M.K.: Efficient Learning with Virtual Threshold Gates. Information and Computation\u00a0141(1), 66\u201383 (1998)","journal-title":"Information and Computation"},{"key":"7_CR20","first-page":"197","volume":"5","author":"R.E. Schapire","year":"1990","unstructured":"Schapire, R.E.: The Strength of Weak Learnability. Machine Learning\u00a05, 197\u2013227 (1990)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11894841_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:55:37Z","timestamp":1605642937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11894841_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540466499","9783540466505"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11894841_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}