Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
From MaRDI portal
Publication:4606359
DOI10.3233/FI-2017-1606zbMATH Open1381.68293OpenAlexW2765462480MaRDI QIDQ4606359FDOQ4606359
Authors: 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
Recommendations
- An application of rough sets to graph theory
- Graph and matrix approaches to rough sets through matroids
- Connectedness of graphs and its application to connected matroids through covering-based rough sets
- Equivalent characterizations of some graph problems by covering-based rough sets
- Connectedness of graph and matroid by covering-based rough sets
- Covering-based rough sets on Eulerian matroids
- Matroidal structure of rough sets from the viewpoint of graph theory
- Rough Set Theory Applied to Simple Undirected Graphs
- scientific article; zbMATH DE number 6310775
- Generalizations of rough set tools inspired by graph theory
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cited In (13)
- Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets
- Fuzzy \(\beta \)-covering approximation spaces
- New perspectives of granular computing in relation geometry induced by pairings
- Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction
- Set relations and set systems induced by some families of integral domains
- Granular computing on basic digraphs
- Grained matrix and complementary matrix: novel methods for computing information descriptions in covering approximation spaces
- Some classes of abstract simplicial complexes motivated by module theory
- Novel matrix-based approaches to computing minimal and maximal descriptions in covering-based rough sets
- Lattice representations with set partitions induced by pairings
- An application of rough sets to graph theory
- Equivalent characterizations of some graph problems by covering-based rough sets
- Matrix approach for fuzzy description reduction and group decision-making with fuzzy \(\beta\)-covering
This page was built for publication: Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606359)
