|
Forêts aléatoires et autres règles randomisées| old_uid | 4056 |
|---|
| title | Forêts aléatoires et autres règles randomisées |
|---|
| start_date | 2008/02/11 |
|---|
| schedule | 13h30 |
|---|
| online | no |
|---|
| summary | In the last years of his life, Leo Breiman promoted random forests for use in classification. He suggested using averaging as a means of obtaining good discrimination rules. The base classifiers used for averaging are simple and randomized, often based on random samples from the data. He left a few questions unanswered regarding the consistency of such rules. In this talk, we give a number of theorems that establish the universal consistency of averaging rules. We also show that some popular classifiers, including one suggested by Breiman, are not universally consistent. |
|---|
| responsibles | Stoltz |
|---|
| |
|