| dc.contributor.author | Wilson, Garnett Carl. | en_US |
| dc.date.accessioned | 2014-10-21T12:38:06Z | |
| dc.date.available | 2007 | |
| dc.date.issued | 2007 | en_US |
| dc.identifier.other | AAINR27171 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10222/54875 | |
| dc.description | Developmental Genetic Programming (DGP) algorithms explicitly enable the search space for a problem to be divided into genotypes and corresponding phenotypes. The two search spaces are often connected with a genotype-phenotype mapping (GPM) intended to model the biological genetic code, where current implementations of this concept involve evolution of the mappings along with evolution of the genotype solutions. This work presents the Probabilistic Adaptive Mapping DGP (PAM DGP) algorithm, a new developmental implementation that provides research contributions in the areas of GPMs and coevolution. The algorithm component of PAM DGP is demonstrated to overcome coevolutionary performance problems as identified and empirically benchmarked against the latest competing Adaptive Mapping algorithm with both algorithms using the same (non-redundant) mapping encoding process. Having established that PAM DGP provides a superior algorithmic framework given equivalent mapping and genotype structures for the individuals, a new adaptive redundant mapping is incorporated into PAM DGP for further performance enhancement and closer adherence to developmental modeling of the biological code. PAM DGP with two mapping types is then compared to the competing Adaptive Mapping algorithm and Traditional GP with respect to three regression benchmarks. PAM DGP using redundant mappings is then applied to two medical classification domains, where PAM DGP with redundant encodings is found to provide better classifier performance than the alternative algorithms. PAM DGP with redundant mappings is also given the task of learning three sequences of increasing recursion order given a function set consisting of general (not implicitly recursive) machine-language instructions; where it is found to more efficiently learn second and third order recursive Fibonacci functions than the related developmental systems and Traditional GP. PAM DGP using redundant encoding is also demonstrated to produce the semantically highest quality solutions for all three recursive functions considered (Factorial, second and third order Fibonacci). PAM DGP is shown for regression, medical classification, and recursive problems to have produced its solutions by evolving redundant mappings to emphasize appropriate members within relevant subsets of the problem's original function set. | en_US |
| dc.description | Keywords. developmental genetic programming, genetic code, cooperative coevolution, genotype-phenotype mapping, redundant representation, neutrality, recursion | en_US |
| dc.description | Thesis (Ph.D.)--Dalhousie University (Canada), 2007. | en_US |
| dc.language | eng | en_US |
| dc.publisher | Dalhousie University | en_US |
| dc.publisher | | en_US |
| dc.subject | Biology, Bioinformatics. | en_US |
| dc.title | Probabilistic adaptive mapping developmental genetic programming. | en_US |
| dc.type | text | en_US |
| dc.contributor.degree | Ph.D. | en_US |
