Two bagging algorithms with coupled learners to encourage diversity

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

Abstract

In this paper, we present two ensemble learning algorithms which make use of boostrapping and out-of-bag estimation in an attempt to inherit the robustness of bagging to overfitting. As against bagging, with these algorithms learners have visibility on the other learners and cooperate to get diversity, a characteristic that has proved to be an issue of major concern to ensemble models. Experiments are provided using two regression problems obtained from UCI. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Valle, C., Ñanculef, R., Allende, H., & Moraga, C. (2007). Two bagging algorithms with coupled learners to encourage diversity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4723 LNCS, pp. 130–139). Springer Verlag. https://doi.org/10.1007/978-3-540-74825-0_12

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