{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:38:54Z","timestamp":1743089934815,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428756"},{"type":"electronic","value":"9783540455837"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45583-3_13","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"151-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Intermediate Concepts"],"prefix":"10.1007","author":[{"given":"Stephen S.","family":"Kwek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"13_CR1","first-page":"147","volume":"9","author":"D. Angluin","year":"1992","unstructured":"D. Angluin, M. Frazier, and L. Pitt. Learning conjunctions of Horn clauses. Machine Learning, 9:147\u2013164, 1992.","journal-title":"Machine Learning"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/138027.138061","volume":"40","author":"D. Angluin","year":"1993","unstructured":"D. Angluin, L. Hellerstein, and M. Karpinski. Learning read-once formulas with queries. J. ACM, 40:185\u2013210, 1993.","journal-title":"J. ACM"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"D. Angluin and M. Krikis. Learningwith malicious membership queries and exceptions. In Proc. 7th Annu. ACM Workshop on Comput. Learning Theory, pages 57\u201366. ACM Press, New York, NY, 1994.","DOI":"10.1145\/180139.181015"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1007311411259","volume":"28","author":"D. Angluin","year":"1997","unstructured":"Dana Angluin, M\u0101rtin\u0161 Krikis, Robert H. Sloan, and Gy\u00f6rgy Tur\u00e1n. Malicious omissions and errors in answers to membership queries. Machine Learning, 28:211\u2013255, 1997.","journal-title":"Machine Learning"},{"issue":"4","key":"13_CR5","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. Queries and concept learning. Machine Learning, 2(4):319\u2013342, April 1988.","journal-title":"Machine Learning"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"D. Angluin and D. K. Slonim. Learning monotone DNF with an incomplete membership oracle. In Proc. 4th Annu. Workshop on Comput. Learning Theory, pages 139\u2013146, San Mateo, CA, 1991. Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-213-7.50016-X"},{"key":"13_CR7","first-page":"150","volume":"38","author":"D. Barrington","year":"1989","unstructured":"David Barrington. Bounded-width polynomial-size branching programs recognize exactly those language in nc. JCSS, 38:150\u2013164, 1989.","journal-title":"JCSS"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Jonathan Baxter. Learningin ternal representations. In Proc. 8th Annu. Conf. on Comput. Learning Theory, pages 311\u2013320. ACM Press, New York, NY, 1995.","DOI":"10.1145\/225298.225336"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1007327622663","volume":"28","author":"J. Baxter","year":"1997","unstructured":"Jonathan Baxter. A Bayesian\/information theoretic model of learningto learn via multiple task sampling. Machine Learning, 28:7\u201339, 1997.","journal-title":"Machine Learning"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Avrim Blum, Prasad Chalasani, Sally A. Goldman, and Donna K. Slonim. Learningwith unreliable boundary queries. In Proc. 8th Annu. Conf. on Comput. Learning Theory, pages 98\u2013107. ACM Press, New York, NY, 1995.","DOI":"10.1145\/225298.225310"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. J. ACM, 36(4):929\u2013965, 1989.","journal-title":"J. ACM"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Nader H. Bshouty, Christino Tamon, and David K. Wilson. On learning width two branchingprog rams. In Proc. 9th Annu. Conf. on Comput. Learning Theory, pages 224\u2013227. ACM Press, New York, NY, 1996.","DOI":"10.1145\/238061.238102"},{"key":"13_CR13","unstructured":"Rich Caruana. Algorithms and applications for multitask learning. In Proc. 13th International Conference on Machine Learning, pages 87\u201395. Morgan Kaufmann, 1996."},{"key":"13_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-49430-8_9","volume-title":"A dozen tricks with multitask learning","author":"R. Caruana","year":"1998","unstructured":"R. Caruana. A dozen tricks with multitask learning. Lecture Notes in Computer Science, 1524:165\u2013187, 1998."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"N. Cesa-Bianchi, P. Long, and M. K. Warmuth. Worst-case quadratic loss bounds for on-line prediction of linear functions by gradient descent. IEEE Transactions on Neural Networks, 1995. To appear. An extended abstract appeared in COLT\u2019 93.","DOI":"10.1109\/72.501719"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1007379606734","volume":"28","author":"R. Caruana","year":"1997","unstructured":"Rich Caruana, Lorien Pratt, and Sebastian Thrun. Multitask learning. Machine Learning, 28:41, 1997.","journal-title":"Machine Learning"},{"key":"13_CR17","first-page":"51","volume":"18","author":"T. G. Dietterich","year":"1995","unstructured":"Thomas G. Dietterich, Hermann Hild, and Ghulum Bakiri. A comparison of ID3 and backpropagation for english text-to-speech mapping. Machine Learning, 18:51\u201380, 1995.","journal-title":"Machine Learning"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Ricard Gavald\u00e0 and David Guijarro. Learningordered binary decision diagrams. In Proc. 6th Int. Workshop on Algorithmic Learning Theory, pages 228\u2013238. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60454-5_41"},{"key":"13_CR19","unstructured":"D. P. Helmbold, J. Kivinen, and M. K. Warmuth. Worst-case loss bounds for sigmoided linear neurons. In Proc. 1996 Neural Information Processing Conference, 1996. To appear."},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"M. Kearns. Efficient noise-tolerant learningfrom statistical queries. In Proc. 25th Annu. ACM Sympos. Theory Comput., pages 392\u2013401. ACM Press, New York, NY, 1993.","DOI":"10.1145\/167088.167200"},{"issue":"2","key":"13_CR21","first-page":"115","volume":"17","author":"M. J. Kearns","year":"1994","unstructured":"Michael J. Kearns, Robert E. Schapire, and Linda M. Sellie. Toward efficient agnostic learning. Machine Learning, 17(2\/3):115\u2013142, 1994.","journal-title":"Machine Learning"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"J. Kivinen and M. K. Warmuth. Exponentiated gradient versus gradient descent for linear predictors. Technical Report UCSC-CRL-94-16, University of California, Santa Cruz, Computer Research Laboratory, June 1994. Revised December 7, 1995. An extended abstract to appeared in the STOC 95, pp. 209\u2013218.","DOI":"10.1145\/225058.225121"},{"key":"13_CR23","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"N. Littlestone. Learningwhen irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning, 2:285\u2013318, 1988.","journal-title":"Machine Learning"},{"key":"13_CR24","first-page":"229","volume":"2","author":"R. L. Rivest","year":"1987","unstructured":"Ronald L. Rivest. Learningdecision lists. Machine Learning, 2:229\u2013246, 1987.","journal-title":"Machine Learning"},{"issue":"3","key":"13_CR25","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0020-7373(05)80130-0","volume":"35","author":"S. C. Suddarth","year":"1991","unstructured":"Steven C. Suddarth and Alistair D. C. Holden. Symbolic-neural systems and the use of hints for developingcomplex systems. International Journal of Man-Machine Studies, 35(3):291\u2013311, 1991.","journal-title":"International Journal of Man-Machine Studies"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"S. C. Suddarth and Y. L. Kergosien. Rule-injection hints as a means of improvingnet work performance and learningtime. In Proceedings of the EURASIP Workshop on Neural Networks, pages 120\u2013129, Sesimbra, Portugal, February 1990. EURASIP.","DOI":"10.1007\/3-540-52255-7_33"},{"issue":"11","key":"13_CR27","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"L. G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134\u20131142, November 1984.","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45583-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T19:11:12Z","timestamp":1737486672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_13"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}