CAJ | 학술논문

在差别矩阵的基础上，针对不完备决策表提出了基于差别矩阵的区分对象对集定义，并证明求不完备决策表的核可以转化到求基于差别矩阵的区分对象对集上。在此基础上，提出了一种基于区分对象对的不完备决策表求核算法，该算法的时间复杂度为：max{O(|C|U|Upos|)、O(K|C|U|)}，优于同类算法的时间复杂度；用实例说明了新算法的有效性。
재차별구진적기출상，침대불완비결책표제출료기우차별구진적구분대상대집정의，병증명구불완비결책표적핵가이전화도구기우차별구진적구분대상대집상。재차기출상，제출료일충기우구분대상대적불완비결책표구핵산법，해산법적시간복잡도위：max{O(|C|U|Upos|)、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.