{"title":"Niche Gene Expression Programming Based on Clustering Model","authors":"Yishen Lin, Hong Peng","doi":"10.1109/IITA.2007.18","DOIUrl":null,"url":null,"abstract":"A hybrid niching gene expression programming algorithm, which combines the niching method and clustering model, is proposed. Similar to other evolution algorithms, GEP also has the problem of premature convergence. Niching method is critical to keep diversity among the population and to use this diversity as resource for exploratory evolution. K-means clustering algorithm was used to cluster the near individuals and to build the niche. This model can make GEP jump out of the local optimization at a greater probability and find the global optimization. Experimental results on function finding problems show that the algorithm has higher precision and better search ability than the basic GEP.","PeriodicalId":191218,"journal":{"name":"Workshop on Intelligent Information Technology Application (IITA 2007)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Intelligent Information Technology Application (IITA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IITA.2007.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
A hybrid niching gene expression programming algorithm, which combines the niching method and clustering model, is proposed. Similar to other evolution algorithms, GEP also has the problem of premature convergence. Niching method is critical to keep diversity among the population and to use this diversity as resource for exploratory evolution. K-means clustering algorithm was used to cluster the near individuals and to build the niche. This model can make GEP jump out of the local optimization at a greater probability and find the global optimization. Experimental results on function finding problems show that the algorithm has higher precision and better search ability than the basic GEP.