基于优势关系区别矩阵的一种增量求核方法

Improvement of dominance discernibility matrix and incremental computation of core

现实中很多数据是增量出现的,就需要对数据进行增量的处理,为此,给出了一种基于优势区分矩阵的增量求核算法,通过修改矩阵的某一行或某一列来增量得到决策表的核。通过实验验证了算法的有效性。

This paper analyzed incremental updating for core computing in a dominance-based rough set model, which extended previous reduct studies in capability of dynamic updating and dominance relation. Then redefined the dominance discernibility matrix and presented an incremental updating algorithm. In this algorithm, when new samples arrived, the proposed solution only involved a few modifications to relevant rows and columns in the dominance discernibility matrix instead of recalculation. Both of theoretical analysis and experimental results show that the algorithm is effective and efficient in dynamic computation.