{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T10:35:01Z","timestamp":1753180501546,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":12,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_198","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:35:05Z","timestamp":1214505305000},"page":"436-438","source":"Crossref","is-referenced-by-count":1,"title":["Learning with Malicious Noise"],"prefix":"10.1007","author":[{"given":"Peter","family":"Auer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"198_CR1_198","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1018960107028","volume":"23","author":"P. Auer","year":"1998","unstructured":"Auer, P., Cesa-Bianchi, N.: On-line learning with malicious noise and the closure algorithm. Ann. Math. Artif. Intell. 23, 83\u201399 (1998)","journal-title":"Ann. Math. Artif. Intell."},{"key":"198_CR2_198","first-page":"496","volume":"66","author":"S. Ben-David","year":"2003","unstructured":"Ben-David, S., Eiron, N., Long, P.: On the difficulty of approximately maximizing agreements. J.\u00a0CSS 66, 496\u2013514 (2003)","journal-title":"J. CSS"},{"key":"198_CR3_198","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.: Learnability and the Vapnik-Chervonenkis dimension. J.\u00a0ACM 36, 929\u2013965 (1989)","journal-title":"J. ACM"},{"key":"198_CR4_198","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0304-3975(01)00403-0","volume":"288","author":"N. Bshouty","year":"2002","unstructured":"Bshouty, N., Eiron, N., Kushilevitz, E.: PAC learning with nasty noise. TCS 288, 255\u2013275 (2002)","journal-title":"TCS"},{"key":"198_CR5_198","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1145\/324133.324221","volume":"46","author":"N. Cesa-Bianchi","year":"1999","unstructured":"Cesa-Bianchi, N., Dichterman, E., Fischer, P., Shamir, E., Simon, H.U.: Sample-efficient strategies for learning in the presence of noise. J.\u00a0ACM 46, 684\u2013719 (1999)","journal-title":"J. ACM"},{"key":"198_CR6_198","first-page":"191","volume":"56","author":"J.A. Aslam","year":"1998","unstructured":"Aslam, J.A., Decatur, S.E.: Specification and simulation of statistical query algorithms for efficiency and noise tolerance. J.\u00a0CSS 56, 191\u2013208 (1998)","journal-title":"J. CSS"},{"key":"198_CR7_198","doi-asserted-by":"crossref","unstructured":"Kearns, M., Li, M.: Learning in the presence of malicious errors. In: Proc. 20th ACM Symp. Theory of Computing, pp. 267\u2013280, Chicago, 2\u20134 May 1988","DOI":"10.1145\/62212.62238"},{"key":"198_CR8_198","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1137\/0222052","volume":"22","author":"M. Kearns","year":"1993","unstructured":"Kearns, M., Li, M.: Learning in the presence of malicious errors. SIAM J. Comput. 22, 807\u2013837 (1993)","journal-title":"SIAM J. Comput."},{"key":"198_CR9_198","first-page":"115","volume":"17","author":"M. Kearns","year":"1994","unstructured":"Kearns, M., Schapire, R., Sellie, L.: Toward efficient agnostic learning. Mach. Learn. 17, 115\u2013141 (1994)","journal-title":"Mach. Learn."},{"key":"198_CR10_198","first-page":"633","volume":"4","author":"R.A. Servedio","year":"2003","unstructured":"Servedio, R.A.: Smooth boosting and learning with malicious noise. JMLR 4, 633\u2013648 (2003)","journal-title":"JMLR"},{"key":"198_CR11_198","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"Valiant, L.: A\u00a0theory of the learnable. C. ACM 27, 1134\u20131142 (1984)","journal-title":"C. ACM"},{"key":"198_CR12_198","unstructured":"Valiant, L.: Learning disjunctions of conjunctions. In: Proc. 9th Int. Joint Conference on Artificial Intelligence, pp. 560\u2013566, Los Angeles, August 1985"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:19Z","timestamp":1738272739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_198"}},"subtitle":["1993; Kearns, Li"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_198","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}