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.

Bisi, C., Chiaselotti, G., Ciucci, D., Gentile, T., Infusino, F. (2017). Micro and macro models of granular computing induced by the indiscernibility relation. INFORMATION SCIENCES, 388-389, 247-273 [10.1016/j.ins.2017.01.023].

Micro and macro models of granular computing induced by the indiscernibility relation

CIUCCI, DAVIDE ELIO;GENTILE, TOMMASO
Penultimo
;
2017

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.
Articolo in rivista - Articolo scientifico
Granular Computing; Rough sets
English
2017
388-389
247
273
reserved
Bisi, C., Chiaselotti, G., Ciucci, D., Gentile, T., Infusino, F. (2017). Micro and macro models of granular computing induced by the indiscernibility relation. INFORMATION SCIENCES, 388-389, 247-273 [10.1016/j.ins.2017.01.023].
File in questo prodotto:
File Dimensione Formato  
2017-INS388.pdf

Solo gestori archivio

Tipologia di allegato: Publisher’s Version (Version of Record, VoR)
Dimensione 1.02 MB
Formato Adobe PDF
1.02 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

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/10281/152107
Citazioni
  • Scopus 27
  • ???jsp.display-item.citation.isi??? 23
Social impact