计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (32): 108-110.DOI: 10.3778/j.issn.1002-8331.2009.32.034

• 数据库、信号与信息处理 • 上一篇    下一篇

一种新的信息熵属性约简算法

舒文豪1,徐章艳1,2,杨炳儒2,钱文彬1   

  1. 1.广西师范大学 计算机科学与信息工程学院,广西 桂林 541004
    2.北京科技大学 信息工程学院,北京 100083
  • 收稿日期:2009-06-12 修回日期:2009-07-24 出版日期:2009-11-11 发布日期:2009-11-11
  • 通讯作者: 舒文豪

Novel attribution reduction algorithm of information entropy

SHU Wen-hao1,XU Zhang-yan1,2,YANG Bing-ru2,QIAN Wen-bin1   

  1. 1.School of Computer Science and Information Engineering,Guangxi Normal University,Guilin,Guangxi 541004,China
    2.School of Information Engineering,University of Science and Technology Beijing,Beijing 100083,China
  • Received:2009-06-12 Revised:2009-07-24 Online:2009-11-11 Published:2009-11-11
  • Contact: SHU Wen-hao

摘要: 给出一个区分对象对的属性约简定义,同时证明该属性约简的定义与基于信息熵的属性约简的定义是等价的。为求出区分对象对集,首先给出了一个快速求简化决策表的算法,其时间复杂度为O(|C||U|)。然后在简化决策表的基础上,设计了基于区分对象对集的信息熵属性约简算法,其时间复杂度和空间复杂度分别为O(|C||U|)+O(|C||U/C|2)和O(|U/C|2)+O(|U|),最后用一个实例说明了新算法的高效性。

关键词: 粗糙集, 信息熵, 区分对象对集, 属性约简, 算法复杂度

Abstract: Firstly,the definition of attribution reduction of discernibility object pair set is provided.At the same time,it is proved that the above definition of attribution reduction is equal to the definition of attribution reduction based on information entropy.In order to compute discernibility object pair set,a quick algorithm for simplified decision table is provided,whose time complexity is O(|C||U|).On this condition,an efficient attribution reduction algorithm based on information entropy of discernibility object pair set is designed,whose time complexity and space complexity of the new algorithm are O(|C||U|)+O(|C||U/C|2) and O(|U/C|2)+O(|U|)respectively.Finally,an example is used to illustrate the efficiency of the new algorithm.

Key words: rough set, information entropy, discernibility object pair set, attribution reduction, algorithm complexity

中图分类号: