In this paper we study the lattice of all indiscernibility partitions induced from attribute subsets of a knowledge representation system (information table in the finite case). This lattice, that we here call granular partition lattice, is a very well studied order structure in granular computing and data base theory and it provides a complete hierarchical classification of the knowledge obtained from all possible choices of attribute subsets. We show that it has a lattice structure also in the infinite case and we provide several isomorphic characterizations for this lattice. We discuss the potentiality of this order structure from both a micro-granular and a macro-granular perspective. Furthermore, the sub-poset of all the indiscernibility closures needed to determine when an arbitrary partition is an indiscernibility one is studied. Finally, we show the monotonic behaviour of the granular partition lattice with respect to entropy of partitions and attribute dependency in decision tables.

Chiaselotti, G., Ciucci, D., Gentile, T., Infusino, F. (2016). The granular partition lattice of an information table. INFORMATION SCIENCES, 373, 57-78 [10.1016/j.ins.2016.08.037].

The granular partition lattice of an information table

CIUCCI, DAVIDE ELIO
;
GENTILE, TOMMASO
Penultimo
;
2016

Abstract

In this paper we study the lattice of all indiscernibility partitions induced from attribute subsets of a knowledge representation system (information table in the finite case). This lattice, that we here call granular partition lattice, is a very well studied order structure in granular computing and data base theory and it provides a complete hierarchical classification of the knowledge obtained from all possible choices of attribute subsets. We show that it has a lattice structure also in the infinite case and we provide several isomorphic characterizations for this lattice. We discuss the potentiality of this order structure from both a micro-granular and a macro-granular perspective. Furthermore, the sub-poset of all the indiscernibility closures needed to determine when an arbitrary partition is an indiscernibility one is studied. Finally, we show the monotonic behaviour of the granular partition lattice with respect to entropy of partitions and attribute dependency in decision tables.
Articolo in rivista - Articolo scientifico
Entropy; Granular computing; Rough sets; Set partition;
Entropy; Granular computing; Rough sets; Set partition;
English
2016
373
57
78
reserved
Chiaselotti, G., Ciucci, D., Gentile, T., Infusino, F. (2016). The granular partition lattice of an information table. INFORMATION SCIENCES, 373, 57-78 [10.1016/j.ins.2016.08.037].
File in questo prodotto:
File Dimensione Formato  
2016-INS373.pdf

Solo gestori archivio

Tipologia di allegato: Publisher’s Version (Version of Record, VoR)
Dimensione 969.94 kB
Formato Adobe PDF
969.94 kB 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/152585
Citazioni
  • Scopus 21
  • ???jsp.display-item.citation.isi??? 19
Social impact