论文部分内容阅读
传统的二进制可分辨矩阵不适用于不相容决策表,而改进的二进制可分辨矩阵虽然适用于不相容决策表,但需要先进行等价类的计算.为了解决因决策表存在不相容性造成构建二进制可分辨矩阵要计算等价类的问题,提出一种二进制可分辨矩阵修正方法.首先对传统二进制可分辨矩阵进行分析,根据矩阵中各行的取值情况,得到修正论域;然后利用其对矩阵进行局部修正,得新的二进制可分辨矩阵,避免了等价类的计算,并证明了新二进制可分辨矩阵与改进的二进制可分辨矩阵是等价的;其次给出了基于新二进制可分辨矩阵的求核方法,并证明了所求核与基于正区域的核是等价的;最后通过实例证明了此方法的正确性.
Traditional binary discernable matrices are not suitable for the incompatible decision table, while the improved binary discernible matrices, although applicable to the incompatible decision table, need to be calculated first. In order to solve the incompatible decision table In order to solve the problem of computing equivalence classes, we propose a binary deterministic matrix correction method.Firstly, we analyze the traditional binary discernibility matrix and obtain the modified universe of discourse according to the value of each row in the matrix. Then, The new binary discernable matrices are obtained by means of local correction of the matrices, which avoids the computation of equivalence classes and proves that the new binary discernable matrices are equivalent to the improved binary discernable matrices. Secondly, It is proved that the proposed kernel is equivalent to the kernel based on the positive region. Finally, the correctness of this method is proved by an example.