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

改进的粗集属性约简的启发式算法
引用本文:李珊,肖怀铁,付强.改进的粗集属性约简的启发式算法[J].电光与控制,2006,13(4):46-48.
作者姓名:李珊  肖怀铁  付强
作者单位:国防科学技术大学电子科学与工程学院ATR实验室,长沙,410073
摘    要:提出了一种改进的粗集属性约简的启发式算法。寻找粗集理论的最小属性约简已经被证明是NP难题,一般采用启发式算法来寻找近似最优解,但求得的约简有冗余属性存在的问题。针对一般启发式算法的不完备性,利用粗集理论中的属性依赖度和属性重要度,构造启发式信息,并在算法中增加了消除冗余的二次约简过程,得到一种改进的启发式算法。最后通过实际算例分析,验证了该改进算法的有效性。

关 键 词:粗集理论  属性约简  启发式算法
文章编号:1671-637X(2006)04-0046-03
收稿时间:2005-05-30
修稿时间:2005-05-302005-06-24

Improved heuristic algorithm of attribute reduction based on rough set theory
LI Shan,XIAO Huai-tie,FU Qiang.Improved heuristic algorithm of attribute reduction based on rough set theory[J].Electronics Optics & Control,2006,13(4):46-48.
Authors:LI Shan  XIAO Huai-tie  FU Qiang
Affiliation:ATR Lab. National University of De fence Technology, Changsha 410073, China
Abstract:An improved heuristic algorithm of attribute reduction in rough set theory is presented. It has been proved to be a NP - hard problem to search for the minimum attribute set. People usually adopt heuristic algorithm to fmd approximately optimum solution, but there may exit attribute redundance in the obtained attribute reduction. Considering the non - soundness of current heuristic algorithms, with the help of dependence and significance of attribute in Rough Sets, the heuristic information is constructed, and the process of the second reduction is added to the algorithm in order to eliminate the attribute redundance, then an improved heuristic algorithm is obtained. The correctness and effectiveness of the improved algorithm was demonstrated by an experiment.
Keywords:rough set theory  attribute reduction  heuristic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号