Boosting and margin theory

Frontiers of Electrical and Electronic Engineering in China

Volumn 7, Issue 1, 2012, Pages 127-133

  Feng, Jufu ^a   Wang, Liwei ^a   Sugiyama, Masashi ^b   Yang, Cheng ^a   Zhou, Zhi Hua ^c   Zhang, Chicheng ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^c NANJING UNIVERSITY   (China)

Author keywords

boosting; explanation; generalization; margin

Indexed keywords

EID: 84862820587     PISSN: 16733460     EISSN: 16733584     Source Type: Journal    
DOI: 10.1007/s11460-012-0188-9     Document Type: Article

References (17)

1. Freund Y, Schapire R E. Experiments with a new boosting algorithm. In: Proceedings of the 13th International Conference on Machine Learning. 1996.
2. Freund Y, Schapire R E. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 1997, 55(1): 119-139.
3. Breiman L. Arcing classifiers. Annals of Statistics, 1998, 26(3): 801-849.
4. Quinlan J R. Bagging, boosting, and c4.5. In: Proceedings of the 13th International Conference on Artificial Intelligence. 1996.
5. Schapire R E, Freund Y, Bartlett P, Lee W. Boosting the margin: A new explanation for the effectiveness of voting methods. Annals of Statistics, 1998, 26(5): 1651-1686.
6. Breiman L. Prediction games and arcing algorithms. Neural Computation, 1999, 11(7): 1493-1517.
7. Reyzin L, Schapire R E. How boosting the margin can also boost classifier complexity. In: Proceedings of the 23rd International Conference on Machine Learning. 2006.
8. Grove A J, Schuurmans D. Boosting in the limit: Maximizing the margin of learned ensembles. In: Proceedings of the 15th National Conference on Artificial Intelligence. 1998.
9. Rätsch G, Warmuth M. Maximizing the margin with boosting. In: Proceedings of the 15th Annual Conference on Computational Learning Theory. 2002.
10. Mason L, Bartlett P, Golea M. Generalization error of combined classifiers. Journal of Computer and System Sciences, 2002, 65(2): 415-438.
11. Koltchinskii V, Panchenko D. Empirical margin distributions and bounding the generalization error of combined classifiers. Annals of Statistics, 2002, 30(1): 1-50.
12. Koltchinskii V, Panchenko D. Complexities of convex combinations and bounding the generalization error in classification. Annals of Statistics, 2005, 33(4): 1455-1496.
13. Antos A, Kégl B, Linder T, Lugosi G. Data-dependent margin-based generalization bounds for classification. Journal of Machine Learning Research, 2002, 3: 73-98.
14. Langford J. Tutorial on practical prediction theory for classification. Journal of Machine Learning Research, 2005, 6: 273-306.
15. Asuncion A, Newman D J. UCI machine learning repository. 2007, http://www. ics. uci. edu/?mlearn/MLRepository. html.
16. Wang L, Sugiyama M, Yang C, Zhou Z H, Feng J. On the margin explanation of boosting algorithms. In: Proceedings of the 21st Annual Conference on Learning Theory. 2008.
17. Wang L, Sugiyama M, Jing Z, Yang C, Zhou Z H, Feng J. A refined margin analysis for boosting algorithms via equilibrium margin. Journal of Machine Learning Research, 2011, 12: 1185-1213.