We propose a new methodology to look at the fitness contributions (semantics) of different schemata in Genetic Programming (GP). We hypothesize that the significance of a schema can be evaluated by calculating its fitness contribution to the total fitness of the trees that contain it, and use our methodology to test this hypothesis. It is shown that this method can also be used to identify schemata that are important in terms of both individual runs and individual problems (that is, schema that will be important across many runs on a particular problem). The usefulness of this study to existing schema theories and its effective use in the detection of introns, in the identification of potentially useful modular functions are also discussed in this paper. Categories and Subject Descriptors I.2 [Artificial Intelligence]: Problem Solving, Control Methods, and Search—Genetic Programming General Terms Algorithms, Theory Keywords Tree Semantics, Module Acquisition, Schema Theory
Hammad Majeed, Conor Ryan, R. Muhammad Atif Azad