In rough set theory (RST), and more generally in granular computing on information tables (GRC-IT), a central tool is the Pawlak’s indiscernibility relation between objects of a universe set with respect to a fixed attribute subset. Let us observe that Pawlak’s relation induces in a natural way an equivalence relation ≈ on the attribute power set that identifies two attribute subsets yielding the same indiscernibility partition. We call indistinguishability relation of a given information table I the equivalence relation ≈, that can be considered as a kind of global indiscernibility. In this paper we investigate the mathematical foundations of indistinguishability relation through the introduction of two new structures that are, respectively, a complete lattice and an abstract simplicial complex. We show that these structures can be studied at both a micro granular and a macro granular level and that are naturally related to the core and the reducts of I. We first discuss the role of these structures in GrC-IT by providing some interpretations, then we prove several mathematical results concerning the fundamental properties of such structures.

Micro and Macro Models of Granular Computing induced by the Indiscernibility Relation

Cinzia Bisi;Giampiero Chiaselotti;Tommaso Gentile;Federico Infusino
2017-01-01

Abstract

In rough set theory (RST), and more generally in granular computing on information tables (GRC-IT), a central tool is the Pawlak’s indiscernibility relation between objects of a universe set with respect to a fixed attribute subset. Let us observe that Pawlak’s relation induces in a natural way an equivalence relation ≈ on the attribute power set that identifies two attribute subsets yielding the same indiscernibility partition. We call indistinguishability relation of a given information table I the equivalence relation ≈, that can be considered as a kind of global indiscernibility. In this paper we investigate the mathematical foundations of indistinguishability relation through the introduction of two new structures that are, respectively, a complete lattice and an abstract simplicial complex. We show that these structures can be studied at both a micro granular and a macro granular level and that are naturally related to the core and the reducts of I. We first discuss the role of these structures in GrC-IT by providing some interpretations, then we prove several mathematical results concerning the fundamental properties of such structures.
2017
Closure Systems; Matroids; Granular Computing
File in questo prodotto:
File Dimensione Formato  
MicroMacro.pdf

accesso aperto

Descrizione: Publisher version is available at: https://www.sciencedirect.com/science/article/abs/pii/S0020025517300920; DOI: 10.1016/j.ins.2017.01.023
Tipologia: Documento in Post-print
Licenza: Creative commons
Dimensione 401.14 kB
Formato Adobe PDF
401.14 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/132044
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 27
  • ???jsp.display-item.citation.isi??? 23
social impact