{"title":"基于根函数选择机制的语义遗传算子","authors":"Claudia N. Sánchez, Mario Graff","doi":"10.1109/ROPEC.2017.8261638","DOIUrl":null,"url":null,"abstract":"Genetic Programming (GP) is an evolutionary algorithm that has received a lot of attention because it has been successfully applied to solving hard real problems. Furthermore, it has been shown that the use of semantic operators can improve GP performance in supervised learning problems. In this work, for parents selection, target semantics and function's properties are used. We propose three new selection techniques: tournament selection based on desired semantics, tournament selection based on the orthogonality and tournament selection for one argument functions. To prove the performance of our proposal, we test our implementation with different classification problems.","PeriodicalId":260469,"journal":{"name":"2017 IEEE International Autumn Meeting on Power, Electronics and Computing (ROPEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Semantic genetic operators based on a selection mechanism tailored for the root function\",\"authors\":\"Claudia N. Sánchez, Mario Graff\",\"doi\":\"10.1109/ROPEC.2017.8261638\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Genetic Programming (GP) is an evolutionary algorithm that has received a lot of attention because it has been successfully applied to solving hard real problems. Furthermore, it has been shown that the use of semantic operators can improve GP performance in supervised learning problems. In this work, for parents selection, target semantics and function's properties are used. We propose three new selection techniques: tournament selection based on desired semantics, tournament selection based on the orthogonality and tournament selection for one argument functions. To prove the performance of our proposal, we test our implementation with different classification problems.\",\"PeriodicalId\":260469,\"journal\":{\"name\":\"2017 IEEE International Autumn Meeting on Power, Electronics and Computing (ROPEC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Autumn Meeting on Power, Electronics and Computing (ROPEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROPEC.2017.8261638\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Autumn Meeting on Power, Electronics and Computing (ROPEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROPEC.2017.8261638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Semantic genetic operators based on a selection mechanism tailored for the root function
Genetic Programming (GP) is an evolutionary algorithm that has received a lot of attention because it has been successfully applied to solving hard real problems. Furthermore, it has been shown that the use of semantic operators can improve GP performance in supervised learning problems. In this work, for parents selection, target semantics and function's properties are used. We propose three new selection techniques: tournament selection based on desired semantics, tournament selection based on the orthogonality and tournament selection for one argument functions. To prove the performance of our proposal, we test our implementation with different classification problems.