By Topic

A relevancy filter for constructive induction

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
$33 $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

3 Author(s)
N. Lavrac ; Jozef Stefan Inst., Ljubljana Univ., Slovenia ; D. Ganberger ; P. Turney

Some machine-learning algorithms enable the learner to extend its vocabulary with new terms if, for a given a set of training examples, the learner's vocabulary is too restricted to solve the learning task. We propose a filter, called the Reduce algorithm, that selects potentially relevant terms from the set of constructed terms and eliminates terms that are irrelevant for the learning task. Restricting constructive induction (or predicate invention) to relevant terms allows a much larger explored space of constructed terms. The elimination of irrelevant terms is especially well-suited for learners of large time or space complexity, such as genetic algorithms and artificial neural networks. To illustrate our approach to feature construction and irrelevant feature elimination, we applied our proposed relevancy filter to the 20- and 24-train East-West Challenge problems. The experiments show that the performance of a hybrid genetic algorithm, RL-ICET (Relational Learning with ICET), improved significantly when we applied the relevancy filter while pre-processing the data set

Published in:

IEEE Intelligent Systems and their Applications  (Volume:13 ,  Issue: 2 )