Rough sets on graphs: new dependency and accuracy measures
DOI10.1142/S1793830918500635zbMATH Open1400.05247OpenAlexW2883305286MaRDI QIDQ4554547FDOQ4554547
Authors: F. Infusino, F. Tropeano, G. Chiaselotti, T. Gentile 
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
Recommendations
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Database theory (68P15) Fractional graph theory, fuzzy graph theory (05C72) Graph theory (05C99)
Cites Work
- Title not available (Why is that?)
- Parallel discrete dynamical systems on maxterm and minterm Boolean functions
- Parallel dynamical systems over graphs and related topics: a survey
- Parallel dynamical systems over directed dependency graphs
- A natural extension of the Young partition lattice
- A new discrete dynamical system of signed integer partitions
- Rudiments of rough sets
- Information granulation and rough set approximation
- Rough sets: some extensions
- Rough sets and Boolean reasoning
- Relations on hypergraphs
- Constructive and algebraic methods of the theory of rough sets
- Title not available (Why is that?)
- Intersection properties of maximal directed cuts in digraphs
- Transactions on Rough Sets III
- Lattices with Interior and Closure Operators and Abstract Approximation Spaces
- Transactions on Rough Sets I
- Granular computing. An emerging paradigm
- Roughness in Cayley graphs
- Transactions on Rough Sets II
- Temporal dynamics in information tables
- Rough matroids based on relations
- An application of rough sets to graph theory
- A matroidal approach to rough set theory
- New rough approximations for \(n\)-cycles and \(n\)-paths
- Dependency and accuracy measures for directed graphs
- Decision bireducts and decision reducts -- a comparison
- Simple graphs in granular computing
- The adjacency matrix of a graph as a data table: a geometric perspective
- Title not available (Why is that?)
- Four matroidal structures of covering and their relationships with rough sets
- Nesting House-designs
- Dominance order on signed integer partitions
- 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
- Simplicial complexes and closure systems induced by indistinguishability relations
- Dependency structures for decision tables
- An investigation about rough set theory: some foundational and mathematical aspects
- Rough Set Theory and Digraphs
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- On generalized decision functions: reducts, networks and ensembles
- Smart case-based indexing in worsted roving process: Combination of rough set and case-based reasoning
Cited In (7)
- Some classifications of graphs with respect to a set adjacency relation
- The introduction and utilization of (l,u)-graphs in the extended variable precision rough sets model
- New rough sets properties on graph theory
- Dependency and accuracy measures for directed graphs
- Granular computing on basic digraphs
- New rough approximations for \(n\)-cycles and \(n\)-paths
- Rough Set Theory Applied to Simple Undirected Graphs
This page was built for publication: Rough sets on graphs: new dependency and accuracy measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554547)
