By Topic

On performance of meta-learning templates on different datasets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kordik, P. ; Dept. of Comput. Sci., Czech Tech. Univ. in Prague, Prague, Czech Republic ; Cerny, J.

Meta-learning templates are data-tailored algorithms that produce supervised models. When a template is evolved on a particular dataset, it is supposed to generate good models not only on this data set but also on similar data. In this paper, we will investigate one possible way of measuring the similarity of datasets and whether it can be used to estimate if meta-learning templates produce good models. We performed experiments on several well known data sets from the UCI machine learning repository and analyzed both the similarity of datasets and templates in the space of performance meta-features (landmarking). Our results show that the most universal algorithms (in terms of average performance) for supervised learning are the complex hierarchical templates evolved by our SpecGen approach.

Published in:

Neural Networks (IJCNN), The 2012 International Joint Conference on

Date of Conference:

10-15 June 2012