Vaguely quantified fuzzy dominance rough set and its incremental maintenance approximation approaches

被引:0
作者
Lei Yang
Keyun Qin
Binbin Sang
Weihua Xu
Han Yang
机构
[1] Southwest Jiaotong University,School of Mathematics
[2] Chongqing Normal University,College of Computer and Information Science
[3] Southwest University,College of Artificial Intelligence
来源
Soft Computing | 2023年 / 27卷
关键词
Robust fuzzy dominance rough set; Incremental learning; Matrix representation; Dynamic ordered data;
D O I
暂无
中图分类号
学科分类号
摘要
Dominance-based rough set approach (DRSA) is an effective knowledge acquisition tool for ordered data, and to meet the needs of practical applications, the DRSA-based extended models have been widely studied. Nevertheless, the collected data in practical applications are always polluted by noise and most of these extended models are very susceptible to noise. In addition, with the arrival of new attributes and the removal of obsolete attributes, the ordered data have the characteristic of attributes evolving over time (i.e., dynamic ordered data). How to efficiently mining knowledge from dynamic ordered data is a meaningful topic. Motivated by these two issues, we first propose a robust fuzzy dominance rough set model to combat noise interference and then develop incremental update approximation mechanisms based on the proposed model for dynamic ordered data. Firstly, the vaguely quantified fuzzy dominance rough set (VQFDRS) and its matrix representation are introduced. Subsequently, we develop the incremental mechanisms to update the approximations of VQFDRS when multiple attributes are added to or deleted from an ordered data, respectively. Then, on this basis, a static calculation approximations algorithm and two incremental calculation approximations algorithms are designed, respectively. Finally, a series of numerical comparative experiments are performed on six public datasets. Experimental results indicate that the VQFDRS has good robustness, and the incremental algorithms are highly efficient compared with static algorithm under the dynamic data environment.
引用
收藏
页码:867 / 886
页数:19
相关论文
共 214 条
[1]  
Cai M(2019)Incremental approaches to updating reducts under dynamic covering granularity Knowledge-Based Syst 172 130-140
[2]  
Lang G(2014)Credit rating with a monotonicity-constrained support vector machine model Expert Syst Appl 41 7235-7247
[3]  
Fujita H(2012)Maintenance of approximations in incomplete ordered decision systems while attribute values coarsening or refining Knowledge-Based Syst 31 140-161
[4]  
Li Z(2016)Parallel attribute reduction in dominance-based neighborhood rough set Inf Sci 373 351-368
[5]  
Yang T(2016)Dominance-based rough set approach to incomplete ordered information systems Inf Sci 346–347 106-129
[6]  
Chen C-C(1990)Rough fuzzy sets and fuzzy rough sets Int J Gen Syst 17 191-209
[7]  
Li S-T(1999)Rough approximation of a preference relation by dominance relations Eur J Oper Res 117 63-83
[8]  
Chen H(2001)Rough sets theory for multicriteria decision analysis Eur J Oper Res 129 1-47
[9]  
Li T(2020)Incremental updating probabilistic neighborhood three-way regions with time-evolving attributes Int J Approx Reason 120 1-23
[10]  
Ruan D(2017)Dynamic updating approximations in multigranulation rough sets while refining or coarsening attribute values Knowledge-Based Syst 130 62-73