Factorized quasi-Newton methods for nonlinear least squares problems
Mathematical Programming: Series A and B
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Machine Learning
On the Accuracy of Meta-learning for Scalable Data Mining
Journal of Intelligent Information Systems
A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Feature selection for ensembles
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Machine Learning
Diversity versus Quality in Classification Ensembles Based on Feature Selection
ECML '00 Proceedings of the 11th European Conference on Machine Learning
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
An efficient boosting algorithm for combining preferences
The Journal of Machine Learning Research
Ensemble selection from libraries of models
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Getting the Most Out of Ensemble Selection
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
On diversity and accuracy of homogeneous and heterogeneous ensembles
International Journal of Hybrid Intelligent Systems
An empirical evaluation of bagging and boosting
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
TunedIT.org: system for automated evaluation of algorithms in repeatable experiments
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
WI-IAT '10 Proceedings of the 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Search strategies for ensemble feature selection in medical diagnostics
CBMS'03 Proceedings of the 16th IEEE conference on Computer-based medical systems
GA SVM wrapper ensemble for keystroke dynamics authentication
ICB'06 Proceedings of the 2006 international conference on Advances in Biometrics
| Hi-index | 0.00 |
Blending is a well-established technique, commonly used to increase performance of predictive models. Its effectiveness has been confirmed in practice as most of the latest international data-mining contest winners were using some kind of a committee of classifiers to produce their final entry. This paper presents a method of using a genetic algorithm to optimize an ensemble of multiple classification or regression models. An implementation of that method in R system, called Genetic Meta-Blender, was tested during the Australasian Data Mining 2009 Analytic Challenge. A subject of this data mining competition was the methods for combining predictive models. The described approach was awarded with the Grand Champion prize for achieving the best overall result. In this paper, the purpose of the challenge is described and details of the winning approach are given. The results of Genetic Meta-Blender are also discussed and compared to several baseline scores. Additionally, GMB is evaluated on data from a different data mining competition, namely SIAM SDM'11 Contest: Prediction of Biological Properties of Molecules from Chemical Structure.