基于冲突的增量式核属性更新算法.pdfVIP

第26 卷 第7 期 控 制 与 决 策 2011 年 7 月 Vol. 26 No. 7 Control and Decision Jul. 2011 文章编号: 1001-0920 (2011) 07-0984-07 基于冲突的增量式核属性更新算法 1a 2 1b 葛 浩 , 李龙澍 , 杨传健 (1. 滁州学院 a. 电子信息工程系，b. 计算机系，安徽滁州239012 ；2. 安徽大学计算机学院，合肥230039) 摘 要: 目前的增量式核属性更新算法大多建立在可分辨矩阵的基础上, 不利于大数据集处理, 而且算法的效率也 不理想. 为了克服上述不足, 在改进的基于冲突域求核算法的基础上, 提出了基于冲突的增量式核属性求解算法. 该 算法不需要创建可分辨矩阵, 当有新对象加入时, 对决策表仅需进行一次遍历便可完成核属性增量更新. 算法的时间 ′ 和空间复杂度分别为(∣ ∣∣ ∣) 和(∣ ∣). 理论分析和实验结果均表明, 所提出的算法是可行且高效的. 关键词: 粗糙集；冲突域；核属性；增量计算 中图分类号: TP181 文献标识码: A Incremental updating algorithm of the computation of core based on the collision 1a 2 1b GE Hao , LI Long-shu , YANG Chuan-jian (1a. Department of Electronic and Information Engineering，1b. Department of Computer Science，Chuzhou University, Chuzhou 239012，China ；2. School of Computer Science，Anhui University ，Hefei 230039 ，China ．Correspondent: GE Hao，E-mail ：togehao@126.com) Abstract ：：：At present, a lot of incremental algorithms of updating the core are based on the distinguishable matrix, which are disadvantageous to the larger database, and the efficiency of algorithms is not ideal. To overcome above shortcomings, on the basis of the improved algorithm for computing the core based on the conflict region, the algorithm of incremental computing core based on the collision is proposed. The algorithm is unnecessary to create the distinguishable matrix and only needs to traverse the decision table one time, when a new object is added into the decision table. The time complexity and space