期刊文献+

维度增量决策表的区分矩阵属性约简方法 被引量:5

Dimension Incremental Attribute Reduction Methods Based on Discernibility Matrix
下载PDF
导出
摘要 维度增加是数据动态变化的重要类型之一.为了快速有效地计算这类数据的属性约简,基于区分矩阵提出了两种维度增量决策表的属性约简方法:一种方法是通过新加入属性集的信息更新决策表的区分矩阵,并根据更新后的区分矩阵计算新的约简;另一种方法则是通过更新一种新提出的压缩决策表区分矩阵来计算维度增量后的属性约简.这两种方法都可以获得与非增量约简方法相同的结果,同时还可以显著地降低计算维度增量数据属性约简的耗时,其中基于压缩表区分矩阵计算维度增量数据属性约简的方法更为快速.理论分析和实验结果验证了算法的有效性和高效性. Dimension increase is one of the important types of dynamic data. In order to calculate attribute reduction of this kind of data efficiently, this paper put forward two types of dimension incremental attribute reduction methods based on discernibility matrix:one way is to compute new reduction by modifying a decision table's discernibility matrix;Another way is to compute dimension incre- mental attribute reduction by updating a compacted decision table's discernibility matrix. Both methods can obtain the same results with the non-incremental attribute reduction method. They also significantly reduce time-consuming of computing attribute reduction in the case of the dimension of a decision table increasing, and the method based on a compacted decision table is faster. Theoretical anal- ysis and experimental results verify the effectiveness and efficiency of these two proposed algorithms.
出处 《小型微型计算机系统》 CSCD 北大核心 2017年第2期411-416,共6页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61303008 61202018)资助 山西省自然科学基金项目(2013021018-1)资助
关键词 粗糙集 属性约简 决策表 增量 rough set attribute reduction decision table incremental
  • 相关文献

参考文献2

二级参考文献16

  • 1杨明.一种基于改进差别矩阵的核增量式更新算法[J].计算机学报,2006,29(3):407-413. 被引量:76
  • 2杨明.一种基于改进差别矩阵的属性约简增量式更新算法[J].计算机学报,2007,30(5):815-822. 被引量:112
  • 3Pawlak Z. Rough sets theoretical aspects of reasoning about data [M]. Kluwer Academic Publisher, 1991.
  • 4Jelonek J, Krawiec K, Slowinski R. Rough set reduction of attributes and their domain for neural networks[J]. Computational Intelligence, 1995,11 (2) : 339- 347.
  • 5Guan J W, Bell D A. Rough computational methods for information systems[J].Artificial InteUigences,1998,105(1/2):77-103.
  • 6Woblewski J. Finding minimal reducts using genetic algorithm [R]. Warsaw University of Technology: ICS Research Report, 16/95,1995.
  • 7Hu F,Wang G Y, Huang H, et al. Incremental attribute reduction based on elementary sets[C]//Processing of the 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. Regina, Canada, 2005: 183-193.
  • 8Liang J Y,Xu Z B. The algorithm on knowledge reduction in incomplete information system[J]. International Journal of Uncertainty, Fuzziness and Knowledge-Based System, 2002,10 (1) : 95- 103.
  • 9梁吉业,魏巍,钱宇华.一种基于条件熵的增量核求解方法[J].系统工程理论与实践,2008,28(4):81-89. 被引量:13
  • 10梁吉业,钱宇华.信息系统中的信息粒与熵理论[J].中国科学(E辑),2008,38(12):2048-2065. 被引量:50

共引文献117

同被引文献42

引证文献5

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部