1. Home
  2. Material Detail: Consistency of random forests and other averaging classifiers

Material Detail

Consistency of random forests and other averaging classifiers

Consistency of random forests and other averaging classifiers

This video was recorded at Workshop on Sparsity and Inverse Problems in Statistical Theory and Econometrics, Berlin 2008. 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.
Keywords:
videolectures, ocwc, oec
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Presentation
Date Added to MERLOT:
February 10, 2015
Date Modified in MERLOT:
February 10, 2015
Author:
Submitter:
The Open Education Consortium
Primary Audience:
College General Ed, College Lower Division, College Upper Division
Technical Format:
Video
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
No
Creative Commons:
Creative Commons License
This work is licensed under a Attribution-NonCommercial-NoDerivs 3.0 United States

Browse...

Disciplines with similar materials as Consistency of random forests and other averaging classifiers
Other materials like Consistency of random forests and other averaging classifiers

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.