Incremental Approaches to Computing Approximations of Sets in Dynamic Covering Approximation Spaces
In practical situations,it is of interest to investigate computing approximations of sets as an important step of attribute reduction in dynamic covering information systems.In this paper,we present incremental approaches to computing the type-1 and type-2 characteristic matrices of coverings with the variation of elements.Then we construct the second and sixth lower and upper approximations of sets by using incremental approaches from the view of matrices.We also employ examples to show how to compute approximations of sets by using the incremental and non-incremental approaches in dynamic covering approximation spaces.
Rough sets Covering information system Boolean matrice Characteristic matrice
Guangming Lang Qingguo Li Mingjie Cai Qimei Xiao
School of Mathematics and Computer Science, Changsha University of Science and Technology, Changsha, College of Mathematics and Econometrics,Hunan University, Changsha, Hunan 410082, P.R. China
国际会议
The 9th International Conference on Rough Sets and Knowledge Technology (RSKT 2014)(第九届粗糙集与知识技术国际会议)
上海
英文
510-521
2014-10-24(万方平台首次上网日期,不代表论文的发表时间)