Genetic Programming and Incremental Approaches to Solve Supervised Learning Problems
Abstract:
This paper presents an evolutionary approach and an incremental approach to find learning rules of several supervised learning tasks. In evolutionary approach potential solutions are represented as variable length mathematical (LISP S-) expressions. Thus, it is similar to Genetic Programming (GP) but it employs only a fixed set of non-problem specific functions to solve a variety of problems. The model is tested on three Monks' and parity problems. The results indicate the usefulness of the encoding schema in discovering learning rules for simple supervised learning problems. However, hard learning problems require special attention in terms of their need for larger size codings of the potential solutions and their ability of generalisation over the testing set. In order to find better solutions to these issues, a hill climbing strategy with an incremental coding of potential solutions is used in discovering learning rules for the same problems. It is found that with this strategy larg...

