Incremental updating approximations in confidential dominance relation based rough set

被引：0

作者：

Gou G.-L. ^{[1
,2
,3
]}

Wang G.-Y. ^{[2
]}

机构：

[1] School of Information Science and Technology, Southwest Jiaotong University, Chengdu

[2] Big Data Mining and Applications Center, Chongqing Institute of Green and Intelligent Technology of Chinese Academy of Science, Chongqing

[3] School of Computer Science and Engineering Chongqing University of Technology, Chongqing

来源：

Kongzhi yu Juece/Control and Decision | 2016年 / 31卷 / 06期

关键词：

Approximations; Confidential dominance relation; Incremental updating; Rough sets;

D O I：

10.13195/j.kzyjc.2015.0684

中图分类号：

学科分类号：

摘要：

Confidential dominance relation based rough set is a model of incomplete ordered information processing, computation of approximations of which is a core issue. In real-life applications, the attribute set is dynamically changed. According to the variation of the attribute set, confidential dominance and dominated class are firstly calculated. Then the principles of incremental updating approximations are discussed when some attributes are added or deleted. Furthermore, incremental approaches and algorithms in the confidential dominance relation based on rough set are proposed. Finally, the experiments on UCI datasets developed on Matlab are designed to evaluate the performance of the proposed incremental updating method and non-incremental updating method. The results show that the proposed algorithms are effective and feasible under the variation of the attribute set. © 2016, Editorial Office of Control and Decision. All right reserved.

引用

页码：1027 / 1031

页数：4