首页 | 本学科首页   官方微博 | 高级检索  
     

基于信息系统的区分矩阵增量求核算法
引用本文:张长胜.基于信息系统的区分矩阵增量求核算法[J].计算机工程与应用,2012,48(11):43-46.
作者姓名:张长胜
作者单位:温州大学 物理与电子信息学院,浙江 温州 325035
基金项目:浙江省教育厅科研基金(No.Y200907161)
摘    要:针对动态变化的信息系统及其增量求核算法效率不理想的情况,对信息系统进行了简化,证明了简化的区分矩阵的核与原来区分矩阵的核是一致的,并在此基础上提出了一种基于简化的区分矩阵增量求核算法。当有新对象增加到信息系统时,算法能较好地利用原来信息系统中的有用信息进行增量求核,通过示例说明分析了算法的有效性。

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

Incremental computing core algorithm based on discernibility matrix of information system
ZHANG Changsheng.Incremental computing core algorithm based on discernibility matrix of information system[J].Computer Engineering and Applications,2012,48(11):43-46.
Authors:ZHANG Changsheng
Affiliation:College of Physics & Electronic Information Engineering, Wenzhou University, Wenzhou, Zhejiang 325035, China
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.
Keywords:rough set  discernibility matrix  core  incremental computing  information system
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号