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

一种基于改进差别矩阵的核增量式更新算法
引用本文:杨明.一种基于改进差别矩阵的核增量式更新算法[J].计算机学报,2006,29(3):407-413.
作者姓名:杨明
作者单位:南京师范大学计算机科学系,南京,210097
基金项目:中国科学院资助项目;江苏省高校自然科学基金
摘    要:提出一种基于改进差别矩阵的核增量式更新算法,主要考虑对象动态增加情况下核的更新问题.该算法在更新差别矩阵时仅须插入某一行及某一列,或删除某一行并修改相应的列,因而可有效地提高核的更新效率.理论分析和实验结果表明,该算法是有效可行的.

关 键 词:粗糙集  差别矩阵    增量式更新  属性约简
收稿时间:2004-12-28
修稿时间:2004-12-282005-12-04

An Incremental Updating Algorithm of the Computation of a Core Based on the Improved Discernibility Matrix
YANG Ming.An Incremental Updating Algorithm of the Computation of a Core Based on the Improved Discernibility Matrix[J].Chinese Journal of Computers,2006,29(3):407-413.
Authors:YANG Ming
Affiliation:Department of Computer Science, Nanjing Normal University, Nanjing 210097
Abstract: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.
Keywords:rough set  discernibility matrix  core  incremental updating  attributes reduction
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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