Active learning to support the generation of meta-examples

4Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Meta-Learning has been used to select algorithms based on the features of the problems being tackled. Each training example in this context, i.e. each meta-example, stores the features of a given problem and the performance information obtained by the candidate algorithms in the problem. The construction of a set of meta-examples may be costly, since the algorithms performance is usually defined through an empirical evaluation on the problem at hand. In this context, we proposed the use of Active Learning to select only the relevant problems for metaexample generation. Hence, the need for empirical evaluations of the candidate algorithms is reduced. Experiments were performed using the classification uncertainty of the k-NN algorithm as the criteria for active selection of problems. A significant gain in performance was yielded by using the Active Learning method. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Prudêncio, R., & Ludermir, T. (2007). Active learning to support the generation of meta-examples. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4668 LNCS, pp. 817–826). Springer Verlag. https://doi.org/10.1007/978-3-540-74690-4_83

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free