Given a graph, we interpret its adjacency matrix as an information table. We study this correspondence in two directions. Firstly, on the side of graphs by applying to it standard techniques from granular computing. In this way, we are able to connect automorphisms on graphs to the so-called indiscernibility relation and a particular hypergraph built from the starting graph to core and reducts. On the other hand, new concepts are introduced on graphs that have an interesting correspondence on information tables. In particular, some new topological interpretations of the graph and the concept of extended core are given.
Chiaselotti, G., Ciucci, D., Gentile, T. (2016). Simple graphs in granular computing. INFORMATION SCIENCES, 340-341, 279-304 [10.1016/j.ins.2015.12.042].
Simple graphs in granular computing
CIUCCI, DAVIDE ELIO
Secondo
;
2016
Abstract
Given a graph, we interpret its adjacency matrix as an information table. We study this correspondence in two directions. Firstly, on the side of graphs by applying to it standard techniques from granular computing. In this way, we are able to connect automorphisms on graphs to the so-called indiscernibility relation and a particular hypergraph built from the starting graph to core and reducts. On the other hand, new concepts are introduced on graphs that have an interesting correspondence on information tables. In particular, some new topological interpretations of the graph and the concept of extended core are given.
| File | Dimensione | Formato | |
|---|---|---|---|
|
SG_GrC3.pdf
accesso aperto
Tipologia di allegato:
Submitted Version (Pre-print)
Dimensione
430.22 kB
Formato
Adobe PDF
|
430.22 kB | Adobe PDF | Visualizza/Apri |
|
2016-INS340.pdf
Solo gestori archivio
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Dimensione
1.9 MB
Formato
Adobe PDF
|
1.9 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.
