首页 | 官方网站   微博 | 高级检索  
     

基于可行域的遗传约简算法
引用本文:李订芳,章文,李贵斌,牛艳庆.基于可行域的遗传约简算法[J].小型微型计算机系统,2006,27(2):312-315.
作者姓名:李订芳  章文  李贵斌  牛艳庆
作者单位:1. 武汉大学,数学与统计学院,湖北,武汉,430072;武汉大学,计算机学院,湖北,武汉,430072
2. 武汉大学,数学与统计学院,湖北,武汉,430072
基金项目:国家重点基础研究发展计划(973计划);湖北省自然科学基金
摘    要:在已有的遗传属性约简算法的基础上,通过引入约简的可行域概念,提出了基于可行域的遗传约简算法.可行域保持系统的分类能力,缩小了原问题的搜索空间,进而减小了问题的复杂度.适应度函数中引入与互信息相关的惩罚因子保证了算法在可行域中搜索.实验结果表明谊算法既克服了启发性算法的缺陷,较之已有的基于遗传算法的约简算法也有效率改进.

关 键 词:粗糙集  遗传算法  属性约简  互信息  可行域
文章编号:1000-1220(2006)02-0312-04
收稿时间:2005-10-09
修稿时间:2005-10-09

Genetic Reduction Algorithm Based on Feasible Region
LI Ding-fang,ZHANG Wen,LI Gui-bin,NIU Yan-qing.Genetic Reduction Algorithm Based on Feasible Region[J].Mini-micro Systems,2006,27(2):312-315.
Authors:LI Ding-fang  ZHANG Wen  LI Gui-bin  NIU Yan-qing
Affiliation:1.School of Mathematics and Statistic, Wuhan University, Wuhan 430072, China;2.School of Computer Sciences, Wuhan University, Wuhan 430072, China
Abstract:Based on the known genetic attribute reduction algorithms, by introducing the concept of feasible region, this paper proposes a genetic reduction algorithm based on feasible region. Feasible region maintains the ability of classification of the system, and it narrows the search space of original question, then reduces the burden of calculation. The punish factor related with mutual information is introduced in Fitness function, so it can keep algorithm search in the feasible region, experiments results showed the algorithm can overcome the shortcoming of heuristic attribute reduction, compared with the known genetic attribute reduction algorithms it also have the advantage of efficiency.
Keywords:rough set  genetic algorithm  attribute reduction  mutual information  feasible region
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号