Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Building meta-learning algorithms basing on search controlled by machine complexity

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)
Jankowski, N. ; Dept. of Inf., Nicolaus Copernicus Univ., Torun ; Grabczewski, K.

Meta-learning helps us find solutions to computational intelligence (CI) challenges in automated way. Meta-learning algorithm presented in this paper is universal and may be applied to any type of CI problems. The novelty of our proposal lies in complexity controlled testing combined with very useful learning machines generators. The simplest and the best solutions are strongly preferred and are explored earlier. The learning algorithm is augmented by meta-knowledge repository which accumulates information about progress of the search through the space of candidate solutions. The approach facilitates using human experts knowledge to restrict the search space and provide goal definition, gaining meta-knowledge in an automated manner.

Published in:

Neural Networks, 2008. IJCNN 2008. (IEEE World Congress on Computational Intelligence). IEEE International Joint Conference on

Date of Conference:

1-8 June 2008