The adjacency matrix of a graph is interpreted as a formal context. Then, the counterpart of Formal Concept Analysis (FCA) tools are introduced in graph theory. Moreover, a formal context is seen as a Boolean information table, the structure at the basis of Rough Set Theory (RST). Hence, we also apply RST tools to graphs. The peculiarity of the graph case, put in evidence and studied in the paper, is that both FCA and RST are based on a (different) binary relation between objects.
Chiaselotti, G., Ciucci, D., Gentile, T. (2015). Simple undirected graphs as formal contexts. In Formal Concept Analysis (pp.287-302). Springer Verlag [10.1007/978-3-319-19545-2_18].
Simple undirected graphs as formal contexts
CIUCCI, DAVIDE ELIO
;
2015
Abstract
The adjacency matrix of a graph is interpreted as a formal context. Then, the counterpart of Formal Concept Analysis (FCA) tools are introduced in graph theory. Moreover, a formal context is seen as a Boolean information table, the structure at the basis of Rough Set Theory (RST). Hence, we also apply RST tools to graphs. The peculiarity of the graph case, put in evidence and studied in the paper, is that both FCA and RST are based on a (different) binary relation between objects.
| File | Dimensione | Formato | |
|---|---|---|---|
|
GraphsFCA-final web.pdf
accesso aperto
Descrizione: Articolo, versione post-print
Dimensione
299.28 kB
Formato
Adobe PDF
|
299.28 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
