Abstract:
In incomplete information system, objects of the tolerance class and maximal consistent block in the attribute reduction algorithm based on discernibility matrix are uncertain. Aiming at the problem, this paper presents a new definition discernibility matrix and its core. And it proves that the core of this discernibility matrix is equivalent to the core based on positive region in incomplete information system. An algorithm of compute core is provided. An example illustrates that the elements of discernibility matrix in this algorithm reduce and the efficiency of computing core is improved.
Key words:
incomplete information system,
discernibility matrix,
core,
attribute reduction,
positive region
摘要: 在不完备信息系统基于差别矩阵的属性约简算法中,相容类和最大相容类中的对象具有不确定性。针对上述问题,提出一种新的差别矩阵及其核的定义,证明在不完备信息系统中该差别矩阵的核与基于正区域的核是一致的。在此基础上给出一个求核算法,通过实例证明,由于减少了差别矩阵中的元素,因此算法的求核效率得到较大提高。
关键词:
不完备信息系统,
差别矩阵,
核,
属性约简,
正区域
CLC Number:
LI Xiao-Yu, XU Zhang-Yan, WANG Wei, YANG Bing-Ru. New Core Computing Algorithm in Incomplete Information System[J]. Computer Engineering, 2011, 37(11): 56-58.
李晓瑜, 徐章艳, 王炜, 杨炳儒. 不完备信息系统中一种新的求核算法[J]. 计算机工程, 2011, 37(11): 56-58.