基于区分对象对的不完备决策表求核  

Computing core based on discernibility object pair set in incomplete decision table

作　　者：曾艳燕[1] 徐章艳[1] 曾玲珍[2] 张姣[1] 宋腊香 

机构地区：[1]广西师范大学计算机科学与信息工程学院,广西桂林541004 [2]江西蓝天学院商学院,南昌330029 [3]鄂州市高级中学,湖北鄂州436000

出　　处：《计算机工程与应用》2013年第19期104-107,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.60963008);广西自然科学基金(No.2011GXNSFA018163)

摘　　要：在差别矩阵的基础上,针对不完备决策表提出了基于差别矩阵的区分对象对集定义,并证明求不完备决策表的核可以转化到求基于差别矩阵的区分对象对集上。在此基础上,提出了一种基于区分对象对的不完备决策表求核算法,该算法的时间复杂度为:max{O(|C||U||U pos|)O(K|C||U|)},优于同类算法的时间复杂度;用实例说明了新算法的有效性。The definition of discernibility object pair set of incomplete decision table, based on discernibility matrix, is defined. And it is proved that computing the core of incomplete decision table is equal to computing the discernibility object pair set of incomplete decision table. Then an algorithm for computing core based on discernibility object pair set of incomplete decision table is proposed. And the time complexity of the new algorithm is max{O（K｜C｜U｜）、O（｜C｜U｜Upos｜）}, which is better than the time complexity of the same kind of algorithms. At last, an example is used to illustrate the efficiency of the new algorithm.

关 键 词：粗糙集 不完备决策表 差别矩阵 区分对象对集 求核 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]