Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chen, H.M., Li, T.R., Qiao, S.J., Ruan, D.: A rough set based dynamic maintenance approach for approximations in coarsening and refining attribute values. International Journal of Intelligent Systems 25(10), 1005–1026 (2010)
Chen, H.M., Li, T.R., Ruan, D.: Maintenance of approximations in incomplete ordered decision systems while attribute values coarsening or refining. Knowledge-Based Systems 31, 140–161 (2012)
Li, S.Y., Li, T.R., Liu, D.: Incremental updating approximations in dominance-based rough sets approach under the variation of the attribute set. Knowledge-Based Systems 40, 17–26 (2013)
Luo, C., Li, T.R., Chen, H.M.: Dynamic maintenance of approximations in set-valued ordered decision systems under the attribute generalization. Information Sciences (2013), http://dx.doi.org/10.1016/j.ins.2013.09.035
Luo, C., Li, T.R., Chen, H.M., Liu, D.: Incremental approaches for updating approximations in set-valued ordered information systems. Knowledge-Based Systems 50, 218–233 (2013)
Wang, S.P., Zhu, W., Zhu, Q.H., Min, F.: Characteristic matrix of covering and its application to boolean matrice decomposition and axiomatization, ArXiv: 207.0262v3
Zakowski, W.: Approximations in the space (u, π). Demonstratio Mathematics 16, 761–769 (1983)
Zhang, J.B., Li, T.R., Ruan, D., Liu, D.: Rough sets based matric approaches with dynamic attribute variation in set-valued information systems. International Journal of Approximate Reasoning 53(4), 620–635 (2012)
Zhang, J.B., Li, T.R., Ruan, D., Liu, D.: Neighborhood rough sets for dynamic data mining. International Journal of Intelligent Systems 27(4), 317–342 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Lang, G., Li, Q., Cai, M., Xiao, Q. (2014). Incremental Approaches to Computing Approximations of Sets in Dynamic Covering Approximation Spaces. In: Miao, D., Pedrycz, W., Ślȩzak, D., Peters, G., Hu, Q., Wang, R. (eds) Rough Sets and Knowledge Technology. RSKT 2014. Lecture Notes in Computer Science(), vol 8818. Springer, Cham. https://doi.org/10.1007/978-3-319-11740-9_47
Download citation
DOI: https://doi.org/10.1007/978-3-319-11740-9_47
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11739-3
Online ISBN: 978-3-319-11740-9
eBook Packages: Computer ScienceComputer Science (R0)