Active Learning to Support the Generation of Meta-examples

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.

• Type: Conference
• Year: 2007
• Where: ICANN
• Authors: Ricardo Bastos Cavalcante Prudêncio, Teresa Bernarda Ludermir
• Keywords: Algorithm, Candidate Algorithms, Empirical Evaluations, ICANN 2007, Neural Networks