{"title":"使用深度约束交叉控制膨胀","authors":"Geng Li, Xiao-Jun Zeng","doi":"10.1109/UKCI.2010.5625572","DOIUrl":null,"url":null,"abstract":"We develop a simple modification of crossover called depth constraint crossover to control bloating. As the name suggests, depth constraint crossover adds a depth constraint on the selection of crossover point. This method is motivated by the analysis of removal bias bloating theory. In this paper, we quantitatively define removal bias as the depth difference between swapped subtrees in crossover. Experiments show that the removal bias defined can be widely observed in GP problems and it is strongly correlated to the growth of population size. We find that by limiting the maximum depth difference between subtrees swapped in crossover with depth constraint crossover, it is possible to greatly reduce the removal bias and hence effectively control bloating. To analyze the efficiency of depth constraint crossover, we compare the technique with koza-style depth limiting method on four different problem domains. Experiment results show that the new technique are very effective in controlling bloating while still maintaining fitness.","PeriodicalId":403291,"journal":{"name":"2010 UK Workshop on Computational Intelligence (UKCI)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Controlling bloating using depth constraint crossover\",\"authors\":\"Geng Li, Xiao-Jun Zeng\",\"doi\":\"10.1109/UKCI.2010.5625572\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We develop a simple modification of crossover called depth constraint crossover to control bloating. As the name suggests, depth constraint crossover adds a depth constraint on the selection of crossover point. This method is motivated by the analysis of removal bias bloating theory. In this paper, we quantitatively define removal bias as the depth difference between swapped subtrees in crossover. Experiments show that the removal bias defined can be widely observed in GP problems and it is strongly correlated to the growth of population size. We find that by limiting the maximum depth difference between subtrees swapped in crossover with depth constraint crossover, it is possible to greatly reduce the removal bias and hence effectively control bloating. To analyze the efficiency of depth constraint crossover, we compare the technique with koza-style depth limiting method on four different problem domains. Experiment results show that the new technique are very effective in controlling bloating while still maintaining fitness.\",\"PeriodicalId\":403291,\"journal\":{\"name\":\"2010 UK Workshop on Computational Intelligence (UKCI)\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 UK Workshop on Computational Intelligence (UKCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/UKCI.2010.5625572\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 UK Workshop on Computational Intelligence (UKCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UKCI.2010.5625572","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Controlling bloating using depth constraint crossover
We develop a simple modification of crossover called depth constraint crossover to control bloating. As the name suggests, depth constraint crossover adds a depth constraint on the selection of crossover point. This method is motivated by the analysis of removal bias bloating theory. In this paper, we quantitatively define removal bias as the depth difference between swapped subtrees in crossover. Experiments show that the removal bias defined can be widely observed in GP problems and it is strongly correlated to the growth of population size. We find that by limiting the maximum depth difference between subtrees swapped in crossover with depth constraint crossover, it is possible to greatly reduce the removal bias and hence effectively control bloating. To analyze the efficiency of depth constraint crossover, we compare the technique with koza-style depth limiting method on four different problem domains. Experiment results show that the new technique are very effective in controlling bloating while still maintaining fitness.