Dependency and accuracy measures for directed graphs
作者：
Highlights：
• We apply granular computing methods to study digraph models.
• Attribute dependency is examined in digraph context.
• Approximation accuracy is examined in digraph context.
• A new type of global average for attribute dependency is introduced.
• Asymptotic estimates and exact closed formulas are obtained for classical digraph families.
摘要
•We apply granular computing methods to study digraph models.•Attribute dependency is examined in digraph context.•Approximation accuracy is examined in digraph context.•A new type of global average for attribute dependency is introduced.•Asymptotic estimates and exact closed formulas are obtained for classical digraph families.
论文关键词：Digraphs,Rough set theory,Accuracy measure,Dependency measure,Dependency averages
论文评审过程：Received 18 September 2015, Revised 3 June 2017, Accepted 13 October 2017, Available online 5 November 2017, Version of Record 5 November 2017.
论文官网地址：https://doi.org/10.1016/j.amc.2017.10.031
