dc.contributor.author | Aslam, Muhammad Waqar | |
dc.contributor.author | Zhu, Zhechen | |
dc.contributor.author | Nandi, Asoke | |
dc.date.accessioned | 2018-04-27T06:55:50Z | |
dc.date.available | 2018-04-27T06:55:50Z | |
dc.date.issued | 2018 | |
dc.identifier.citation | Aslam, M. W., Zhu, Z., & Nandi, A. (2018). Diverse partner selection with brood recombination in genetic programming. <i>Applied Soft Computing</i>, <i>67</i>, 558-566. <a href="https://doi.org/10.1016/j.asoc.2018.03.035" target="_blank">https://doi.org/10.1016/j.asoc.2018.03.035</a> | |
dc.identifier.other | CONVID_27976319 | |
dc.identifier.other | TUTKAID_77216 | |
dc.identifier.uri | https://jyx.jyu.fi/handle/123456789/57785 | |
dc.description.abstract | The ultimate goal of learning algorithms is to find the best solution from a search space without testing each and every solution available in the search space. During the evolution process new solutions (children) are produced from existing solutions (parents), where new solutions are expected to be better than existing solutions. This paper presents a new parent selection method for the crossover operation in genetic programming. The idea is to promote crossover between two behaviourally (phenotype) diverse parents such that the probability of children being better than their parents increases. The relative phenotype strengths and weaknesses of pairs of parents are exploited to find out if their crossover is beneficial or not (diverse partner selection (DPS)). Based on the probable improvement in children compared to their parents, crossover is either allowed or disallowed. The parents qualifying for crossover through this process are expected to produce much better children and are allowed to produce more children than normal parents through brood recombination (BR). BR helps to explore the search space around diverse parents much more efficiently. Experimental results from different benchmarking problems demonstrate that the proposed method (DPS with BR) improves the performance of genetic programming significantly. | |
dc.language.iso | eng | |
dc.publisher | Elsevier BV | |
dc.relation.ispartofseries | Applied Soft Computing | |
dc.subject.other | genetic programming | |
dc.subject.other | partner selection | |
dc.subject.other | brood recombination | |
dc.title | Diverse partner selection with brood recombination in genetic programming | |
dc.type | article | |
dc.identifier.urn | URN:NBN:fi:jyu-201804031883 | |
dc.contributor.laitos | Informaatioteknologian tiedekunta | fi |
dc.contributor.laitos | Faculty of Information Technology | en |
dc.contributor.oppiaine | Tietotekniikka | fi |
dc.contributor.oppiaine | Mathematical Information Technology | en |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | |
dc.date.updated | 2018-04-03T06:15:04Z | |
dc.type.coar | http://purl.org/coar/resource_type/c_2df8fbb1 | |
dc.description.reviewstatus | peerReviewed | |
dc.format.pagerange | 558-566 | |
dc.relation.issn | 1568-4946 | |
dc.relation.numberinseries | 0 | |
dc.relation.volume | 67 | |
dc.type.version | publishedVersion | |
dc.rights.copyright | © the Authors, 2018. This is an open access article distributed under the terms of the Creative Commons License. | |
dc.rights.accesslevel | openAccess | fi |
dc.subject.yso | koneoppiminen | |
dc.subject.yso | evoluutiolaskenta | |
dc.subject.yso | geneettiset algoritmit | |
dc.subject.yso | monimuotoisuus | |
jyx.subject.uri | http://www.yso.fi/onto/yso/p21846 | |
jyx.subject.uri | http://www.yso.fi/onto/yso/p28071 | |
jyx.subject.uri | http://www.yso.fi/onto/yso/p7987 | |
jyx.subject.uri | http://www.yso.fi/onto/yso/p14084 | |
dc.rights.url | https://creativecommons.org/licenses/by/4.0/ | |
dc.relation.doi | 10.1016/j.asoc.2018.03.035 | |
dc.type.okm | A1 | |