Abstract
We study the ordered set of rough sets determined by relations which are not necessarily reflexive, symmetric, or transitive. We show that for tolerances and transitive binary relations the set of rough sets is not necessarily even a semilattice. We also prove that the set of rough sets determined by a symmetric and transitive binary relation forms a complete Stone lattice. Furthermore, for the ordered sets of rough sets that are not necessarily lattices we present some possible canonical completions.
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
Cattaneo, G.: Abstract Approximation Spaces for Rough Theories. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery I, pp. 59–98. Physica, Heidelberg (1998)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)
Düntsch, I., Gediga, G.: Approximation Operators in Qualitative Data Analysis. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.) Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol. 2929, pp. 214–230. Springer, Heidelberg (2003)
Gehrke, M., Walker, E.: On the Structure of Rough Sets. Bulletin of the Polish Academy of Sciences, Mathematics 40, 235–245 (1992)
Grätzer, G.: General Lattice Theory, 2nd edn. Birkhäuser, Basel (1998)
Greco, S., Matarazzo, B., Slowinski, R.: Rough Set Approach to Decisions Under Risk. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 160–169. Springer, Heidelberg (2001)
Iwiński, T.B.: Algebraic Approach to Rough Sets. Bulletin of the Polish Academy of Sciences, Mathematics 35, 673–683 (1987)
Järvinen, J.: Approximations and Rough Sets Based on Tolerances. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 182–189. Springer, Heidelberg (2001)
Järvinen, J.: On the Structure of Rough Approximations. Fundamenta Informaticae 50, 135–153 (2002)
Pawlak, Z.: Rough Sets. International Journal of Computer and Information Sciences 5, 341–356 (1982)
Pomykała, J., Pomykała, J.A.: The Stone Algebra of Rough Sets. Bulletin of the Polish Academy of Sciences, Mathematics 36, 495–512 (1988)
Pomykała, J.A.: About Tolerance and Similarity Relations in Information Systems. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 175–182. Springer, Heidelberg (2002)
Skowron, A., Stepaniuk, J.: Tolerance Approximation Spaces. Fundamenta Informaticae 27, 245–253 (1996)
Slowinski, R., Vanderpooten, D.: A Generalized Definition of Rough Approximations Based on Similarity. IEEE Transactions on Knowledge and Data Engineering 12, 331–336 (2000)
Yao, Y.Y., Lin, T.Y.: Generalization of Rough Sets using Modal Logics. Intelligent Automation and Soft Computing. An International Journal 2, 103–120 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Järvinen, J. (2004). The Ordered Set of Rough Sets. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds) Rough Sets and Current Trends in Computing. RSCTC 2004. Lecture Notes in Computer Science(), vol 3066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25929-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-25929-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22117-3
Online ISBN: 978-3-540-25929-9
eBook Packages: Springer Book Archive