Rough sets on graphs: New dependency and accuracy measures

DOI10.1142/S1793830918500635zbMath1400.05247OpenAlexW2883305286MaRDI QIDQ4554547

F. Tropeano, F. Infusino, Tommaso Gentile, Giampiero Chiaselotti

Publication date: 14 November 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830918500635

zbMATH Keywords

rough set theoryaccuracy measuredependency measuredependency averages

Mathematics Subject Classification ID

Applications of graph theory (05C90) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (2)

Some classifications of graphs with respect to a set adjacency relation ⋮ Granular computing on basic digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new discrete dynamical system of signed integer partitions
• Intersection properties of maximal directed cuts in digraphs
• New rough approximations for \(n\)-cycles and \(n\)-paths
• An application of rough sets to graph theory
• Rudiments of rough sets
• Rough sets: some extensions
• Rough sets and Boolean reasoning
• Nesting House-designs
• Roughness in Cayley graphs
• Constructive and algebraic methods of the theory of rough sets
• Simple graphs in granular computing
• Dominance order on signed integer partitions
• Parallel discrete dynamical systems on maxterm and minterm Boolean functions
• A matroidal approach to rough set theory
• Pairings and related symmetry notions
• Granular computing on information tables: families of subsets and operators
• The granular partition lattice of an information table
• On periods and equilibria of computational sequential systems
• Parallel dynamical systems over graphs and related topics: a survey
• Four matroidal structures of covering and their relationships with rough sets
• The adjacency matrix of a graph as a data table: a geometric perspective
• Smart case-based indexing in worsted roving process: Combination of rough set and case-based reasoning
• Decision bireducts and decision reducts -- a comparison
• Simplicial complexes and closure systems induced by indistinguishability relations
• Dependency structures for decision tables
• Dependency and accuracy measures for directed graphs
• Parallel dynamical systems over directed dependency graphs
• Rough matroids based on relations
• A natural extension of the Young partition lattice
• Information granulation and rough set approximation
• An Investigation About Rough Set Theory: Some Foundational and Mathematical Aspects
• Relations on Hypergraphs
• On Generalized Decision Functions: Reducts, Networks and Ensembles
• Lattices with Interior and Closure Operators and Abstract Approximation Spaces
• Rough Set Theory and Digraphs
• Transactions on Rough Sets II
• Transactions on Rough Sets I
• Transactions on Rough Sets III
• Mathematical tools for data mining. Set theory, partial orders, combinatorics
• Granular computing. An emerging paradigm

This page was built for publication: Rough sets on graphs: New dependency and accuracy measures