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

基于分辨矩阵的属性集依赖度计算方法
引用本文:李红婵,朱颢东. 基于分辨矩阵的属性集依赖度计算方法[J]. 计算机工程与应用, 2012, 48(26): 131-133
作者姓名:李红婵  朱颢东
作者单位:郑州轻工业学院 计算机与通信工程学院,郑州 450002
基金项目:河南省基础与前沿技术研究计划项目,郑州轻工业学院博士科研基金
摘    要:在决策表中,为了评价某条件属性的重要性,不但要考虑这个属性(单一属性)相对于决策属性的重要性,还要考虑该条件属性与其他条件属性构成的属性集的重要性。在属性集依赖度比单一属性依赖度更加可信的事实基础上,提出了一个基于分辨矩阵的属性集依赖度计算方法。该方法能够较快地获得分辨矩阵,并直接求出属性集的依赖度,从而大大降低了算法的时间复杂度。实例验证了该方法具有较好的有效性和较低的时间复杂度。

关 键 词:粗糙集  决策表  分辨矩阵  依赖度  

Calculation method on dependency degree of attribute set based on discernable matrix
LI Hongchan , ZHU Haodong. Calculation method on dependency degree of attribute set based on discernable matrix[J]. Computer Engineering and Applications, 2012, 48(26): 131-133
Authors:LI Hongchan    ZHU Haodong
Affiliation:School of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China
Abstract:In decision table,in order to evaluate importance of one condition attribute,the importance of the condition attribute with respect to decision attribute and the importance of the attribute set which is composed of the condition attribute and others attributes must be considered simultaneously.According to the fact that dependency degree of attribute set is more authentic than dependency degree of single attribute,a new calculation method on dependency degree of attribute set is proposed based on discernable matrix.The proposed method can quickly get discernable matrix and directly obtain dependency degree of attributes set,so that time complexity of the proposed method is lower.Examples show the proposed method has better effectiveness and lower time complexity.
Keywords:rough set  decision table  discernable matrix  dependency degree
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号