Simple graphs in granular computing

From MaRDI portal
Publication:1671713

DOI10.1016/j.ins.2015.12.042zbMath1395.68260OpenAlexW2235896546MaRDI QIDQ1671713

Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile

Publication date: 7 September 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10281/102303




Related Items (23)

Indiscernibility structures induced from function sets : Graph and digraph caseNotions from rough set theory in a generalized dependency relation contextRough sets on graphs: New dependency and accuracy measuresGranulation of ecological networks under fuzzy soft environmentSimplicial complexes and closure systems induced by indistinguishability relationsDependency structures for decision tablesTopological Aspects of Granular ComputingDependency and accuracy measures for directed graphsGranular computing on information tables: families of subsets and operatorsRough set theory applied to finite dimensional vector spacesGranulation of protein-protein interaction networks in Pythagorean fuzzy soft environmentRough Set Theory Applied to Simple Undirected GraphsPairings and related symmetry notionsOn the connection of hypergraph theory with formal concept analysis and rough set theoryApproximate normalized cuts without eigen-decompositionOn rule acquisition in incomplete multi-scale decision tablesThe granular partition lattice of an information tableGeneralized multi-scale decision tables with multi-scale decision attributesFinding strongly connected components of simple digraphs based on granulation strategyAn application of fuzzy hypergraphs and hypergraphs in granular computingDegree based models of granular computing under fuzzy indiscernibility relationsGranular computing: fundamentals and system modelingGranular computing on basic digraphs



Cites Work


This page was built for publication: Simple graphs in granular computing