{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:34Z","timestamp":1725664594105},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540604549"},{"type":"electronic","value":"9783540474708"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60454-5_33","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:38:54Z","timestamp":1330288734000},"page":"123-137","source":"Crossref","is-referenced-by-count":0,"title":["Learning nested differences in the presence of malicious noise"],"prefix":"10.1007","author":[{"given":"Peter","family":"Auer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Peter Auer and Nicol\u00f2 Cesa-Bianchi. On-line learning with malicious noise and the closure algorithm. In Setsno Arikawa and Klaus P. Jantke, editors, Algorithmic Learnung Theory. AII'94. ALT'94, pages 229\u2013247. Lecture Notes in Artificial Intelligence 872, Springer, 1994.","DOI":"10.1007\/3-540-58520-6_67"},{"issue":"4","key":"9_CR2","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":"9_CR3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0166-218X(93)90126-9","volume":"47","author":"M. Anthony","year":"1993","unstructured":"M. Anthony and J. Shawe-Taylor. A result of Vapnik with applications. Discrete Applied Mathematics. 47:207\u2013217, 1993.","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Peter Auer. On-line learning of rectangles in noisy environments. In Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory. pages 253\u2013261. ACM Press, 1993.","DOI":"10.1145\/168304.168345"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"D. Haussler, N. Littlestone, and M. K. Warmuth. Predicting {0,1} functions on randomly drawn points. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 100\u2013109. IEEE Computer Society Press, 1988.","DOI":"10.1109\/SFCS.1988.21928"},{"key":"9_CR6","first-page":"165","volume":"5","author":"D. Helmbold","year":"1990","unstructured":"David Helmbold, Robert Sloan, and Manfred K. Warmuth. Lerning nested differences of intersection-closed concept classes. Machine Learning, 5:165\u2013196, 1990.","journal-title":"Machine Learning"},{"issue":"2","key":"9_CR7","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/0221019","volume":"21","author":"D. Helmbold","year":"1992","unstructured":"D. Helmbold, R. Sloan, and M. K. Warmuth. Learning integer lattices. SIAM J. Comput., 21(2):240\u2013266, 1992.","journal-title":"SIAM J. Comput."},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/0222052","volume":"22","author":"M. Kearns","year":"1993","unstructured":"M. Kearns and M. Li. Learning in the presence of malicious errors. SIAM J. Comput., 22:807\u2013837, 1993.","journal-title":"SIAM J. Comput."},{"key":"9_CR9","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"N. Littlestone. Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning. 2:285\u2013318, 1988.","journal-title":"Machine Learning"},{"key":"9_CR10","volume-title":"Machine Learning: A Theoretical Approach","author":"B. K. Natarajan","year":"1991","unstructured":"B. K. Natarajan. Machine Learning: A Theoretical Approach. Morgan Kaufmann, San Mateo. CA, 1991."},{"issue":"11","key":"9_CR11","doi-asserted-by":"crossref","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."},{"issue":"2","key":"9_CR12","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V. N. Vapnik","year":"1971","unstructured":"V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probab. and its Applications. 16(2):264\u2013280, 1971.","journal-title":"Theory of Probab. and its Applications"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60454-5_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:59:21Z","timestamp":1605646761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60454-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540604549","9783540474708"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60454-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}