摘要： 在不完备决策表中对求核算法的研究较少，且时间复杂度都相对较高。为此，根据不完备决策表中差别矩阵及其核的定义，给出条件属性的区分对象对集的定义，并得出其与决策表核属性的关系，从理论上证明求解不完备决策表的核可以转化到求条件属性的区分对象对集上。结合不完备决策表差别矩阵核的性质，提出一种基于区分对象对集的不完备决策表求核算法。实验结果表明，该算法的时间复杂度优于同类算法的时间复杂度。

关键词: 不完备决策表, 差别矩阵, 区分对象对集, 时间复杂度, 粗糙集

Abstract: The research on computing core in incomplete decision table is not much, and some of them usually have high complexity. In view of the above questions, according to the definition of discernibility matrix and the core correspond to discernibility matrix, the definition of discernibility object pair set of condition attribute in incomplete decision table is proposed. Based on the relationship between the discernibility object pair set and the core of decision table, it proves theoretically that computing the core of decision table is equal to computing the discernibility object pair set. Considering the property of the core in incomplete decision table correspond to discernibility matrix, a new algorithm for computing core based on the discernibility object pair set in incompelete decision table is designed. And experimental results show that its time complexity is better than the time complexity of the same kind of algorithms.

Key words: incomplete decision table, discernibility matrix, discernibility object pair set, time complexity, rough set

中图分类号: 

• TP301.6