Abstract: In view of information systems are dynamic and the efficiency of incremental updating algorithm for computing core is not ideal, information system is simplified, it is proved that core based on the simplified discernibility matrix is equivalent to that based on the previous one, on this condition, an incremental computing core algorithm based on simplified discernibility matrix is designed, when a new object is added to information system, the advantage of the new algorithm can effectively make use of the original information to incrementally compute the core. An example is used to illustrate the efficiency of the algorithm.

Key words: rough set, discernibility matrix, core, incremental computing, information system

摘要： 针对动态变化的信息系统及其增量求核算法效率不理想的情况，对信息系统进行了简化，证明了简化的区分矩阵的核与原来区分矩阵的核是一致的，并在此基础上提出了一种基于简化的区分矩阵增量求核算法。当有新对象增加到信息系统时，算法能较好地利用原来信息系统中的有用信息进行增量求核，通过示例说明分析了算法的有效性。

关键词: 粗糙集, 区分矩阵, 核属性, 增量计算, 信息系统