Two Bagging Algorithms with Coupled Learners to Encourage Diversity
author:
Carlos Valle,
Universidad Técnica Federico Santa Maria
Description
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.
You might be experiencing some problems with Your Video player.
| Slides | |
| 0:00 | Two bagging algorithms with coupled learners to encourage diversity |
| 0:16 | Ensemble approach |
| 1:20 | Diversity in ensembles |
| 2:24 | NC algorithm |
| 3:10 | Algorithm (I) |
| 4:36 | Resampling in ensembles |
| 6:03 | Algorithm (II) |
| 6:40 | Training with residuals to compute diversity pt 1 |
| 6:55 | Training with residuals to compute diversity pt 2 |
| 7:51 | Algorithm (III) pt 1 |
| 8:31 | Algorithm (III) pt 2 |
| 8:50 | Experiments pt 1 |
| 10:25 | Experiments pt 2 |
| 10:52 | Concluding Remarks |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




