一种基于改进差别矩阵的属性约简增量式更新算法  

An Incremental Updating Algorithm for Attribute Reduction Based on Improved Discernibility Matrix

作　　者：杨明[1] 

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

出　　处：《计算机学报》2007年第5期815-822,共8页Chinese Journal of Computers

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

摘　　要：粗糙集方法提供了一种新的处理不精确、不完全与不相容知识的数学工具.属性约简是粗糙集理论的重要研究内容之一,已有的大多数属性约简算法主要考虑信息系统(或决策表)不变的情况,有关属性约简的增量式更新算法却报道不多.为此,文中提出一种基于改进差别矩阵的属性约简增量式更新算法,主要考虑对象动态增加情况下属性约简的更新问题.该算法可通过快速更新差别矩阵,在动态求解核的基础上,利用原有的属性约简有效地进行属性约简的增量式更新,因而可提高属性约简的更新效率.理论分析表明,该文提出的算法是有效可行的.Rough set theory is a new mathematical tool to deal with imprecise, incomplete and inconsistent data. Attribute reduction is one of important parts researched in rough set theory. Many existing algorithms mainly aim at the case of stationary information system or decision table, very little work has been done in updating of an attribute reduction. Therefore, in this paper, the authors introduce an incremental updating algorithm for attribute reduction 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. After dynamically computing a core, attribute reduction can be effectively updated by utilizing the old attribute reduction. Theoretical analysis shows that the algorithm of this paper is efficient and feasible.

关 键 词：粗糙集 差别矩阵 核 属性约简 增量式更新 

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