Abstract: |
Gene Expression Programming (GEP) is a powerful evolutionary method derived from Genetic Programming (GP) for model learning and knowledge discovery. However, when dealing with complex problems, its genotype under Karva notation does not allow hierarchical composition of the solution, which impairs the efficiency of the algorithm. We propose a new representation scheme based on prefix notation that overcomes the original GEP’s drawbacks. The resulted algorithm is called Prefix GEP (P-GEP). The major advantages with P-GEP include the natural hierarchy in forming the solutions and more protective genetic operations for substructure components. An artificial symbolic regression problem and a set of benchmark classification problems from UCI machine learning repository have been tested to demonstrate the applicability of P-GEP. The results show that P-GEP follows a faster fitness convergence curve and the rules generated from P-GEP consistently achieve better average classification accuracy compared with GEP. |
