A memetic genetic program for knowledge discovery

Loading...
Thumbnail Image

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

University of Pretoria

Abstract

Local search algorithms have been proved to be effective in refining solutions that have been found by other algorithms. Evolutionary algorithms, in particular global search algorithms, have shown to be successful in producing approximate solutions for optimisation and classification problems in acceptable computation times. A relatively new method, memetic algorithms, uses local search to refine the approximate solutions produced by global search algorithms. This thesis develops such a memetic algorithm. The global search algorithm used as part of the new memetic algorithm is a genetic program that implements the building block hypothesis by building simplistic decision trees representing valid solutions, and gradually increases the complexity of the trees. The specific building block hypothesis implementation is known as the building block approach to genetic programming, BGP. The effectiveness and efficiency of the new memetic algorithm, which combines the BGP algorithm with a local search algorithm, is demonstrated.

Description

Dissertation (MSc)--University of Pretoria, 2006.

Keywords

Global search, Classification problems, Optimisation, Local search, Genetic program, Decision trees, Bgp, Mbgp., Building block hypothesis, Memetic algorithms, Evolutionary algorithms, UCTD

Sustainable Development Goals

Citation

Nel, G 2005, A memetic genetic program for knowledge discovery, MSc dissertation, University of Pretoria, Pretoria, viewed yymmdd < http://hdl.handle.net/2263/25350 >