Active selection of training instances for a random forest meta-learner
Arthur F. M. Sousa, Ricardo B. C. Prudêncio, Carlos Soares, Teresa B. Ludermir · 2013
Several approaches have been applied to the task of algorithm selection. In this context, Meta-Learning provides an efficient solution by adopting a supervised strategy. Despite its promising results, Meta-Learning requires an adequate number of instances to produce a rich set of meta-examples. Recent approaches to generate synthetic or manipulated datasets have been adopted with success in the context of Meta-Learning. These proposals include the datasetoids approach, a simple data manipulation technique that generates new datasets from existing ones. Although such proposals can actually produce relevant datasets, they can eventually produce redundant, or even irrelevant, problem instances. Active Meta-Learning arises in this context to select only the most informative instances for meta-example generation. In this work, we investigate the Active Meta-Learning combined with datasetoids, focusing on using the Random forest algorithm in meta-learning. Our experiments revealed that it is possible to reduce the computational cost of generating meta-examples and obtain a significant gain in Meta-Learning performance.