Quadratic programming algorithms for ensemble models
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 make future predictions and model interpretation much more difficult than for single classifiers. Recent...
Gespeichert in:
Veröffentlicht in: | Wiley interdisciplinary reviews. Computational statistics 2013-01, Vol.5 (1), p.41-47 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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 make future predictions and model interpretation much more difficult than for single classifiers. Recently, research efforts have been directed toward improving ensembles by reducing their size while increasing or maintaining their predictive accuracy. In this article, we review recently proposed methods based on quadratic programming techniques for accomplishing these goals. WIREs Comput Stat 2013, 5:41–47. doi: 10.1002/wics.1237
This article is categorized under:
Statistical Learning and Exploratory Methods of the Data Sciences > Modeling Methods
Algorithms and Computational Methods > Quadratic and Nonlinear Programming |
---|---|
ISSN: | 1939-5108 1939-0068 |
DOI: | 10.1002/wics.1237 |