Generalizations of rough set tools inspired by graph theory
From MaRDI portal
Publication:4589231
DOI10.3233/FI-2016-1431zbMATH Open1388.03045OpenAlexW2561357732MaRDI QIDQ4589231FDOQ4589231
Authors: Davide Ciucci, F. Infusino, G. Chiaselotti, T. Gentile
Publication date: 9 November 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2016-1431
Recommendations
Cited In (17)
- Locally finite complexes, modules and generalized information systems
- The introduction and utilization of (l,u)-graphs in the extended variable precision rough sets model
- Approximation via a double-matroid structure
- Dependency and accuracy measures for directed graphs
- Notions from rough set theory in a generalized dependency relation context
- Granular computing on basic digraphs
- Title not available (Why is that?)
- Granular computing on information tables: families of subsets and operators
- The granular partition lattice of an information table
- Indiscernibility structures induced from function sets : Graph and digraph case
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
- Finding strongly connected components of simple digraphs based on granulation strategy
- Decision systems in rough set theory: A set operatorial perspective
- Simple graphs in granular computing
- On the connection of hypergraph theory with formal concept analysis and rough set theory
- Rough Set Theory and Digraphs
- Rough Set Theory Applied to Simple Undirected Graphs
This page was built for publication: Generalizations of rough set tools inspired by graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589231)