Rough sets based matrix approaches with dynamic attribute variation in set-valued information systems

被引:155
作者
Zhang, Junbo [1 ]
Li, Tianrui [1 ]
Ruan, Da [2 ,3 ]
Liu, Dun [4 ]
机构
[1] SW Jiaotong Univ, Sch Informat Sci & Technol, Chengdu 610031, Peoples R China
[2] CEN SCK, Belgian Nucl Res Ctr, B-2400 Mol, Belgium
[3] Univ Ghent, Dept Appl Math & Comp Sci, B-9000 Ghent, Belgium
[4] SW Jiaotong Univ, Sch Econ & Management, Chengdu 610031, Peoples R China
基金
美国国家科学基金会;
关键词
Rough sets; Knowledge discovery; Matrix; Set-valued information systems; APPROXIMATION; REDUCTION; ACQUISITION; KNOWLEDGE;
D O I
10.1016/j.ijar.2012.01.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Set-valued information systems are generalized models of single-valued information systems. The attribute set in the set-valued information system may evolve over time when new information arrives. Approximations of a concept by rough set theory need updating for knowledge discovery or other related tasks. Based on a matrix representation of rough set approximations, a basic vector H(X) is induced from the relation matrix. Four cut matrices of H(X), denoted by H-[mu,H- nu] (X), H-(mu,H- nu] (X), H-[mu,H- nu) (X) and H-(mu,H- nu) (X), are derived for the approximations, positive, boundary and negative regions intuitively. The variation of the relation matrix is discussed while the system varies over time. The incremental approaches for updating the relation matrix are proposed to update rough set approximations. The algorithms corresponding to the incremental approaches are presented. Extensive experiments on different data sets from UCI and user-defined data sets show that the proposed incremental approaches effectively reduce the computational time in comparison with the non-incremental approach. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码:620 / 635
页数:16
相关论文
共 34 条
[1]  
Blake C. L., 1998, Uci repository of machine learning databases
[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 Dynamic Maintenance Approach for Approximations in Coarsening and Refining Attribute Values [J].
Chen, Hongmei ;
Li, Tianrui ;
Qiao, Shaojie ;
Ruan, Da .
INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2010, 25 (10) :1005-1026
[4]   The incremental method for fast computing the rough fuzzy approximations [J].
Cheng, Yi .
DATA & KNOWLEDGE ENGINEERING, 2011, 70 (01) :84-100
[5]   Relational attribute systems [J].
Düntsch, I ;
Gediga, G ;
Orlowska, E .
INTERNATIONAL JOURNAL OF HUMAN-COMPUTER STUDIES, 2001, 55 (03) :293-309
[6]   Set-valued information systems [J].
Guan, Yan-Yong ;
Wang, Hong-Kai .
INFORMATION SCIENCES, 2006, 176 (17) :2507-2525
[7]   Neighborhood rough set based heterogeneous feature subset selection [J].
Hu, Qinghua ;
Yu, Daren ;
Liu, Jinfu ;
Wu, Congxin .
INFORMATION SCIENCES, 2008, 178 (18) :3577-3594
[8]  
Kolman B., 2003, DISCRETE MATH STRUCT
[9]   Rules in incomplete information systems [J].
Kryszkiewicz, M .
INFORMATION SCIENCES, 1999, 113 (3-4) :271-292
[10]   Rough set approach to incomplete information systems [J].
Kryszkiewicz, M .
INFORMATION SCIENCES, 1998, 112 (1-4) :39-49