{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:39Z","timestamp":1725558519198},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201212"},{"type":"electronic","value":"9783540398578"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39857-8_32","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:07:15Z","timestamp":1277683635000},"page":"349-360","source":"Crossref","is-referenced-by-count":1,"title":["On Boosting Improvement: Error Reduction and Convergence Speed-Up"],"prefix":"10.1007","author":[{"given":"Marc","family":"Sebban","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henri-Maxime","family":"Suchier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","first-page":"123","volume":"24","author":"L. Breiman","year":"1996","unstructured":"Breiman, L.: Bagging predictors. Machine Learning\u00a024, 123\u2013140 (1996)","journal-title":"Machine Learning"},{"key":"32_CR2","unstructured":"Breiman, L.: Bias, variance, and arcing classifiers. Technical Report 460, Department of Statistics, University of California, Berkeley (1996)"},{"key":"32_CR3","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 algorithms by majority. Information and Computation\u00a0121, 256\u2013285 (1995)","journal-title":"Information and Computation"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Schapire, R.E.: The strength of weak learnability. Machine Learning (1990)","DOI":"10.1007\/BF00116037"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R.E. Schapire","year":"1998","unstructured":"Schapire, R.E., Freund, Y., Bartlett, P.L., Lee, W.S.: Boosting the margin: a new explanation for the effectiveness of voting methods. Annals of Statistics\u00a026, 1651\u20131686 (1998)","journal-title":"Annals of Statistics"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Schapire, R.E., Singer, Y.: Improved boosting algorithms using confidence-rated predictions. In: Press, A. (ed.) Eleventh Annual Conference on Computational Learning Theory, pp. 80\u201391 (1998)","DOI":"10.1145\/279943.279960"},{"issue":"1","key":"32_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 online learning and an application to boosting. International Journal of Computer and System Sciences\u00a055(1), 119\u2013139 (1997)","journal-title":"International Journal of Computer and System Sciences"},{"key":"32_CR8","unstructured":"Freund, Y., Schapire, R.E.: Experiments with a new boosting algorithm. In: Kaufmann, M. (ed.) Thirteenth International Conference on Machine Learning, pp. 148\u2013156 (1996)"},{"key":"32_CR9","unstructured":"Dietterich, T.G.: An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization. Machine Learning, 1\u201322 (1999)"},{"key":"32_CR10","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: Additive logistic regression: a statistical view of boosting. Technical report (1998)"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1010852229904","volume":"43","author":"Y. Freund","year":"2001","unstructured":"Freund, Y.: An adaptive version of the boost by majority algorithm. Machine Learning\u00a043, 293\u2013318 (2001)","journal-title":"Machine Learning"},{"key":"32_CR12","unstructured":"Domingo, C., Watanabe, O.: Madaboost: a modification of adaboost. In: Press, A., ed.: Third Annual Confernce on Computational Learning Theory, pp. 180\u2013189 (2000)"},{"issue":"3-4","key":"32_CR13","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0167-8655(00)00137-9","volume":"22","author":"R. Nock","year":"2001","unstructured":"Nock, R., Sebban, M.: A bayesian boosting theorem. Pattern Recognition Letters\u00a022 (3-4), 413\u2013419 (2001)","journal-title":"Pattern Recognition Letters"},{"key":"32_CR14","unstructured":"Sebban, M., Nock, R., Lallich, S.: Stopping criterion for boosting-based data reduction techniques: from binary to multiclass problems. Journal of Machine Learning Research (2003)"},{"key":"32_CR15","unstructured":"Wilson, D., Martinez, T.: Reduction techniques for exemplar-based learning algorithms. Machine Learning (1998)"},{"key":"32_CR16","unstructured":"Ratsch, G., Onoda, T., Muller, K.R.: Regularizing adaboost. In: Kearns, M.S., Solla, S.A., Cohn, D.A. (eds.) Conference NIPS (1998)"},{"key":"32_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-36755-1_21","volume-title":"Machine Learning: ECML 2002","author":"S. Kwek","year":"2002","unstructured":"Kwek, S., Nguyen, C.: iboost: Boosting using an instance-based exponential weighting scheme. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) ECML 2002. LNCS (LNAI), vol.\u00a02430, pp. 245\u2013257. Springer, Heidelberg (2002)"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Nock, R., Lefaucheur, P.: A robust boosting algorithm. In: Thirteenth European Conference on Machine Learning (2002)","DOI":"10.1007\/3-540-36755-1_27"},{"key":"32_CR19","unstructured":"Maclin, R.: Boosting classifiers regionally. In: AAAI\/IAAI, pp. 700\u2013705 (1998)"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"IT13","author":"T. Cover","year":"1967","unstructured":"Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE Trans. Inform. Theory\u00a0IT13, 21\u201327 (1967)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"32_CR21","volume-title":"Pattern recognition and scene analysis","author":"F. Preparata","year":"1985","unstructured":"Preparata, F., Shamos, M.: Pattern recognition and scene analysis. Springer, Heidelberg (1985)"},{"key":"32_CR22","volume-title":"Classification and regression trees with misclassification costs","author":"L. Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J., Olshen, R., Stone, C.: Classification and regression trees with misclassification costs. Chapman and Hall, Boca Raton (1984)"},{"key":"32_CR23","unstructured":"Merz, C.J., Murphy, P.M.: Uci repository of machine learning databases (1996), \n                    \n                      http:\/\/www.ics.uci.edu\/mlearn\/mlrepository.html"}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39857-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T17:59:57Z","timestamp":1547747997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39857-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201212","9783540398578"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39857-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}