{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:12Z","timestamp":1725488472089},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423430"},{"type":"electronic","value":"9783540445814"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44581-1_33","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:13:49Z","timestamp":1186726429000},"page":"507-516","source":"Crossref","is-referenced-by-count":9,"title":["Agnostic Boosting"],"prefix":"10.1007","author":[{"given":"Shai","family":"Ben-David","sequence":"first","affiliation":[]},{"given":"Philip M.","family":"Long","sequence":"additional","affiliation":[]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,13]]},"reference":[{"issue":"2","key":"33_CR1","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/18.661502","volume":"44","author":"P.L. Bartlett","year":"1998","unstructured":"P.L. Bartlett. The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network. IEEE Transactions on Information Theory, 44(2):525\u2013536, 1998.","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"P.L. Bartlett and S. Ben-David. Hardness Results for Neural Network Approximation Problems. Proceedings of the 4th European Conference on Computational Learning Theory (EuroCOLT\u201999), pp 50\u201362. Arevised version will appear in JCSS.","DOI":"10.1007\/3-540-49097-3_5"},{"key":"33_CR3","unstructured":"S. Ben-David, N. Eiron, and P. Long. On the difficulty of approximately maximizing agreement. Proceedings of the 13th Annual Conference on Computational Learning Theory, COLT00, pages 266\u2013274, 2000."},{"key":"33_CR4","unstructured":"S. Ben-David and H.U. Simon. Efficient learning of linear perceptrons. In NIPS, 2000."},{"key":"33_CR5","unstructured":"Yoav Freund. Data Filtering and Distribution Modeling Algorithms for Machine Learning. PhD thesis, University of California at Santa Cruz, 1993. Retrievable from: ftp:\/\/cse.ucsc.edu\/pub\/tr\/ucsc-crl-93-37.ps.Z ."},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Yoav Freund and Robert E. Schapire. Adecision-theoretic generalization of online learning and an application to boosting. In Computational Learning Theory: Second European Conference, EuroCOLT\u2019 95, pages 23\u201337. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59119-2_166"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0890-5401(91)90042-Z","volume":"95","author":"D. Haussler","year":"1991","unstructured":"D. Haussler, M. Kearns, N. Littlestone, and M.K. Warmuth. Equivalence of models for polynomial learnability. Information and Computation, 95:129\u2013161, 1991.","journal-title":"Information and Computation"},{"key":"33_CR8","first-page":"115","volume":"17","author":"M.J. Kearns","year":"1994","unstructured":"M.J. Kearns, R.E. Schapire, and L.M. Sellie. Toward efficient agnostic learning. Machine Learning, 17:115\u2013141, 1994.","journal-title":"Machine Learning"},{"key":"33_CR9","unstructured":"D.E. Knuth. The Art of Computer Programming, Volume II: Semi numerical Algorithms. Addison-Wesley, 1981."},{"key":"33_CR10","unstructured":"Robert E. Schapire. The Design and Analysis of Efficient Learning Algorithms. PhD thesis, M. I. T., 1991."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Robert E. Schapire. Theoretical views of boosting and applications. In Tenth International Conference on Algorithmic Learning Theory, 1999.","DOI":"10.1007\/3-540-46769-6_2"},{"issue":"11","key":"33_CR12","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"L.G. Valiant. Atheory 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","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44581-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:11:27Z","timestamp":1556734287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44581-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423430","9783540445814"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44581-1_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}