Rough sets on graphs: new dependency and accuracy measures
From MaRDI portal
Publication:4554547
Recommendations
Cites work
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 2059848 (Why is no real title available?)
- scientific article; zbMATH DE number 1748431 (Why is no real title available?)
- A matroidal approach to rough set theory
- A natural extension of the Young partition lattice
- A new discrete dynamical system of signed integer partitions
- An application of rough sets to graph theory
- An investigation about rough set theory: some foundational and mathematical aspects
- Constructive and algebraic methods of the theory of rough sets
- Decision bireducts and decision reducts -- a comparison
- Dependency and accuracy measures for directed graphs
- Dependency structures for decision tables
- Dominance order on signed integer partitions
- Four matroidal structures of covering and their relationships with rough sets
- Granular computing on information tables: families of subsets and operators
- Granular computing. An emerging paradigm
- Information granulation and rough set approximation
- Intersection properties of maximal directed cuts in digraphs
- Lattices with Interior and Closure Operators and Abstract Approximation Spaces
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- Nesting House-designs
- New rough approximations for \(n\)-cycles and \(n\)-paths
- On generalized decision functions: reducts, networks and ensembles
- On periods and equilibria of computational sequential systems
- Pairings and related symmetry notions
- Parallel discrete dynamical systems on maxterm and minterm Boolean functions
- Parallel dynamical systems over directed dependency graphs
- Parallel dynamical systems over graphs and related topics: a survey
- Relations on hypergraphs
- Rough Set Theory and Digraphs
- Rough matroids based on relations
- Rough sets and Boolean reasoning
- Rough sets: some extensions
- Roughness in Cayley graphs
- Rudiments of rough sets
- Simple graphs in granular computing
- Simplicial complexes and closure systems induced by indistinguishability relations
- Smart case-based indexing in worsted roving process: Combination of rough set and case-based reasoning
- Temporal dynamics in information tables
- The adjacency matrix of a graph as a data table: a geometric perspective
- The granular partition lattice of an information table
- Transactions on Rough Sets I
- Transactions on Rough Sets II
- Transactions on Rough Sets III
Cited in
(7)- Rough Set Theory Applied to Simple Undirected Graphs
- 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
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)
