基于差别矩阵的属性核快速更新算法  

Fast updating algorithm of computation of a core based on discernibility matrix

作　　者：杨明[1] 杨萍[1] 

机构地区：[1]南京师范大学数学与计算机科学学院,南京210097

出　　处：《控制与决策》2007年第4期453-456,共4页Control and Decision

基　　金：国家自然科学基金项目(70371015);江苏省自然科学基金项目(BK2005135);江苏省高校自然科学基金项目(05KJB520066)

摘　　要：核求解是粗糙集理论的重要内容之一,尽管在核求解问题上已有大量的研究成果,但有关核更新算法的报道却不多.有人提出一种在对象增加情况下核的增量式更新算法,但未讨论对象动态删除的情况.对此,提出一种基于差别矩阵的属性核快速更新算法——FUAC.该算法在更新差别矩阵时仅需删除某一行及某一列,或插入某一行,因而可有效提高核的更新效率.理论分析表明,该算法是有效可行的.Computing a core is one of important parts researched in rough set theory. Many algorithms have been proposed for the computation of a core. However, little work has been done in updating of a core. So an incremental updating algorithm of the computation of a core based on discernibility matrix is introduced, which only focuses on the case of inserting and don＇t concern with that of deleting. Therefore, a fast updating algorithm for computing an attributes core based on discernibility matrix is proposed, which only deletes an old row and the corresponding column, or inserts a new row when updating the decernibility matrix. The updating efficiency of a core is improved. Theoretical analysis shows the feasiblity and the effectiveness of the proposed algolithm.

关 键 词：粗糙集 差别矩阵 核 更新 属性约筒 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]