The views expressed here are those of the individual authors and not necessarily those of the JSM sponsors, their officers, or their staff.
Abstract Details
Activity Number:
|
236
|
Type:
|
Contributed
|
Date/Time:
|
Monday, August 1, 2011 : 2:00 PM to 3:50 PM
|
Sponsor:
|
Section on Statistical Computing
|
Abstract - #301671 |
Title:
|
A Quadratic Programming Algorithm for Reducing the Size and Improving the Performance of an Ensemble Model
|
Author(s):
|
Jie Xu*+ and J. Brian Gray
|
Companies:
|
University of Alabama and University of Alabama
|
Address:
|
ISM Dept, 300 Alston Hall, Tuscaloosa, AL, 35487-0226,
|
Keywords:
|
bagging ;
boosting ;
machine learning ;
predictive modeling ;
random forests
|
Abstract:
|
Ensemble models, such as bagging, random forests, and boosting, have better predictive accuracy than single classifiers. These ensembles typically consist of hundreds of single classifiers, which makes future predictions and model interpretation much more difficult than for single classifiers. According to Breiman (2001), the performance of an ensemble model depends on the strengths of the individual classifiers in the ensemble and the correlations among them. In this article, we propose a new method based on quadratic programming that uses information on the strengths of, and the correlations among, the individual classifiers in the ensemble, to improve or maintain the predictive accuracy of an ensemble while significantly reducing its size.
|
The address information is for the authors that have a + after their name.
Authors who are presenting talks have a * after their name.
Back to the full JSM 2011 program
|
2011 JSM Online Program Home
For information, contact jsm@amstat.org or phone (888) 231-3473.
If you have questions about the Continuing Education program, please contact the Education Department.