{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:19:30Z","timestamp":1725563970959},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161070"},{"type":"electronic","value":"9783642161087"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16108-7_19","type":"book-chapter","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T08:58:37Z","timestamp":1283245117000},"page":"209-223","source":"Crossref","is-referenced-by-count":10,"title":["Recursive Teaching Dimension, Learning Complexity, and Maximum Classes"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"Doliwa","sequence":"first","affiliation":[]},{"given":"Hans Ulrich","family":"Simon","sequence":"additional","affiliation":[]},{"given":"Sandra","family":"Zilles","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn.\u00a02, 319\u2013342 (1988)","journal-title":"Mach. Learn."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.tcs.2008.02.025","volume":"397","author":"F. Balbach","year":"2008","unstructured":"Balbach, F.: Measuring teachability using variants of the teaching dimension. Theoret. Comput. Sci.\u00a0397, 94\u2013113 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1007510732151","volume":"33","author":"S. Ben-David","year":"1998","unstructured":"Ben-David, S., Eiron, N.: Self-directed learning and its relation to the VC-dimension and to teacher-directed learning. Mach. Learn.\u00a033, 87\u2013104 (1998)","journal-title":"Mach. Learn."},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00000-6","volume":"86","author":"S. Ben-David","year":"1998","unstructured":"Ben-David, S., Litman, A.: Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes. Discrete Appl. Math.\u00a086(1), 3\u201325 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"19_CR5","first-page":"269","volume":"21","author":"S. Floyd","year":"1995","unstructured":"Floyd, S., Warmuth, M.: Sample compression, learnability, and the vapnik-chervonenkis dimension. Mach. Learn.\u00a021(3), 269\u2013304 (1995)","journal-title":"Mach. Learn."},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jcss.1995.1003","volume":"50","author":"S. Goldman","year":"1995","unstructured":"Goldman, S., Kearns, M.: On the complexity of teaching. J. Comput. Syst. Sci.\u00a050(1), 20\u201331 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1137\/0222062","volume":"22","author":"S. Goldman","year":"1993","unstructured":"Goldman, S., Rivest, R., Schapire, R.: Learning binary relations and total orders. SIAM J. Comput.\u00a022(5), 1006\u20131034 (1993)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"19_CR8","first-page":"271","volume":"14","author":"S. Goldman","year":"1994","unstructured":"Goldman, S., Sloan, R.: The power of self-directed learning. Mach. Learn.\u00a014(1), 271\u2013294 (1994)","journal-title":"Mach. Learn."},{"key":"19_CR9","first-page":"165","volume":"5","author":"D. Helmbold","year":"1990","unstructured":"Helmbold, D., Sloan, R., Warmuth, M.: Learning nested differences of intersection-closed concept classes. Mach. Learn.\u00a05, 165\u2013196 (1990)","journal-title":"Mach. Learn."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Jackson, J., Tomkins, A.: A computational model of teaching. In: 5th Annl. Workshop on Computational Learning Theory, pp. 319\u2013326 (1992)","DOI":"10.1145\/130385.130421"},{"key":"19_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-49097-3_14","volume-title":"Computational Learning Theory","author":"C. Kuhlmann","year":"1999","unstructured":"Kuhlmann, C.: On teaching and learning intersection-closed concept classes. In: Fischer, P., Simon, H.U. (eds.) EuroCOLT 1999. LNCS (LNAI), vol.\u00a01572, pp. 168\u2013182. Springer, Heidelberg (1999)"},{"key":"19_CR12","first-page":"2047","volume":"8","author":"D. Kuzmin","year":"2007","unstructured":"Kuzmin, D., Warmuth, M.: Unlabeled compression schemes for maximum classes. J. Mach. Learn. Research\u00a08, 2047\u20132081 (2007)","journal-title":"J. Mach. Learn. Research"},{"issue":"4","key":"19_CR13","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Mach. Learn.\u00a02(4), 285\u2013318 (1988)","journal-title":"Mach. Learn."},{"key":"19_CR14","unstructured":"Littlestone, N., Warmuth, M.: Relating data compression and learnability. Technical report, UC Santa Cruz (1986)"},{"key":"19_CR15","first-page":"107","volume":"9","author":"W. Maass","year":"1992","unstructured":"Maass, W., Tur\u00e1n, G.: Lower bound methods and separation results for on-line learning models. Mach. Learn.\u00a09, 107\u2013145 (1992)","journal-title":"Mach. Learn."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Natarajan, B.: On learning boolean functions. In: 19th Annl. Symp. Theory of Computing, pp. 296\u2013304 (1987)","DOI":"10.1145\/28395.28427"},{"key":"19_CR17","unstructured":"Rubinstein, B., Rubinstein, J.: A geometric approach to sample compression (2009) (unpublished manuscript)"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N. Sauer","year":"1972","unstructured":"Sauer, N.: On the density of families of sets. J. Comb. Theory, Ser. A\u00a013(1), 145\u2013147 (1972)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF03037091","volume":"8","author":"A. Shinohara","year":"1991","unstructured":"Shinohara, A., Miyano, S.: Teachability in computational learning. New Generat. Comput.\u00a08, 337\u2013348 (1991)","journal-title":"New Generat. Comput."},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V. Vapnik","year":"1971","unstructured":"Vapnik, V., Chervonenkis, A.: On the uniform convergence of relative frequencies of events to their probabilities. Theor. Probability and Appl.\u00a016, 264\u2013280 (1971)","journal-title":"Theor. Probability and Appl."},{"key":"19_CR21","unstructured":"Welzl, E.: Complete range spaces (1987) (unpublished notes)"},{"key":"19_CR22","unstructured":"Zilles, S., Lange, S., Holte, R., Zinkevich, M.: Teaching dimensions based on cooperative learning. In: 21st Annl. Conf. Learning Theory, pp. 135\u2013146 (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16108-7_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:22:21Z","timestamp":1619770941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16108-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161070","9783642161087"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16108-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}