GP Classifier Problem Decomposition Using First-Price and Second-Price Auctions

This work details an auction-based model for problem decomposition in Genetic Programming classification. The approach builds on the population-based methodology of Genetic Programming to evolve individuals that bid high for patterns that they can correctly classify. The model returns a set of individuals that decompose the problem by way of this bidding process and is directly applicable to multi-class domains. An investigation of two auction types emphasizes the effect of auction design on the properties of the resulting solution. The work demonstrates that auctions are an effective mechanism for problem decomposition in classification problems and that Genetic Programming is an effective means of evolving the underlying bidding behaviour.

• Type: Conference
• Year: 2007
• Where: EUROGP
• Authors: Peter Lichodzijewski, Malcolm I. Heywood
• Keywords: EUROGP 2007, Genetic Programming, Genetic Programming Classification, Optimization, Problem Decomposition