Looseness Controlled Crossover in GP for Object Recognition

Abstract

This paper describes an approach to improving the crossover operator in genetic programming for object recognition particularly object classification problems. In this approach, instead of randomly choosing the crossover points as in the standard crossover operator, we use a measure called looseness to guide the selection of crossover points. Rather than using the genetic beam search only, this approach uses a hybrid beam-hill climbing search scheme in the evolutionary process. This approach is examined and compared with the standard crossover operator and the headless chicken crossover method on a sequence of object classification problems. The results suggest that this approach outperforms both the headless chicken crossover and the standard crossover on all of these problems.