Generalizations of Rough Set Tools Inspired by Graph Theory
From MaRDI portal
Publication:4589231
DOI10.3233/FI-2016-1431zbMath1388.03045OpenAlexW2561357732MaRDI QIDQ4589231
Davide Ciucci, F. Infusino, Giampiero Chiaselotti, Tommaso 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
Related Items (11)
Indiscernibility structures induced from function sets : Graph and digraph case ⋮ Notions from rough set theory in a generalized dependency relation context ⋮ Locally finite complexes, modules and generalized information systems ⋮ Simple graphs in granular computing ⋮ Dependency and accuracy measures for directed graphs ⋮ Granular computing on information tables: families of subsets and operators ⋮ Decision systems in rough set theory: A set operatorial perspective ⋮ The granular partition lattice of an information table ⋮ Finding strongly connected components of simple digraphs based on granulation strategy ⋮ Approximation via a double-matroid structure ⋮ Granular computing on basic digraphs
This page was built for publication: Generalizations of Rough Set Tools Inspired by Graph Theory