Dependency and accuracy measures for directed graphs

G. Chiaselotti, T. Gentile, F. Infusino and P.A. Oliverio

Applied Mathematics and Computation, 2018, vol. 320, issue C, 781-794

Abstract: In this paper we use finite directed graphs (digraphs) as mathematical models to study two basic notions widely analyzed in granular computing: the attribute dependency and the approximation accuracy. To be more specific, at first we interpret any digraph as a Boolean information table, next we study the approximation accuracy for three fundamentals digraph families: the directed path, the directed cycle and the transitive tournament. We also introduce a new global average for the attribute dependency in any information table and we determine such number for any directed path. For the transitive tournament we provide a lower bound.

Keywords: Digraphs; Rough set theory; Accuracy measure; Dependency measure; Dependency averages (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317307300
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:320:y:2018:i:c:p:781-794

DOI: 10.1016/j.amc.2017.10.031

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().