计算机工程2017，Vol.43Issue(1)：201-206,6.DOI:10.3969/j.issn.1000-3428.2017.01.035
基于二进制区分矩阵的增量式属性约简算法
Incremental Attribute Reduction Algorithm Based on Binary Discernibility Matrix
摘要
Abstract
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.关键词
粗糙集/增量式属性约简/二进制区分矩阵/核属性/属性频率Key words
rough sets/incremental attribute reduction/binary discernibility matrix/core attribute/attribute frequency分类
信息技术与安全科学引用本文复制引用
丁棉卫,张腾飞,马福民..基于二进制区分矩阵的增量式属性约简算法[J].计算机工程,2017,43(1):201-206,6.基金项目
国家自然科学基金(61105082,61403184) （61105082,61403184）
江苏省“青蓝工程”基金(QL2016) （QL2016）
南京邮电大学“131 1人才计划”项目(NY2013) （NY2013）
南京邮电大学科研项目(NY215149). （NY215149）
