TY - GEN
T1 - A rough-set based incremental approach for updating attribute reduction under dynamic incomplete decision systems
AU - Shu, Wenhao
AU - Shen, Hong
PY - 2013
Y1 - 2013
N2 - Efficient attribute reduction in large-scale incomplete decision systems is a challenging problem. The computation of tolerance classes induced by the condition attributes in the incomplete decision system is a key part among all existing attribute reduction algorithms. Moreover, updating attribute reduction for dynamically-increasing decision systems has attracted much attention, in view of that incremental attribute reduction algorithms in a dynamic incomplete decision system have not yet been sufficiently discussed so far. In this paper, we first introduce a simpler way of computing tolerance classes than the classical method. Then we present an incremental attribute reduction algorithm to compute an attribute reduct for a dynamically-increasing incomplete decision system. Compared with the non-incremental algorithms, our incremental attribute reduction algorithm can compute a new attribute reduct in much shorter time. Experiments on four data sets downloaded from UCI show that the feasibility and effectiveness of the proposed incremental algorithm.
AB - Efficient attribute reduction in large-scale incomplete decision systems is a challenging problem. The computation of tolerance classes induced by the condition attributes in the incomplete decision system is a key part among all existing attribute reduction algorithms. Moreover, updating attribute reduction for dynamically-increasing decision systems has attracted much attention, in view of that incremental attribute reduction algorithms in a dynamic incomplete decision system have not yet been sufficiently discussed so far. In this paper, we first introduce a simpler way of computing tolerance classes than the classical method. Then we present an incremental attribute reduction algorithm to compute an attribute reduct for a dynamically-increasing incomplete decision system. Compared with the non-incremental algorithms, our incremental attribute reduction algorithm can compute a new attribute reduct in much shorter time. Experiments on four data sets downloaded from UCI show that the feasibility and effectiveness of the proposed incremental algorithm.
KW - Attribute reduction
KW - Incomplete decision systems
KW - Incremental updating
KW - Positive region
KW - Rough set theory
UR - http://www.scopus.com/inward/record.url?scp=84887849617&partnerID=8YFLogxK
U2 - 10.1109/FUZZ-IEEE.2013.6622431
DO - 10.1109/FUZZ-IEEE.2013.6622431
M3 - Conference contribution
AN - SCOPUS:84887849617
SN - 9781479900220
T3 - IEEE International Conference on Fuzzy Systems
BT - FUZZ-IEEE 2013 - 2013 IEEE International Conference on Fuzzy Systems
T2 - 2013 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2013
Y2 - 7 July 2013 through 10 July 2013
ER -