Can AdaBoost.M1 learn incrementally? A comparison to learn++ under different combination rules

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We had previously introduced Learn++, inspired in part by the ensemble based AdaBoost algorithm, for incrementally learning from new data, including new concept classes, without forgetting what had been previously learned. In this effort, we compare the incremental learning performance of Learn++ and AdaBoost under several combination schemes, including their native, weighted majority voting. We show on several databases that changing AdaBoost's distribution update rule from hypothesis based update to ensemble based update allows significantly more efficient incremental learning ability, regardless of the combination rule used to combine the classifiers. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Mohammed, H. S., Leander, J., Marbach, M., & Polikar, R. (2006). Can AdaBoost.M1 learn incrementally? A comparison to learn++ under different combination rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4131 LNCS-I, pp. 254–263). Springer Verlag. https://doi.org/10.1007/11840817_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free