Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets

DOI10.3233/FI-2017-1606zbMath1381.68293OpenAlexW2765462480MaRDI QIDQ4606359

Jingqian Wang, William Zhu

Publication date: 2 March 2018

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2017-1606

zbMATH Keywords

coveringbipartite graphadjacency matrixapproximation operatorcovering-based rough set

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (11)

Novel matrix-based approaches to computing minimal and maximal descriptions in covering-based rough sets ⋮ Matrix approach for fuzzy description reduction and group decision-making with fuzzy \(\beta\)-covering ⋮ Some classes of abstract simplicial complexes motivated by module theory ⋮ Grained matrix and complementary matrix: novel methods for computing information descriptions in covering approximation spaces ⋮ Fuzzy \(\beta \)-covering approximation spaces ⋮ Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ Lattice representations with set partitions induced by pairings ⋮ Set relations and set systems induced by some families of integral domains ⋮ Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction ⋮ Granular computing on basic digraphs

This page was built for publication: Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets