Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (24): 115-118.

• 数据库、信号与信息处理 • Previous Articles     Next Articles

Research of attribute reduction algorithm based on common discernibility degree

ZENG Fanzhi1,HUANG Guoshun2,CHEN Guangyi1,WEN Han2   

  1. 1.Department of Computer Sciences,Foshan University,Foshan,Guangdong 528000,China
    2.School of Science,Foshan University,Foshan,Guangdong 528000,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-08-21 Published:2011-08-21

同可区分度属性约简的研究

曾凡智1,黄国顺2,陈广义1,文 翰2   

  1. 1.佛山科学技术学院 计算机系,广东 佛山 528000
    2.佛山科学技术学院 理学院,广东 佛山 528000

Abstract: It is showed that the attribute reduction based on common discernibility degree is different from the one based on conditional information entropy proposed by Wang Guoyin et al.it is proved that the attribute reduction based on common discernibility degree is just an HU’s attribute reduction based on discernibility matrix,which is equivalent to the reduction that is based on the information entropy presented by Liang Jiye et.al.It is pointed out that the core attributes of algebraic and conditional information entropy reductions must be included by the one based on common discernibility degree.

Key words: common discernibility degree, attribute reduction, HU’s attribute reduction

摘要: 通过具体算例指出基于同可区分度属性约简不是王国胤等提出的条件信息熵约简。理论上证明了基于同可区分度属性约简仅是基于差别矩阵的HU属性约简,它是一种基于梁吉业等提出的新条件信息熵属性约简。证明了同可区分度约简协调集一定是代数协调集和信息熵协调集,从而代数约简核属性和信息熵核属性一定是同可区分度约简核属性的子集。

关键词: 同可区分度, 属性约简, HU属性约简