GP classifier problem decomposition using first-price and second-price auctions

Authors:
Peter Lichodzijewski;Malcolm I. Heywood
Affiliations:
Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada;Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada
Venue:
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Year:
2007

Citing 8
Cited 4

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms

Machine Learning
Foundations of genetic programming

Foundations of genetic programming
Recent trends in learning classifier systems research

Advances in evolutionary computing
MOGE: GP classification problem decomposition using multi-objective optimization

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Classifier fitness based on accuracy

Evolutionary Computation
The power of sequential single-item auctions for agent coordination

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Linear Genetic Programming

Linear Genetic Programming

Managing team-based problem solving with symbiotic bid-based genetic programming

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Coevolutionary bid-based genetic programming for problem decomposition in classification

Genetic Programming and Evolvable Machines
A survey on the application of genetic programming to classification

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Symbiosis, complexification and simplicity under GP

Proceedings of the 12th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.