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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
