Advertisement
Published in:
2012 | OriginalPaper | Chapter
Local Search in Parallel Linear Genetic Programming for Multiclass Classification
Authors : Aaron Scoble, Mark Johnston, Mengjie Zhang
Published in: AI 2012: Advances in Artificial Intelligence
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Parallel Linear Genetic Programming (PLGP) is an architecture that addresses instruction dependencies in Linear Genetic Programming (LGP). The Co-operative Coevolution (CC) methodology has previously been applied to PLGP but implementations have not been able to improve performance over vanilla PLGP. In this paper we present Hill Climbing Parallel Linear Genetic Programming (HC-PLGP) which uses a local search to discover effective combinations (blueprints) of partial solutions that are evolved in subpopulations. By introducing a new caching technique we can efficiently search over the subpopulations, and our improved fitness function combined with normalisation and blueprint elitism address some of the weaknesses of the previous approaches. Hill Climbing Parallel Linear Genetic Programming (HC-PLGP) is compared to three PLGP architectures over six datasets, and significantly outperforms them on two datasets, is comparable on three, and is slightly worse on one dataset.