一个新的二进制可辨识矩阵及其核的计算

New Binary Discernibility Matrix and the Computation of a Core

首先用反例指出文献〔4〕中的利用 R.Felix等人提出的二进制可辨识矩阵来求决策表的相对核的方法是错误的 ,然后给出一个新的二进制可辨识矩阵的定义和求核方法 ,并从理论上证明了方法的正确性 .

First, with a counterexample we point out in this paper an error in reference [4] for calculating the core of a decision table in the context of rough set based on the binary discernibility matrix defined by R.Felix et al. Then, we present a new binary discernibility matrix definition together with a method for the computation of the core and prove the correctness of the method.