Consistency of random forests and other averaging classiﬁers
published: Dec. 18, 2008, recorded: December 2008, views: 7794
Report a problem or upload filesIf 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.
In the last years of his life, Leo Breiman promoted random forests for use in classiﬁcation. He suggested using averaging as a means of obtaining good discrimination rules. The base classiﬁers 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.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !