Abstract
In this paper, we focus on the study of covering based rough sets in covering approximation spaces. Firstly, two pairs of covering approximation operators are reviewed, their properties are investigated. Secondly, Based on the covering of the covering approximation space, two new coverings of the universe are induced, by which two new pairs of covering approximation operators are constructed. Furthermore, the properties of these operators are examined. Finally, by a comparison of these approximation operators, some conditions are gained under which some or all of these approximation operators are equivalent.
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
Bonikowski, Z., Bryniariski, E., Skardowska, V.W.: Extension and Intensions in the Rough Set Theory. Information Sciences 107, 149–167 (1998)
Bonikowski, Z.: Algebraic Structures of Rough Sets in Representative Approximation Spaces. Electronic Notes in Theoretical Computer Science 82, 1–12 (2003)
Caspard, N., Monjardet, B.: The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: a Survey. Discrete Applied Mathematics 127, 241–269 (2003)
Li, T.-J., Zhang, W.-X.: Rough Approximations in Formal Contexts. In: Proceedings of the Fourth International Conference on Machine Learning and Cybernetics, Guangzhou, China, pp. 3162–3167 (2005)
Orlowska, E.: Semantics Analysis of Inductive Reasoning. Theoretical Computer Science 3, 81–89 (1986)
Pawlak, Z.: Rough Sets. International Journal of Computer and Information Science 11, 341–356 (1982)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publisher, Boston (1991)
Pomykala, J.A.: Approximation Operations in Approximation Space. Bulletin of the Polish Academy of Sciences: Mathematics 35, 653–662 (1987)
Pomykala, J.A.: On Definability in the Nondeterministic Information System. Bulletin of the Polish Academy of Sciences: Mathematics 36, 193–210 (1988)
Slowinski, R., Vanderpooten, D.: A Generalized Definition of Rough Approximations Based on Similarity. IEEE Transactions on Knowledge and Data Engineering 12(2), 331–336 (2000)
Wu, W.-Z., Zhang, W.-X.: Neighborhood Operator Systems and Appoximations. Infomation Sciences 144, 201–217 (2002)
Yao, Y.Y.: Constructive and Algebraic Methods of the Theory of Rough Sets. Information Sciences 109, 21–47 (1998)
Yao, Y.Y.: Relational Interpretations of Neighborhood Operators and Rough Set Approximation Operators. Information Sciences 111, 239–259 (1998)
Yao, Y.Y.: Rough Sets, Neighborhood Systems, and Granular Computing. In: Meng (ed.) Proceedings of the 1999 IEEE Canadian Conference on Electrical and Computer Engineering, Edmonton, Canada, pp. 1553–1558. IEEE press, Los Alamitos (1999)
Zakowski, W.: Approximations in the Space (U,Π). Demenstratio Mathematica XVI, 761–769 (1983)
Zhang, W.-X., Mi, J.-S.: Incomplete Information System and Its Optimal Selections. Computers and Mathematics with Applications 48, 691–698 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, TJ. (2006). Rough Approximation Operators in Covering Approximation Spaces. In: Greco, S., et al. Rough Sets and Current Trends in Computing. RSCTC 2006. Lecture Notes in Computer Science(), vol 4259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908029_20
Download citation
DOI: https://doi.org/10.1007/11908029_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47693-1
Online ISBN: 978-3-540-49842-1
eBook Packages: Computer ScienceComputer Science (R0)