{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:30Z","timestamp":1725484290354},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438366"},{"type":"electronic","value":"9783540454359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45435-7_21","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T01:44:50Z","timestamp":1179279890000},"page":"303-319","source":"Crossref","is-referenced-by-count":8,"title":["A Consistent Strategy for Boosting Algorithms"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"Lugosi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Vayatis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"key":"21_CR1","unstructured":"Y. Amit and G. Blanchard and K. Wilder. Multiple Randomized Classifiers. Submitted, 2001."},{"key":"21_CR2","unstructured":"G. Blanchard. M\u00e9thodes de m\u00e9lange et d\u2019agr\u00e9gation en reconnaissance de formes. Application aux arbres de d\u00e9cision. PhD thesis, Universit\u00e9 Paris XIII, 2001. In English."},{"issue":"2","key":"21_CR3","first-page":"123","volume":"26","author":"L. Breiman","year":"1996","unstructured":"L. Breiman. Bagging predictors. Machine Learning, 26(2):123\u2013140, 1996.","journal-title":"Machine Learning"},{"key":"21_CR4","unstructured":"L. Breiman. Bias, variance, and arcing classifiers. Technical Report 460, Statistics Department, University of California, April 1996."},{"key":"21_CR5","unstructured":"L. Breiman. Arcing the edge. Technical Report 486, Statistics Department, University of California, June 1997."},{"key":"21_CR6","unstructured":"L. Breiman. Pasting bites together for prediction in large data sets. Technical report, Statistics Department, University of California, July 1997."},{"key":"21_CR7","unstructured":"L. Breiman. Prediction games and arcing algorithms. Technical Report 504, Statistics Department, University of California, December 1997."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1214\/aos\/1024691079","volume":"26","author":"L. Breiman","year":"1998","unstructured":"L. Breiman. Arcing classifiers. Annals of Statistics, 26:801\u2013849, 1998.","journal-title":"Annals of Statistics"},{"key":"21_CR9","volume-title":"Technical Report 577","author":"L. Breiman","year":"2000","unstructured":"L. Breiman. Some infinite theory for predictor ensembles. Technical Report 577, Statistics Department, UC Berkeley, August 2000."},{"key":"21_CR10","first-page":"377","volume":"28","author":"P. B\u00fchlmann","year":"2000","unstructured":"P. B\u00fchlmann and B. Yu. Discussion of the paper \u201cAdditive Logistic Regression\u201d by Jerome Friedman, Trevor Hastie and Robert Tibshirani. The Annals of Statistics, 28:377\u2013386, 2000.","journal-title":"The Annals of Statistics"},{"key":"21_CR11","unstructured":"P. B\u00fchlmann and B. Yu. Boosting with the L2-Loss: Regression and Classification Manuscript, August 2001."},{"key":"21_CR12","unstructured":"M. Collins, R. E. Schapire, and Y. Singer. Logistic regression, AdaBoost and Bregman distances. In Proceedings of the Thirteenth Annual Conference on Computational Learning Theory, 2000."},{"key":"21_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A Probabilistic Theory of Pattern Recognition","author":"L. Devroye","year":"1996","unstructured":"L. Devroye, L. Gy\u00f6rfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer-Verlag, New York, 1996."},{"key":"21_CR14","volume-title":"Combinatorial Methods in Density Estimation","author":"L. Devroye","year":"2000","unstructured":"L. Devroye and G. Lugosi. Combinatorial Methods in Density Estimation. Springer-Verlag, New York, 2000."},{"issue":"2","key":"21_CR15","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121(2):256\u2013285, September 1995.","journal-title":"Information and Computation"},{"key":"21_CR16","unstructured":"Y. Freund, Y. Mansour, and R. E. Schapire. Why averaging classifiers can protect against overfitting. In Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics, 2001."},{"key":"21_CR17","unstructured":"Y. Freund and R. E. Schapire. Experiments with a new boosting algorithm. In Proc. 13th International Conference on Machine Learning, pages 148\u2013146. Morgan Kaufmann, 1996."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/238061.238163","volume-title":"Proc. 9th Annu. Conf. on Comput. Learning Theory","author":"Y. Freund","year":"1996","unstructured":"Y. Freund and R. E. Schapire. Game theory, on-line prediction and boosting. In Proc. 9th Annu. Conf. on Comput. Learning Theory, pages 325\u2013332. ACM Press, New York, NY, 1996."},{"issue":"1","key":"21_CR19","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119\u2013139, August 1997.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"21_CR20","first-page":"391","volume":"38","author":"Y. Freund","year":"2000","unstructured":"Y. Freund and R. E. Schapire. Discussion of the paper \u201cadditive logistic regression: a statistical view of boosting\u201d by J. Friedman, T. Hastie and R. Tibshirani. The Annals of Statistics, 38(2):391\u2013393, 2000.","journal-title":"The Annals of Statistics"},{"key":"21_CR21","unstructured":"J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: a statistical view of boosting. Technical report, Department of Statistics, Sequoia Hall, Stanford University, July 1998."},{"key":"21_CR22","unstructured":"W. Jiang. Process consistency for adaboost. Technical Report 00-05, Department of Statistics, Northwestern University, November 2000."},{"key":"21_CR23","unstructured":"W. Jiang. Some theoretical aspects of boosting in the presence of noisy data. In Proceedings of The Eighteenth International Conference on Machine Learning (ICML-2001), June 2001, Morgan Kaufmann."},{"key":"21_CR24","unstructured":"V. Koltchinskii and D. Panchenko. Empirical margin distributions and bounding the generalization error of combined classifiers. Submitted, 2000."},{"key":"21_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20212-4","volume-title":"Probability in Banach Space","author":"M. Ledoux","year":"1991","unstructured":"M. Ledoux and M. Talagrand. Probability in Banach Space. Springer-Verlag, New York, 1991."},{"key":"21_CR26","unstructured":"S. Mannor and R. Meir. Weak learners and improved convergence rate in boosting. In Advances in Neural Information Processing Systems 13: Proc. NIPS\u20192000, 2001."},{"key":"21_CR27","unstructured":"S. Mannor, R. Meir, and S. Mendelson. On the consistency of boosting algorithms. Manuscript, June 2001."},{"key":"21_CR28","first-page":"221","volume-title":"Advances in Large Margin Classifiers","author":"L. Mason","year":"1999","unstructured":"L. Mason, J. Baxter, P. L. Bartlett, and M. Frean. Functional gradient techniques for combining hypotheses. In A. J. Smola, P. L. Bartlett, B. Sch\u00f6lkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 221\u2013247. MIT Press, Cambridge, MA, 1999."},{"issue":"2","key":"21_CR29","first-page":"197","volume":"5","author":"R. E. Schapire","year":"1990","unstructured":"R. E. Schapire. The strength of weak learnability. Machine Learning, 5(2):197\u2013227, 1990.","journal-title":"Machine Learning"},{"issue":"5","key":"21_CR30","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R. E. Schapire","year":"1998","unstructured":"R. E. Schapire, Y. Freund, P. Bartlett, and W. S. Lee. Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statistics, 26(5):1651\u20131686, October 1998.","journal-title":"The Annals of Statistics"},{"key":"21_CR31","unstructured":"T. Zhang Statistical Behavior and Consistency of Classification Methods based on Convex Risk Minimization. Manuscript, 2001."}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45435-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T18:02:13Z","timestamp":1550340133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45435-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438366","9783540454359"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-45435-7_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}