Optimization of a subset of features based on fuzzy genetic algorithm

Peiyu Liu, Zhenfang Zhu, Liancheng Xu, Xuezhi Chi
{"title":"Optimization of a subset of features based on fuzzy genetic algorithm","authors":"Peiyu Liu, Zhenfang Zhu, Liancheng Xu, Xuezhi Chi","doi":"10.1109/ITIME.2009.5236209","DOIUrl":null,"url":null,"abstract":"To overcome global situation problem tradition genetic algorithm has very strong robustness in finding the solution, but crossover probability and mutation probability is fixed and invariable, it caused premature convergence and running inefficient to the solution on complicated problem at later evolution process of tradition genetic algorithm. To this problem the paper proposed a new algorithm with varying population size based on lifetimes of the chromosomes to realize population size adjust adaptively and crossover probability adjust adaptively and mutation probability adjust adaptively, which called fuzzy genetic algorithm. Compare to tradition genetic algorithm, experiment results show that the approach proposed is effective in the capability of global optimization and significantly improves the convergence rate.","PeriodicalId":398477,"journal":{"name":"2009 IEEE International Symposium on IT in Medicine & Education","volume":"251 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on IT in Medicine & Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITIME.2009.5236209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To overcome global situation problem tradition genetic algorithm has very strong robustness in finding the solution, but crossover probability and mutation probability is fixed and invariable, it caused premature convergence and running inefficient to the solution on complicated problem at later evolution process of tradition genetic algorithm. To this problem the paper proposed a new algorithm with varying population size based on lifetimes of the chromosomes to realize population size adjust adaptively and crossover probability adjust adaptively and mutation probability adjust adaptively, which called fuzzy genetic algorithm. Compare to tradition genetic algorithm, experiment results show that the approach proposed is effective in the capability of global optimization and significantly improves the convergence rate.
基于模糊遗传算法的特征子集优化
传统遗传算法在求解全局情况问题方面具有很强的鲁棒性,但交叉概率和突变概率是固定不变的,导致传统遗传算法在后期进化过程中对复杂问题的求解存在过早收敛和运行效率低下的问题。针对这一问题,本文提出了一种基于染色体寿命的群体大小变化算法,实现了群体大小的自适应调整、交叉概率的自适应调整和突变概率的自适应调整,称为模糊遗传算法。实验结果表明,与传统遗传算法相比,该方法具有较好的全局寻优能力,显著提高了算法的收敛速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信