首页 | 本学科首页   官方微博 | 高级检索  
     

基于粗集可辨识矩阵的属性约简算法
引用本文:范敏,刘文奇,朱兴东.基于粗集可辨识矩阵的属性约简算法[J].计算机工程与应用,2004,40(13):79-80,130.
作者姓名:范敏  刘文奇  朱兴东
作者单位:昆明理工大学系统理论与应用数学系,昆明,650093
摘    要:论文主要对RoughSet理论中的属性约简问题进行了研究。从Skowron可辨识矩阵出发,通过对属性重要性及属性间依赖性的讨论,利用条件熵构造了一种一致数据属性约简的启发式算法;通过实例和UCI数据库证明了该算法的有效性;并对文献犤4犦中的错误进行了修正。

关 键 词:RoughSet理论  属性约简  可辨识矩阵  一致数据  条件熵  启发式算法
文章编号:1002-8331-(2004)13-0079-02

An Approach for Attribute Reduction Based on Discernibility Matrix of Rough Set
Fan Min Liu Wengqi,Zhu Xingdong.An Approach for Attribute Reduction Based on Discernibility Matrix of Rough Set[J].Computer Engineering and Applications,2004,40(13):79-80,130.
Authors:Fan Min Liu Wengqi  Zhu Xingdong
Abstract:This paper mainly discusses the attribute reduction in Rough Set theory.Firstly,the paper researches the Skowron discernibility matrix,the significance and relevance of attributes.Meanwhile,we use the conditional entropy to propose a heuristic algorithm for attribute reduction;Then,the paper corrects the mistake in the reference.Finally,the experiment shows that it can get better effect and it also shows the reduction results of UCI database using this algorithm.
Keywords:Rough Set theory  attribute reduction  discernibility matrix  consistent  data  conditional entropy  heuristic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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