{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:03Z","timestamp":1725663963795},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573708"},{"type":"electronic","value":"9783540480969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57370-4_53","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:55:38Z","timestamp":1330260938000},"page":"265-278","source":"Crossref","is-referenced-by-count":0,"title":["On the sample complexity of consistent learning with one-sided error"],"prefix":"10.1007","author":[{"given":"Eiji","family":"Takimoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Maruoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"M. Anthony, N. Biggs, and J. Shawe-Taylor. The learnability of formal concepts. In Proceedings of the 3rd Workshop on Computational Learning Theory, pages 246\u2013257, 1990.","DOI":"10.1016\/B978-1-55860-146-8.50022-9"},{"issue":"4","key":"21_CR2","doi-asserted-by":"crossref","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. Journal of the Association for Computing Machinery, 36(4):929\u2013965, Aug. 1989.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"21_CR3","unstructured":"A. Ehrenfeucht, D. Haussler, M. Kearns, and L. G. Valiant. A general lower bound on the number of examples needed for learning. In Proc. Conference on Learning, pages 110\u2013120, 1988."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"D. Haussler, N. Littlestone, and M. Warmuth. Predicting {0,l}-functions on randomly drawn points. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 100\u2013109. IEEE, 1988.","DOI":"10.1109\/SFCS.1988.21928"},{"key":"21_CR5","unstructured":"E. Maeda. Private communications."},{"key":"21_CR6","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, 1991."},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01683269","volume":"10","author":"N. Pippenger","year":"1977","unstructured":"N. Pippenger. Information theory and complexity of boolean functions. Mathematical Systems Theory, 10:129\u2013167, 1977.","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57370-4_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:04:41Z","timestamp":1619571881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57370-4_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573708","9783540480969"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-57370-4_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}