An incremental approach for attribute reduction based on knowledge granularity

被引:50
作者
Jing, Yunge [1 ,2 ]
Li, Tianrui [1 ]
Luo, Chuan [3 ]
Horng, Shi-Jinn [4 ]
Wang, Guoyin [5 ]
Yu, Zeng [1 ]
机构
[1] Southwest Jiaotong Univ, Sch Informat Sci & Technol, Chengdu 611756, Peoples R China
[2] Yuncheng Univ, Dept Publ Comp Teaching, Yuncheng 044000, Peoples R China
[3] Sichuan Univ, Coll Comp Sci, Chengdu 610065, Peoples R China
[4] Natl Taiwan Univ Sci & Technol, Dept Comp Sci & Informat Engn, Taipei 106, Taiwan
[5] Chongqing Univ Posts & Telecommun, Chongqing Key Lab Computat Intelligence, Chongqing 400065, Peoples R China
基金
美国国家科学基金会;
关键词
Decision system; Incremental learning; Knowledge granularity; Attribute reduction; Rough set theory; DYNAMIC MAINTENANCE; FEATURE-SELECTION; DECISION SYSTEMS; ROUGH; APPROXIMATIONS; RULES;
D O I
10.1016/j.knosys.2016.04.007
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Rough set provides a theoretical framework for classification learning in data mining and knowledge discovery. As an important application of rough set, attribute reduction, also called feature selection, aims to reduce the redundant attributes in a given decision system while preserving a particular classification property, e.g., information entropy and knowledge granularity. In view of the dynamic changes of the object set in a decision system, in this paper, we focus on knowledge granularity-based attribute reduction approach when some objects vary dynamically. We first introduce incremental mechanisms to compute new knowledge granularity. Then, the corresponding incremental algorithms for attribute reduction are developed when some objects are added into and deleted from the decision System. Experiments conducted on different data sets from UCI show that the proposed incremental algorithm can achieve better performance than the non-incremental counterpart and incremental algorithm based on entropy. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:24 / 38
页数:15
相关论文
共 31 条
[1]   Tree structure for efficient data mining using rough sets [J].
Ananthanarayana, VS ;
Murty, MN ;
Subramanian, DK .
PATTERN RECOGNITION LETTERS, 2003, 24 (06) :851-862
[2]   A rough set approach to attribute generalization in data mining [J].
Chan, CC .
INFORMATION SCIENCES, 1998, 107 (1-4) :169-176
[3]   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
[4]  
Chen HM, 2012, J MULT-VALUED LOG S, V18, P577
[5]   The incremental method for fast computing the rough fuzzy approximations [J].
Cheng, Yi .
DATA & KNOWLEDGE ENGINEERING, 2011, 70 (01) :84-100
[6]  
Hu F, 2005, LECT NOTES ARTIF INT, V3641, P185
[7]   Incremental updating approximations in dominance-based rough sets approach under the variation of the attribute set [J].
Li, Shaoyong ;
Li, Tianrui ;
Liu, Dun .
KNOWLEDGE-BASED SYSTEMS, 2013, 40 :17-26
[8]   A rough sets based characteristic relation approach for dynamic attribute generalization in data mining [J].
Li, Tianrui ;
Ruan, Da ;
Geert, Wets ;
Song, Jing ;
Xu, Yang .
KNOWLEDGE-BASED SYSTEMS, 2007, 20 (05) :485-494
[9]   A Group Incremental Approach to Feature Selection Applying Rough Set Technique [J].
Liang, Jiye ;
Wang, Feng ;
Dang, Chuangyin ;
Qian, Yuhua .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2014, 26 (02) :294-308
[10]  
Liu Zong-Tian, 1999, Acta Electronica Sinica, V27, P96