A comparison of model aggregation methods for regression

Authors:
Zafer Barutçuoǧlu;Ethem Alpaydin
Affiliations:
Department of Computer Engineering, Boǧaziçi University, Istanbul, Turkey;Department of Computer Engineering, Boǧaziçi University, Istanbul, Turkey
Venue:
ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
Year:
2003

Citing 6
Cited 0

Bagging predictors

Machine Learning
Improving Regressors using Boosting Techniques

ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
A decision-theoretic generalization of on-line learning and an application to boosting

EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory
Leveraging for Regression

COLT '00 Proceedings of the Thirteenth Annual Conference on Computational Learning Theory
Barrier Boosting

COLT '00 Proceedings of the Thirteenth Annual Conference on Computational Learning Theory
Combined 5 × 2 cv F Test for Comparing Supervised Classification Learning Algorithms

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Combining machine learning models is a means of improving overall accuracy.Various algorithms have been proposed to create aggregate models from other models, and two popular examples for classification are Bagging and AdaBoost. In this paper we examine their adaptation to regression, and benchmark them on synthetic and real-world data. Our experiments reveal that different types of AdaBoost algorithms require different complexities of base models. They outperform Bagging at their best, but Bagging achieves a consistent level of success with all base models, providing a robust alternative.