1. For first computing IND (C) in the simple binary discernibility matrix, a good algorithm for computing IND (C) is designed, it's time complexity is cut down to O (| C | | U |).
由于在简化的二进制的差别矩阵中,要先求出IND(C),故设计了一个较好的求IND(C)的算法,其复杂度被降低为O(C‖U)。
2. With counterexamples the paper points out errors in present methods based on discernibility matrix for calculating the core of a decision table and points out that the key reason of errors is inconsistency of equivalent classes in.
利用反例指出目前基于区别矩阵计算决策表核属性方法的局限性,并指出根本原因是:U/ind(C)中的等价类的AC不相容性。
3. The definitions of attribute reduction and core attributes are given based on the consistency of equivalent classes in the U/ind (C). A new method of the computation of attribute reduction and core attributes is presented based on the information view of rough sets theory.
给出了基于U/ind(C)中等价类相容性的属性约简定义和核属性定义,并给出了一种新的基于粗糙集信息观的决策表属性约简和核属性计算方法。
4. The definitions of attribute reduction and core attributes are given based on the consistency of equivalent classes in the U / ind (C). A new method of the computation of attribute reduction and core attributes is presented based on the information view of rough sets theory.
给出了基于U/ind(C)中等价类相容性的属性约简定义和核属性定义,并给出了一种新的基于粗糙集信息观的决策表属性约简和核属性计算方法。