{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:06:48Z","timestamp":1725559608516},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540265566"},{"type":"electronic","value":"9783540318927"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11503415_6","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T22:16:38Z","timestamp":1279145798000},"page":"79-94","source":"Crossref","is-referenced-by-count":11,"title":["Martingale Boosting"],"prefix":"10.1007","author":[{"given":"Philip M.","family":"Long","sequence":"first","affiliation":[]},{"given":"Rocco A.","family":"Servedio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Ben-David, S., Long, P.M., Mansour, Y.: Agnostic boosting. In: Proceedings of the 14th Annual Conference on Computational Learning Theory, pp. 507\u2013516 (2001)","DOI":"10.1007\/3-540-44581-1_33"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1162\/153244303321897708","volume":"3","author":"N. Bshouty","year":"2002","unstructured":"Bshouty, N., Gavinsky, D.: On boosting with optimal poly-bounded distributions. Journal of Machine Learning Research\u00a03, 483\u2013506 (2002)","journal-title":"Journal of Machine Learning Research"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Dasgupta, S., Long, P.: Boosting with diverse base classifiers. In: COLT (2003)","DOI":"10.1007\/978-3-540-45167-9_21"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"T.G. Dietterich","year":"2000","unstructured":"Dietterich, T.G.: An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization. Machine Learning\u00a040(2), 139\u2013158 (2000)","journal-title":"Machine Learning"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Freund, Y.: Boosting a weak learning algorithm by majority. Information and Computation\u00a0121(2), 256\u2013285 (1995)","journal-title":"Information and Computation"},{"key":"6_CR6","unstructured":"Freund, Y., Schapire, R.: Experiments with a new boosting algorithm. In: Proceedings of the Thirteenth International Conference on Machine Learning, pp. 148\u2013156 (1996)"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.: A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences\u00a055(1), 119\u2013139 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1162\/153244304322765667","volume":"4","author":"D. Gavinsky","year":"2003","unstructured":"Gavinsky, D.: Optimally-smooth adaptive boosting and application to agnostic learning. Journal of Machine Learning Research\u00a04, 101\u2013117 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Kalai, A., Servedio, R.: Boosting in the presence of noise. In: Proceedings of the 35th Annual Symposium on Theory of Computing (STOC), pp. 196\u2013205 (2003)","DOI":"10.1145\/780542.780573"},{"key":"6_CR10","unstructured":"Maclin, R., Opitz, D.: An empirical evaluation of bagging and boosting. In: AAAI\/IAAI, pp. 546\u2013551 (1997)"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/jcss.2001.1796","volume":"64","author":"Y. Mansour","year":"2002","unstructured":"Mansour, Y., McAllester, D.: Boosting using branching programs. Journal of Computer and System Sciences\u00a064(1), 103\u2013112 (2002)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1007697429651","volume":"38","author":"L. Mason","year":"2000","unstructured":"Mason, L., Bartlett, P.L., Baxter, J.: Improved generalization through explicit optimization of margins. Machine Learning\u00a038(3), 243\u2013255 (2000)","journal-title":"Machine Learning"},{"key":"6_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York, NY (1995)"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1007618119488","volume":"42","author":"G. R\u00e4tsch","year":"2001","unstructured":"R\u00e4tsch, G., Onoda, T., M\u00fcller, K.-R.: Soft margins for AdaBoost. Machine Learning\u00a042(3), 287\u2013320 (2001)","journal-title":"Machine Learning"},{"issue":"2","key":"6_CR15","first-page":"197","volume":"5","author":"R. Schapire","year":"1990","unstructured":"Schapire, R.: The strength of weak learnability. Machine Learning\u00a05(2), 197\u2013227 (1990)","journal-title":"Machine Learning"},{"issue":"5","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R. Schapire","year":"1998","unstructured":"Schapire, R., Freund, Y., Bartlett, P., Lee, W.: Boosting the margin: a new explanation for the effectiveness of voting methods. Annals of Statistics\u00a026(5), 1651\u20131686 (1998)","journal-title":"Annals of Statistics"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1162\/153244304773936072","volume":"4","author":"R. Servedio","year":"2003","unstructured":"Servedio, R.: Smooth boosting and learning with malicious noise. Journal of Machine Learning Research\u00a04, 633\u2013648 (2003)","journal-title":"Journal of Machine Learning Research"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11503415_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:42:55Z","timestamp":1619505775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11503415_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265566","9783540318927"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11503415_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}