一种基于改进遗传算法的粗糙集属性约简算法  

An Attribute Reduction Algorithm for Rough Set Based on Improving Genetic Algorithm

作　　者：李玉龙[1] 张亚光[1] 毕聪聪 

机构地区：[1]东北石油大学计算机与信息技术学院,大庆163318

出　　处：《计算机与数字工程》2014年第10期1831-1834,共4页Computer & Digital Engineering

摘　　要：为解决传统遗传算法在属性约简时会出现迭代次数多,收敛较慢的问题,论文提出了一种改进的遗传算法。该方法在适应函数上加入属性重要度因子,同时在交叉操作中有选择地保留子代个体,确保算法能够快速收敛。实验结果证明,改进之后的算法在保证属性约简的基础上,能够实现比传统遗传算法更快的迭代和收敛。In order to solve the question of more iterative times and the slower convergence speed of traditional genetic algorithm in attribute reduction ,an improved genetic algorithm is proposed .This algorithm gives sufficiency function added a factor of attribute importance ,and saves the individual which have good adaptation in crossover operation ,to make sure the algorithm can quickly converge .The result shows that this method not only ensures attribution reduction ,but also achieves fast iterative and fast convergence .

关 键 词：遗传算法 粗糙集 属性约简 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]