Abstract
This paper proposes a generalized definition of rough set approximations, based on a subsystem of subsets of a universe. The subsystem is not assumed to be closed under set complement, union and intersection. The lower or upper approximation is no longer one set but composed of several sets. As special cases, approximations in formal concept analysis and knowledge spaces are examined. The results provide a better understanding of rough set approximations.
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 Data Mining and Knowledge Discovery, pp. 59–98. Physica, Heidelberg (1998)
Doignon, J.P., Falmagne, J.C.: Knowledge Spaces. Springer, Heidelberg (1999)
Duntsch, I., Gediga, G.: A Note on the Correspondences among Entail Relations, Rough Set Dependencies, and Logical Consequence. Mathematical Psychology 43, 393–401 (2001)
Falmagne, J.C., Koppen, M., Villano, M., Doignon, J.P., Johanessen, L.: Introduction to Knowledge Spaces: How to Test and Search Them. Psychological Review 97, 201–224 (1990)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
Pawlak, Z.: Rough Sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)
Pawlak, Z.: Rough Classification. International Journal of Man-machine Studies 20, 469–483 (1984)
Pawlak, Z., Skowron, A.: Rough Sets: Some Extensions. Information Sciences 177, 28–40 (2007)
Polkowski, L.: Rough Sets: Mathematical Foundations. In: Advances in Soft Computing, Physica, Heidelberg (2002)
Skowron, A.: On Topology in Information System. Bulletin of the Polish Academy of Sciences, Mathematics 36, 477–479 (1988)
Wille, R.: Restructuring Lattice Theory: an Approach Based on Hierarchies of Concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. Reidel, Dordecht-Boston (1982)
Wu, W.Z., Zhang, W.X.: Constructive and Axiomatic Approaches of Fuzzy Approximation Operators. Information Science 159, 233–254 (2004)
Yao, Y.Y.: On Generalizing Pawlak Approximation Operators. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 298–307. Springer, Heidelberg (1998)
Yao, Y.Y.: On Generalizing Rough Set Theory. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 44–51. Springer, Heidelberg (2003)
Yao, Y.Y.: A Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 59–68. Springer, Heidelberg (2004)
Yao, Y.Y.: Concept Lattices in Rough Set Theory. In: Proceedings of 23rd International Meeting of the North American Fuzzy Information Processing Society, pp. 73–78 (2004)
Yao, Y.Y., Chen, Y.H.: Subsystem Based Generalizations of Rough Set Approximations. In: Hacid, M.-S., Murray, N.V., Raś, Z.W., Tsumoto, S. (eds.) ISMIS 2005. LNCS (LNAI), vol. 3488, pp. 210–218. Springer, Heidelberg (2005)
Yao, Y.Y., Chen, Y.H.: Rough Set Approximations in Formal Concept Analysis. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS, vol. 4100, pp. 285–305. Springer, Heidelberg (2006)
Zhu, W.: Topological Approaches to Covering Rough Sets. Information Science 177, 1499–1508 (2007)
Zhu, W., Wang, F.Y.: On Three Types of Covering-based Rough Sets. IEEE Transactions on Knowledge and Data Engineering 19, 1131–1144 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, F., Yao, Y., Miao, D. (2008). Rough Set Approximations in Formal Concept Analysis and Knowledge Spaces. In: An, A., Matwin, S., Raś, Z.W., Ślęzak, D. (eds) Foundations of Intelligent Systems. ISMIS 2008. Lecture Notes in Computer Science(), vol 4994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68123-6_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-68123-6_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68122-9
Online ISBN: 978-3-540-68123-6
eBook Packages: Computer ScienceComputer Science (R0)