Incremental updating knowledge in neighborhood multigranulation rough sets under dynamic granular structures

被引:37
作者
Hu, Chengxiang [1 ,2 ,3 ]
Zhang, Li [1 ,2 ]
Wang, Bangjun [1 ,2 ]
Zhang, Zhao [1 ,2 ]
Li, Fanzhang [1 ,2 ]
机构
[1] Soochow Univ, Sch Comp Sci & Technol, Suzhou 215006, Jiangsu, Peoples R China
[2] Soochow Univ, Joint Int Res Lab Machine Learning & Neuromorph C, Suzhou 215006, Jiangsu, Peoples R China
[3] Chuzhou Univ, Sch Comp & Informat Engn, Chuzhou 239000, Anhui, Peoples R China
关键词
Incremental updating; Knowledge discovery; Neighborhood systems; Multigranulation; Approximations; OPTIMAL SCALE SELECTION; ATTRIBUTE REDUCTION; DECISION SYSTEMS; APPROXIMATIONS; MAINTENANCE; FUSION;
D O I
10.1016/j.knosys.2018.10.010
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Neighborhood Multigranulation Rough Sets (NMGRS), constructed by a family of neighborhood relations, can effectively obtain required knowledge from Neighborhood Information Systems (NIS). In various practical situations, NIS may alter dynamically with time. Incremental learning is an alternative manner for maintaining knowledge by utilizing previous computational results under dynamic data contexts. In dynamic NIS with numerical data, potential useful knowledge, e.g., the positive, boundary and negative regions in NMGRS, needs to be updated for various applications. To address this issue, we present matrix based incremental approaches to update knowledge in NMGRS with the addition or deletion of granular structures. First, a matrix-based representation of neighborhood multigranulation rough approximations is developed. Then, the matrix-based dynamic strategies are proposed to update the positive, boundary, and negative regions in the optimistic and pessimistic NMGRS under the variation of a granular structure. In accordance with the proposed updating strategies, the matrix-based dynamic algorithms are explored for maintaining the positive, boundary and negative regions while adding or deleting granular structures. Finally, comparative experiments are conducted to show that the matrix-based dynamic algorithms are feasible and effective. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:811 / 829
页数:19
相关论文
共 86 条
[1]  
[Anonymous], 2013, Granular Computing: Analysis and Design of Intelligent Systems
[2]  
[Anonymous], P 4 INT S METH INT S
[3]  
[Anonymous], P IEEE INT C SYST MA
[4]   Parallel attribute reduction in dominance-based neighborhood rough set [J].
Chen, Hongmei ;
Li, Tianrui ;
Cai, Yong ;
Luo, Chuan ;
Fujita, Hamido .
INFORMATION SCIENCES, 2016, 373 :351-368
[5]   A Decision-Theoretic Rough Set Approach for Dynamic Data Mining [J].
Chen, Hongmei ;
Li, Tianrui ;
Luo, Chuan ;
Horng, Shi-Jinn ;
Wang, Guoyin .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2015, 23 (06) :1958-1970
[6]   A Rough-Set-Based Incremental Approach for Updating Approximations under Dynamic Maintenance Environments [J].
Chen, Hongmei ;
Li, Tianrui ;
Ruan, Da ;
Lin, Jianhui ;
Hu, Chengxiang .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2013, 25 (02) :274-284
[7]   Maintenance of approximations in incomplete ordered decision systems while attribute values coarsening or refining [J].
Chen, Hongmei ;
Li, Tianrui ;
Ruan, Da .
KNOWLEDGE-BASED SYSTEMS, 2012, 31 :140-161
[8]   Rule induction based on an incremental rough set [J].
Fan, Yu-Neng ;
Tseng, Tzu-Liang ;
Chern, Ching-Chin ;
Huang, Chun-Che .
EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (09) :11439-11450
[9]   Resilience Analysis of Critical Infrastructures: A Cognitive Approach Based on Granular Computing [J].
Fujita, Hamido ;
Gaeta, Angelo ;
Loia, Vincenzo ;
Orciuoli, Francesco .
IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (05) :1835-1848
[10]   Advances in three-way decisions and granular computing [J].
Fujita, Hamido ;
Li, Tianrui ;
Yao, Yiyu .
KNOWLEDGE-BASED SYSTEMS, 2016, 91 :1-3