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.
CITATION STYLE
Lang, G., Li, Q., Cai, M., & Xiao, Q. (2014). Incremental approaches to computing approximations of sets in dynamic covering approximation spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8818, pp. 510–521). Springer Verlag. https://doi.org/10.1007/978-3-319-11740-9_47
Mendeley helps you to discover research relevant for your work.