The Structure of Oppositions in Rough Set Theory and Formal Concept Analysis - Toward a New Bridge between the Two Settings

Autor: Henri Prade, Davide Ciucci, Didier Dubois
Přispěvatelé: Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Università degli Studi di Milano-Bicocca - BICOCCA (ITALY), Institut de Recherche en Informatique de Toulouse - IRIT (Toulouse, France), Dipartimento di Informatica Sistemistica e Comunicazione (DISCo), Università degli Studi di Milano-Bicocca [Milano] (UNIMIB), Argumentation, Décision, Raisonnement, Incertitude et Apprentissage (IRIT-ADRIA), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Beierle, C, Meghini, C, Ciucci, D, Dubois, D, Prade, H
Jazyk: angličtina
Rok vydání: 2014
Předmět:
Zdroj: Lecture Notes in Computer Science ISBN: 9783319049380
FoIKS
Foundations of Information and Knowledge Systems: 8th International Symposium, FoIKS 2014, Bordeaux, France, March 3-7, 2014. Proceedings
8th International Symposium on Foundations of Information and Knowledge Systems (FolKS 2014)
8th International Symposium on Foundations of Information and Knowledge Systems (FolKS 2014), Mar 2014, Bordeaux, France. pp.154-173
Popis: 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. © 2014 Springer International Publishing.
Databáze: OpenAIRE
Externí odkaz: