新的可分辨矩阵及其约简方法  

New discernibility matrix and attribute reduction method

作　　者：葛浩[1] 李龙澍[2] 杨传健[3] 

机构地区：[1]滁州学院电子信息工程系,安徽滁州239012 [2]安徽大学计算机学院,合肥230039 [3]滁州学院计算机系,安徽滁州239012

出　　处：《控制与决策》2010年第12期1891-1895,1900,共6页Control and Decision

基　　金：安徽省自然科学基金项目(090412054);安徽高校省级自然科学基金项目(KJ2010B137);安徽高校省级优秀青年人才基金项目(2010SQRL138);滁州学院科学研究项目(2010kj014B)

摘　　要：为了解决因决策表存在不相容性造成求核和属性约简的错误,首先通过增加一个属性列,将原始决策表相容化;然后创建可分辨矩阵,并给出核属性和属性约简的性质,同时证明了由该性质获得的核和属性约简与正区域的核和属性约简是等价的;最后设计属性约简算法及其改进算法,并通过实例验证了该方法的正确性.In order to solve the errors of computing the core and attribute reduction which caused by the incompatibility of decision table,the inconsistent decision tables are converted into consistent decision tables through adding a condition attribute.Then a definition of the discernibility matrix is provided,and the properties of the core and attribute reduction are proposed.It is proved that the core and attribute reduction acquired from the properties are the core and attribute reduction based on positive region.Finally,the general algorithm and its improved algorithm for computing attribute reduction are designed,and the example is used to explain the correctness of the method.

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

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