基于新的二进制可分辨矩阵求核算法  

Algorithm to compute core based on new binary discernibility matrix

作　　者：杨传健[1] 葛浩[2] 林其斌[2] 

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

出　　处：《计算机工程与设计》2009年第10期2450-2452,2456,共4页Computer Engineering and Design

基　　金：安徽高校省级自然科学研究基金项目(KJ2008B117;KJ2007B237);滁州学院院级自然科学研究基金项目(2007ky044)

摘　　要：信息系统核属性求解是粗集理论中的重要问题之一。为了避免因决策表中存在不相容性,导致所求核的错误,提出一种新的求核方法。首先将不相容决策表信息系统转换为相容决策表信息系统,然后给出新的二进制可分辨矩阵的定义和求核性质,同时证明了由该性质所求得的核与基于正区域的核是一致的,且该方法不仅适用不相容决策表,也适用相容决策表。最后通过实例表明了该方法的正确性。The computing the core of an information system is one of the important content based on rough sets. In order to avoid the incompatibility of decision table, which leads to the error of computing the core, a new method of computing the core is put forward. Firstly, the method converts inconsistent decision tables information system into consistent decision tables information system. And then, a definition of the binary discernibility matrix and correspondence computing core property are provided. It is proved that the core acquired from the property is the core based on positive region. The method is suitable for consistent and inconsistent decision tables. Finally, the examples are used to explain the correctness of the method.

关 键 词：粗糙集 决策表 二进制可分辨矩阵 核属性 正区域 

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