Active Sample Selection Based Incremental Algorithm for Attribute Reduction With Rough Sets

被引:84
作者
Yang, Yanyan [1 ]
Chen, Degang [2 ]
Wang, Hui [3 ]
机构
[1] North China Elect Power Univ, Sch Control & Comp Engn, Beijing 102206, Peoples R China
[2] North China Elect Power Univ, Dept Math & Phys, Beijing 102206, Peoples R China
[3] Univ Ulster, Sch Comp & Math, Newtownabbey BT37 0QB, Antrim, North Ireland
关键词
Active sample selection; attribute reduction; incremental learning; rough sets; APPROXIMATIONS; COMBINATION; ENTROPY; SYSTEMS;
D O I
10.1109/TFUZZ.2016.2581186
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Attribute reduction with rough sets is an effective technique for obtaining a compact and informative attribute set from a given dataset. However, traditional algorithms have no explicit provision for handling dynamic datasets where data present themselves in successive samples. Incremental algorithms for attribute reduction with rough sets have been recently introduced to handle dynamic datasets with large samples, though they have high complexity in time and space. To address the time/space complexity issue of the algorithms, this paper presents a novel incremental algorithm for attribute reduction with rough sets based on the adoption of an active sample selection process and an insight into the attribute reduction process. This algorithm first decides whether each incoming sample is useful with respect to the current dataset by the active sample selection process. A useless sample is discarded while a useful sample is selected to update a reduct. At the arrival of a useful sample, the attribute reduction process is then employed to guide how to add and/or delete attributes in the current reduct. The two processes thus constitute the theoretical framework of our algorithm. The proposed algorithm is finally experimentally shown to be efficient in time and space.
引用
收藏
页码:825 / 838
页数:14
相关论文
共 62 条
[1]   Representing Uncertainty With Information Sets [J].
Aggarwal, Manish ;
Hanmandlu, Madasu .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2016, 24 (01) :1-15
[2]  
[Anonymous], 1999, INT J FUZZY SYST
[3]  
[Anonymous], 2005, UCI MACHINE LEARNING
[4]  
[Anonymous], 1992, Intelligent Decision Support. Handbook of Applications and Advances of the Rough Sets Theory, DOI DOI 10.1007/978-94-015-7975-9_21
[5]   Attribute Reduction for Heterogeneous Data Based on the Combination of Classical and Fuzzy Rough Set Models [J].
Chen, Degang ;
Yang, Yanyan .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2014, 22 (05) :1325-1334
[6]   Sample Pair Selection for Attribute Reduction with Rough Set [J].
Chen, Degang ;
Zhao, Suyun ;
Zhang, Lei ;
Yang, Yongping ;
Zhang, Xiao .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2012, 24 (11) :2080-2093
[7]   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
[8]   A Rough Set-Based Method for Updating Decision Rules on Attribute Values' Coarsening and Refining [J].
Chen, Hongmei ;
Li, Tianrui ;
Luo, Chuan ;
Horng, Shi-Jinn ;
Wang, Guoyin .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2014, 26 (12) :2886-2899
[9]   The incremental method for fast computing the rough fuzzy approximations [J].
Cheng, Yi .
DATA & KNOWLEDGE ENGINEERING, 2011, 70 (01) :84-100
[10]   Consistency-based search in feature selection [J].
Dash, M ;
Liu, HA .
ARTIFICIAL INTELLIGENCE, 2003, 151 (1-2) :155-176