广义约简、核与分辨矩阵  

Generalized reduction,core and discernibility matrix

作　　者：周献中[1] 李华雄[1] 

机构地区：[1]南京大学工程管理学院,计算机软件新技术国家重点实验室,南京210093

出　　处：《控制与决策》2010年第10期1507-1512,1518,共7页Control and Decision

基　　金：国家自然科学基金项目(70971062,70571032);计算机软件新技术国家重点实验室(南京大学)项目

摘　　要：针对粗糙集理论中计算决策表核属性时出现的若干问题,讨论并分析了这些问题产生的原因.在此基础上,给出了不同目标下的广义约简定义,提出了必要区分关系和非必要区分关系等概念,由此给出了一般意义下的分辨矩阵定义.根据广义约简的定义,将已有的改进差别矩阵求核方法与早期Skowron等人提出的经典分辨矩阵求核方法作了对比,证明了两种方法完全相同.The problems of previous methods for constructing the core attributes by discernibility matrix are discussed and the causes of the problems are investigated.A generalized definition of reduction is proposed,and the definitions of necessary discernibility relation and unnecessary discernibility relation are presented,by which a generalized discernibility matrix is presented.With the definition of generalized reduction,an improved discernibility matrix for constructing core attributes proposed previously is compared with the the classical discernibility matrix proposed by Skowron,which proves that the two matrix are in fact indiscrimination.

关 键 词：约简 核属性 分辨矩阵 粗糙集 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]