{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:54Z","timestamp":1725664314603},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540585206"},{"type":"electronic","value":"9783540490302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58520-6_67","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:34:21Z","timestamp":1330256061000},"page":"229-247","source":"Crossref","is-referenced-by-count":2,"title":["On-line learning with malicious noise and the closure algorithm"],"prefix":"10.1007","author":[{"given":"Peter","family":"Auer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicol\u00f3","family":"Cesa-Bianchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"22_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. Queries and concept learning. Machine Learning, 2:319\u2013342, 1988.","journal-title":"Machine Learning"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"P. Auer. On-line learning of rectangles in noisy environments. In Proceedings of the 6th Annual ACM Workshop on Computational Learning Theory, pages 253\u2013261. ACM Press, 1993.","DOI":"10.1145\/168304.168345"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"P. Auer and P.M Long. Simulating access to hidden information while learning. In Proceedings of the 26th ACM Symposium on the Theory of Computation, pages 263\u2013272. ACM Press, 1994.","DOI":"10.1145\/195058.195152"},{"key":"22_CR4","unstructured":"S. Boucheron. Learnability from positive examples in the Valiant framework. Manuscript, 1988."},{"key":"22_CR5","unstructured":"N. Cesa-Bianchi. Models of learning with noise. Manuscript, 1994."},{"key":"22_CR6","unstructured":"N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, and M.K. Warmuth. On-line prediction and conversion strategies. In Proceedings of the First Euro-COLT Workshop. The Institute of Mathematics and its Applications, 1994. To appear."},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0221014","volume":"21","author":"P. Fischer","year":"1992","unstructured":"P. Fischer and H.U. Simon. On learning ring-sum-expansions. SIAM Journal on Computing, 21:181\u2013192, 1992.","journal-title":"SIAM Journal on Computing"},{"key":"22_CR8","volume-title":"Technical Report UCSC-CRL-90-54","author":"D. Haussier","year":"1990","unstructured":"D. Haussier, N. Littlestone, and M.K. Warmuth. Predicting {0,1} functions on randomly drawn points. Technical Report UCSC-CRL-90-54, University of California at Santa Cruz, 1990. An extended abstract appeared in: Proceedings of the 29th Annual Symposium on the Foundations of Computer Science."},{"key":"22_CR9","volume-title":"Technical Report UCSC-CRL-91-26","author":"D.P. Helmbold","year":"1991","unstructured":"D.P. Helmbold and P.M. Long. Tracking drifting concepts by minimizing disagreements. Technical Report UCSC-CRL-91-26, University of California at Santa Cruz, 1991."},{"issue":"2","key":"22_CR10","first-page":"165","volume":"5","author":"D.P. Helmbold","year":"1990","unstructured":"D.P. Helmbold, R. Sloan, and M.K. Warmuth. Learning nested differences of intersection-closed concept classes. Machine Learning, 5(2):165\u2013196, 1990.","journal-title":"Machine Learning"},{"issue":"2","key":"22_CR11","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/0221019","volume":"21","author":"D.P. Helmbold","year":"1992","unstructured":"D.P. Helmbold, R. Sloan, and M.K. Warmuth. Learning integer lattices. SIAM Journal on Computing, 21(2):240\u2013266, 1992.","journal-title":"SIAM Journal on Computing"},{"key":"22_CR12","volume-title":"Technical Report UCSC-CRL-92-54","author":"D.P. Helmbold","year":"1992","unstructured":"D.P. Helmbold and M.K. Warmuth. On weak learning. Technical Report UCSC-CRL-92-54, University of California at Santa Cruz, 1992."},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13\u201330, 1963.","journal-title":"Journal of the American Statistical Association"},{"issue":"4","key":"22_CR14","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/0222052","volume":"22","author":"M.J. Kearns","year":"1993","unstructured":"M.J. Kearns and M. Li. Learning in the presence of malicious errors. SIAM Journal on Computing, 22(4):807\u2013837, 1993. A preliminary version appeared in: Proceedings of the 20th ACM Symposium on the Theory of Computation.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"22_CR15","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"N. Littlestone. Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2(4):285\u2013318, 1988.","journal-title":"Machine Learning"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"N. Littlestone. From on-line to batch learning. In Proceedings of the 2nd Annual Workshop on Computational Learning Theory, pages 269\u2013284. Morgan Kaufmann, 1989.","DOI":"10.1016\/B978-0-08-094829-4.50022-2"},{"key":"22_CR17","volume-title":"PhD thesis","author":"N. Littlestone","year":"1989","unstructured":"N. Littlestone. Mistake Bounds and Logarithmic Linear-threshold Learning Algorithms. PhD thesis, University of California at Santa Cruz, 1989."},{"key":"22_CR18","volume-title":"Technical Report UCSC-CRL-91-28","author":"N. Littlestone","year":"1991","unstructured":"N. Littlestone and M.K. Warmuth. The weighted majority algorithm. Technical Report UCSC-CRL-91-28, University of California at Santa Cruz, 1991. An extended abstract appeared in: Proceedings of the 30th Annual Symposium on the Foundations of Computer Science."},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"B.K. Natarajan. On learning boolean functions. In Proceedings of the 19th ACM Symposium on the Theory of Computation, pages 296\u2013304. ACM Press, 1987.","DOI":"10.1145\/28395.28427"},{"key":"22_CR20","unstructured":"B.K. Natarajan. Machine Learning: A Theoretical Approach. Morgan Kaufmann, 1991."},{"key":"22_CR21","unstructured":"A. Schrijver. Theory of Linear and Integer Programming. John Wiley and sons, 1986."},{"issue":"11","key":"22_CR22","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134\u20131142, 1984.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58520-6_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:18:43Z","timestamp":1619558323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58520-6_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540585206","9783540490302"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-58520-6_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}