【摘要】 本文提出针对已知核的决策表的增量求核算法。根据基数排序算法和已知核不参与计算POSC(D)与POSC-{ci}(D)之间的差值来判断ci∈C(i=1,2,…,s)是否是核属性。如果差值大于0,则ci∈C(i=1,2,…,s)是核属性,否则不是。此算法的时间复杂度为O(|C||U|)。更多还原

【Abstract】 In this paper, an algorithm has been proposed to computing the core of decision-making tables with known cores. Based on quick sorting algorithm and the known cores without involved in computing the new combined decision-making table ,and computing the difference between POSC(D) and POSC-{ci}(D),and if the difference above zero, the attribute ci∈C(i=1,2, … ,s) is the core attribute, or it is not. The time-complexity of this algorithm is O(|C||U|).更多还原