基于信息系统的区分矩阵增量求核算法  

Incremental computing core algorithm based on discernibility matrix of information system

作　　者：张长胜[1] 

机构地区：[1]温州大学物理与电子信息学院,浙江温州325035

出　　处：《计算机工程与应用》2012年第11期43-46,共4页Computer Engineering and Applications

基　　金：浙江省教育厅科研基金(No.Y200907161)

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

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

分 类 号：TP393[自动化与计算机技术—计算机应用技术]