提出一种基于改进差别矩阵的核增量式更新算法,主要考虑对象动态增加情况下核的更新问题.该算法在更新差别矩阵时仅须插入某一行及某一列,或删除某一行并修改相应的列,因而可有效地提高核的更新效率.理论分析和实验结果表明,该算法是有效可行的.
Rough set theory is a new mathematical tool to deal with imprecise, incomplete and inconsistent data. Attributes reduction is one of important parts researched in rough set theory. The core of a decision table is the start point to many existing algorithms of attributes reduction. Many algorithms were proposed for the computation of a core. However, very little work has been done in updating of a core. Therefore, this paper introduces an incremental updating algorithm of the computation of a core based on discernibility matrix in the case of inserting, which only inserts a new row and column, or deletes one row and updates corresponding column when updating the decernibility matrix, so the updating efficiency of a core is remarkably improved. Theoretical analysis and experimental results show that the algorithms of this paper are efficient and effective.