基于标记可辨识矩阵的增量式属性约简算法  

An Incremental Algorithm for Attribute Reduction Based on Labeled Discernibility Matrix

作　　者：尹林子[1] 阳春华[2] 王晓丽[2] 桂卫华[2] 

机构地区：[1]中南大学物理与电子学院,长沙410083 [2]中南大学信息科学与工程学院,长沙410083

出　　处：《自动化学报》2014年第3期397-404,共8页Acta Automatica Sinica

基　　金：国家自然科学基金(61025015;61273159;61321003);国家科技支撑计划(2012BAF03B05)资助~~

摘　　要：针对现有增量式属性约简算法中存在的约简传承性差以及不完备现象,提出基于标记可辨识矩阵的增量式属性约简算法.本文首先定义了标记函数,对样本之间的可辨识性进行分类,并将之引入一个新的可辨识矩阵,在新增样本时,结合标记信息可以快速识别可辨识矩阵元素集的异动,获得强传承性的约简超集,在此基础上,设计与标记可辨识矩阵匹配的必要矩阵,用以快速判断并删除冗余属性,确保约简的完备性.理论分析以及实验测试表明,本算法具有约简传承性强,约简集完备等特点,具有较强的实用性.In order to improve the inheritance rate of reducts and obtain the complete reducts, an incremental algorithm for attribute reduction based on labeled discernibility matrix is proposed. The label function is first defined to classify the discernibility relationships of all object pairs. The labeled discernibility matrix is then proposed to find out the changed elements and compute a supper set of reducts quickly when a new object is added. At the same time, a necessary matrix corresponding to the labeled discernibility matrix is presented. It is used to delete the redundant attributes for a complete reduct. Theoretical analysis and experimental results show that the reducts calculated by the proposed algorithm are complete and have the characteristic of high inheritance rate.

关 键 词：标记可辨识矩阵 必要矩阵 增量式约简 约简传承性 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]