Abstract:
A constructive induction model using genetic programming is presented. The model evolves new attributes starting from a random population of possible attributes constructed as functions of the original attributes. The model is tested on hard supervised learning problems and its performance is compared with backpropagation and C4.5. The performance of the system on learning incomplete 4-bit parity is reported to be better. 1 INTRODUCTION Constructive induction (CI) is an effort to improve the attribute vector of a learning problem in order to make the problem more easily learned for a particular learning algorithm(see [ 9 ] , [ 11 ] , [ 21 ] ). CI is often used to tackle hard problems for a given learning algorithm L - problems are hard for L if the training set contains all the relevant information for the induction of the target function but this information cannot be extracted by L (see [ 13 ] ). In general, CI is used to deal with problems that are hard for the most used learning ...
Citations
|
5180
|
Genetic Algorithms
– Goldberg
- 1989
|
|
3356
|
C4.5: Programs for Machine Learning
– Quinlan
- 1993
|
|
2573
|
Classification and Regression Trees
– Breiman, Friedman, et al.
- 1984
|
|
2044
|
Learning internal representations by error propagation
– Rumelhart, G, et al.
- 1986
|
|
1942
|
Adaptation in Natural and Artificial Systems
– Holland
- 1975
|
|
193
|
An empirical study of learning speed in back-propagation networks
– Fahlman
- 1988
|
|
177
|
Boolean feature discovery in empirical learning
– Pagallo, Haussler
- 1990
|
|
150
|
The MONK's problems - a performance comparison of different learning algorithm
– Thrun
- 1991
|
|
61
|
Optimizing Neural Networks using Faster, more Accurate Genetic Search
– Whitley
- 1989
|
|
56
|
Learning Hard Concepts Through Constructive Induction: Framework and Rationale
– Rendell, Seshu
- 1993
|
|
53
|
Genetic Programming II
– Koza
- 1994
|
|
33
|
Feature Construction: An Analytic Framework and an Application to Decision Trees
– Matheus
- 1989
|
|
20
|
Genetic Programming:On the Programming of Computers by Means of Natural Selection
– Koza
- 1992
|
|
13
|
Solving the parity problem
– Seshu
- 1989
|
|
8
|
Genes, phenes and the Baldwin effect
– French, Messinger
- 1994
|
|
8
|
Supervised learning of conditional approach: a case study
– Thornton
- 1993
|
|
8
|
Measuring the difficulty of specific learning problems
– Thornton
- 1995
|
|
5
|
When learning guides evolution
– Maynard-Smith
- 1987
|
|
5
|
Hypothesis- driven constructive induction in AQ17: A method and experiments
– Wnek, Michalski
- 1994
|
|
3
|
A hypothesis-driven constructive induction approach to expanding neural networks
– Sazonov, Wnek
- 1994
|
|
2
|
Evolution of learning rules for hard learning problems
– Kuscu
- 1996
|