Abstract
Rough set theory (RST) and formal concept analysis (FCA) are two formal settings in information management, which have found applications in learning and in data mining. Both rely on a binary relation. FCA starts with a formal context, which is a relation linking a set of objects with their properties. Besides, a rough set is a pair of lower and upper approximations of a set of objects induced by an indistinguishability relation; in the simplest case, this relation expresses that two objects are indistinguishable because their known properties are exactly the same. It has been recently noticed, with different concerns, that any binary relation on a Cartesian product of two possibly equal sets induces a cube of oppositions, which extends the classical Aristotelian square of oppositions structure, and has remarkable properties. Indeed, a relation applied to a given subset gives birth to four subsets, and to their complements, that can be organized into a cube. These four subsets are nothing but the usual image of the subset by the relation, together with similar expressions where the subset and / or the relation are replaced by their complements. The eight subsets corresponding to the vertices of the cube can receive remarkable interpretations, both in the RST and the FCA settings. One facet of the cube corresponds to the core of RST, while basic FCA operators are found on another facet. The proposed approach both provides an extended view of RST and FCA, and suggests a unified view of both of them.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Amgoud, L., Prade, H.: A formal concept view of abstract argumentation. In: van der Gaag, L.C. (ed.) ECSQARU 2013. LNCS (LNAI), vol. 7958, pp. 181–193. Springer, Heidelberg (2013)
Barbut, M., Montjardet, B.: Ordre et classification: Algèbre et combinatoire, Hachette, vol. 2, ch. V (1970)
Béziau, J.-Y.: New light on the square of oppositions and its nameless corner. Logical Investigations 10, 218–233 (2003)
Blanché, R.: Sur l’opposition des concepts. Theoria 19, 89–130 (1953)
Blanché, R.: Structures intellectuelles. Essai sur l’organisation systématique des concepts, Vrin, Paris (1966)
Ciucci, D., Dubois, D., Prade, H.: Oppositions in rough set theory. In: Li, T., Nguyen, H.S., Wang, G., Grzymala-Busse, J., Janicki, R., Hassanien, A.E., Yu, H. (eds.) RSKT 2012. LNCS, vol. 7414, pp. 504–513. Springer, Heidelberg (2012)
Ciucci, D., Dubois, D., Prade, H.: Rough sets, formal concept analysis, and their structures of opposition (extended abstract). In: 4th Rough Set Theory Workshop, October 10, 1 p. Dalhousie University, Halifax (2013)
Dubois, D., Dupin de Saint-Cyr, F., Prade, H.: A possibility-theoretic view of formal concept analysis. Fundamenta Informaticae 75(1-4), 195–213 (2007)
Dubois, D., Prade, H.: Possibility theory: Qualitative and quantitative aspects, Quantified Representation of Uncertainty and Imprecision. In: Gabbay, D.M., Smets, P. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 1, pp. 169–226. Kluwer Acad. Publ (1998)
Dubois, D., Prade, H.: From Blanché’s hexagonal organization of concepts to formal concept analysis and possibility theory. Logica Univers. 6, 149–169 (2012)
Dubois, D., Prade, H.: Possibility theory and formal concept analysis: Characterizing independent sub-contexts. Fuzzy Sets and Systems 196, 4–16 (2012)
Düntsch, I., Gediga, G.: Modal-style operators in qualitative data analysis. In: Proc. IEEE Int. Conf. on Data Mining, pp. 155–162 (2002)
Düntsch, I., Gediga, G.: Approximation operators in qualitative data analysis. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.) TARSKI. LNCS, vol. 2929, pp. 214–230. Springer, Heidelberg (2003)
Düntsch, I., Orlowska, E.: Complementary relations: Reduction of decision rules and informational representability. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 1, pp. 99–106. Physica–Verlag (1998)
Düntsch, I., Orlowska, E.: Beyond modalities: Sufficiency and mixed algebras. In: Orlowska, E., Szalas, A. (eds.) Relational Methods for Computer Science Applications, pp. 277–299. Physica–Verlag, Springer (2001)
Ganter, B., Kuznetsov, S.O.: Scale coarsening as feature selection. In: Medina, R., Obiedkov, S. (eds.) ICFCA 2008. LNCS (LNAI), vol. 4933, pp. 217–228. Springer, Heidelberg (2008)
Ganter, B., Stumme, G., Wille, R. (eds.): Formal Concept Analysis. LNCS (LNAI), vol. 3626. Springer, Heidelberg (2005)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer–Verlag, Berlin (1999)
Ho, T.B.: Acquiring concept approximations in the framework of rough concept analysis. In: Kangassalo, H., Charrel, P.-J. (eds.) Preprint Proc. 7th Eur.-Jap. Conf. Informat. Modelling and Knowledge Bases, Toulouse, May 27-30, pp. 186–195 (1997)
Qi, J.-J., Wei, L., Li, Z.-Z.: A partitional view of concept lattice. In: Ślęzak, D., Wang, G., Szczuka, M.S., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 74–83. Springer, Heidelberg (2005)
Kang, X., Li, D., Wang, S., Qu, K.: Rough set model based on formal concept analysis. Information Sciences 222, 611–625 (2013)
Katzberg, J.D., Ziarko, W.: Variable precision extension of rough sets. Fundamenta Informaticae 27(2,3), 155–168 (1996)
Kent, R.E.: Rough concept analysis. In: Ziarko, W.P. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery (RSKD), pp. 248–255. Springer (1994)
Kent, R.E.: Rough concept analysis. Fundamenta Informaticae 27, 169–181 (1996)
Kuznetsov, S.O., Poelmans, J.: Knowledge representation and processing with formal concept analysis. WIREs Data Mining Knowl. Discov. 3, 200–215 (2013)
Lai, H., Zhang, D.: Concept lattices of fuzzy contexts: Formal concept analysis vs. rough set theory. Int. J. Approx. Reasoning 50(5), 695–707 (2009)
Li, T.-J.: Knowledge reduction in formal contexts based on covering rough sets. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds.) RSKT 2009. LNCS, vol. 5589, pp. 128–135. Springer, Heidelberg (2009)
Orlowska, E.: Introduction: What you always wanted to know about rough sets. In: Orlowska, E. (ed.) Incomplete Information: Rough Set Analysis, pp. 1–20. Springer, Heidelberg (1998)
Pagliani, P., Chakraborty, M.K.: Formal topology and information systems. Trans. on Rough Sets 6, 253–297 (2007)
Parsons, T.: The traditional square of opposition. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy, Fall 2008 edn. (2008)
Pawlak, Z.: Information systems - Theoretical foundations. Information Systems 6, 205–218 (1981)
Pawlak, Z.: Rough sets. Int. J. of Computer and Infor. Sci. 11, 341–356 (1982)
Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer (1991)
Pawlak, Z., Skowron, A.: Rough sets and Boolean reasoning. Information Sciences 177, 41–73 (2007)
Pawlak, Z., Skowron, A.: Rough sets: Some extensions. Information Sciences 177, 28–40 (2007)
Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences 177, 3–27 (2007)
Saquer, J., Deogun, J.S.: Formal rough concept analysis. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 91–99. Springer, Heidelberg (1999)
Skowron, A., Komorowski, J., Pawlak, Z., Polkowski, L.: Rough sets perspective on data and knowledge. In: Handbook of Data Mining and Knowledge Discovery, pp. 134–149. Oxford University Press, Inc. (2002)
Slowinski, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Trans. Knowl. Data Eng. 12(2), 331–336 (2000)
Wasilewski, P.: Concept lattices vs. approximation spaces. In: Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 114–123. Springer, Heidelberg (2005)
Wille, R.: Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival, I., Reidel, D. (eds.) Ordered Sets, pp. 445–470, Dordrecht-Boston (1982)
Wille, R: Boolean concept logic, Conceptual Structures: Logical, Linguistic, and Computational Issues. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, pp. 317–331. Springer, Heidelberg (2000)
Wolski, M.: Galois connections and data analysis. Fund. Infor. 60, 401–415 (2004)
Wolski, M.: Formal concept analysis and rough set theory from the perspective of finite topological approximations. Trans. Rough Sets III 3400, 230–243 (2005)
Yao, Y.Y.: Constructive and algebraic methods of the theory of rough sets. J. of Information Sciences 109, 21–47 (1998)
Yao, 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.: Duality in rough set theory based on the square of opposition. Fundamenta Informaticae 127, 49–64 (2013)
Yao, Y., Chen, Y.: 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)
Yao, Y.Y., Yao, B.X.: Covering based rough set approximations. Information Sciences 200, 91–107 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Ciucci, D., Dubois, D., Prade, H. (2014). The Structure of Oppositions in Rough Set Theory and Formal Concept Analysis - Toward a New Bridge between the Two Settings. In: Beierle, C., Meghini, C. (eds) Foundations of Information and Knowledge Systems. FoIKS 2014. Lecture Notes in Computer Science, vol 8367. Springer, Cham. https://doi.org/10.1007/978-3-319-04939-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-04939-7_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04938-0
Online ISBN: 978-3-319-04939-7
eBook Packages: Computer ScienceComputer Science (R0)