基于二进制区分矩阵的增量式属性约简算法  

Incremental Attribute Reduction Algorithm Based on Binary Discernibility Matrix

作　　者：丁棉卫 张腾飞[1] 马福民[2] 

机构地区：[1]南京邮电大学自动化学院,南京210023 [2]南京财经大学信息工程学院,南京210023

出　　处：《计算机工程》2017年第1期201-206,共6页Computer Engineering

基　　金：国家自然科学基金(61105082;61403184);江苏省"青蓝工程"基金(QL2016);南京邮电大学"1311人才计划"项目(NY2013);南京邮电大学科研项目(NY215149)

摘　　要：增量式属性约简算法是动态数据挖掘技术的重要研究内容。为降低区分矩阵的存储空间,结合二进制区分矩阵便于计算以及形象直观的优点,给出一种压缩二进制区分矩阵的方法。将二进制区分矩阵的存储空间从|C|+1列简化成3列。通过动态更新二进制区分矩阵实现增量式求核,并以核为出发点,提出一种的增量式属性约简算法。通过实例计算及仿真实验验证了该算法的有效性。Incremental attribute reduction algorithm is one of the important research contents in the area of dyanmic data mining.To reduce the storage space of binary discernibility matrix,and by combining the advantages of the binary discernibility matrix that it facilitates the calculation and is visual,this paper proposes a method to compress binary matrix.It simplifies the binary discernibility matrix storage space from ｜ C ｜ ＋ 1 column to three columns.Through dynamically updating the binary discernibility matrix to incrementally get core.According to the core,the paper proposes an incremental attribute reduction algorithm based on binary discernibility matrix.Example calculation and experimental simulation prove the effectiveness of the algorithm.

关 键 词：粗糙集 增量式属性约简 二进制区分矩阵 核属性 属性频率 

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