In the present paper we investigate (p, q)-directed complete bipartite graphs K⃗p,q, n-directed paths P⃗n and n-directed cycles C⃗n from the perspective of Granular Computing. For each model, we establish the general form of all possible indiscernibility relations, analyze the classical rough approximation functions of rough set theory and provide a close formula for the global ac- curacy average. Finally, we completely determine the attribute dependency function and the global dependency average for both C⃗n and K⃗p,q.
GRANULAR COMPUTING ON BASIC DIGRAPHS
Chiaselotti G.
;Gentile T.;Infusino F.
2022-01-01
Abstract
In the present paper we investigate (p, q)-directed complete bipartite graphs K⃗p,q, n-directed paths P⃗n and n-directed cycles C⃗n from the perspective of Granular Computing. For each model, we establish the general form of all possible indiscernibility relations, analyze the classical rough approximation functions of rough set theory and provide a close formula for the global ac- curacy average. Finally, we completely determine the attribute dependency function and the global dependency average for both C⃗n and K⃗p,q.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
