计算机工程与应用Issue(19)：104-107,4.DOI:10.3778/j.issn.1002-8331.1201-0188
基于区分对象对的不完备决策表求核
Computing core based on discernibility object pair set in incomplete decision table
摘要
Abstract
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.关键词
粗糙集/不完备决策表/差别矩阵/区分对象对集/求核Key words
rough set/incomplete decision table/discernibility matrix/discernibility object pair set/compute core分类
信息技术与安全科学引用本文复制引用
曾艳燕,徐章艳,曾玲珍,张姣,宋腊香..基于区分对象对的不完备决策表求核[J].计算机工程与应用,2013,(19):104-107,4.基金项目
国家自然科学基金（No.60963008）；广西自然科学基金（No.2011GXNSFA018163）。 （）
