Matroidal structure of rough sets from the viewpoint of graph theory
Summary: Constructing structures with other mathematical theories is an important research field of rough sets. As one mathematical theory on sets, matroids possess a sophisticated structure. This paper builds a bridge between rough sets and matroids and establishes the matroidal structure of rough sets. In order to understand intuitively the relationships between these two theories, we study this problem from the viewpoint of graph theory. Therefore, any partition of the universe can be represented by a family of complete graphs or cycles. Then two different kinds of matroids are constructed and some matroidal characteristics of them are discussed, respectively. The lower and the upper approximations are formulated with these matroidal characteristics. Some new properties, which have not been found in rough sets, are obtained. Furthermore, by defining the concept of lower approximation number, the rank function of some subset of the universe and the approximations of the subset are connected. Finally, the relationships between the two types of matroids are discussed, and the result shows that they are just dual matroids.
- A comparative study of fuzzy sets and rough sets
- A generalized model of fuzzy rough sets
- An axiomatic characterization of a fuzzy generalization of rough sets.
- An Introduction to Matroid Theory
- Generalized rough sets based on relations
- Generalized rough sets over fuzzy lattices
- Graph theory
- Hidden superconformal symmetry in M-theory
- scientific article; zbMATH DE number 3831938 (Why is no real title available?)
- scientific article; zbMATH DE number 4046636 (Why is no real title available?)
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 68126 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 927110 (Why is no real title available?)
- scientific article; zbMATH DE number 972613 (Why is no real title available?)
- scientific article; zbMATH DE number 972617 (Why is no real title available?)
- Neighborhood rough set based heterogeneous feature subset selection
- Neighborhood systems and approximate retrieval
- On the Abstract Properties of Linear Dependence
- Reduction and axiomization of covering generalized rough sets.
- Reduction of neighborhood-based generalized rough sets
- Rough approximations on a complete completely distributive lattice with applications to generalized rough sets
- ROUGH FUZZY SETS AND FUZZY ROUGH SETS*
- Rough operations on Boolean algebras
- Rough set theory for topological spaces
- Rough sets and Boolean reasoning
- Topological approaches to covering rough sets
- Rough sets and matroids from a lattice-theoretic viewpoint
- A matroidal approach to rough set theory
- Matroidal structure of rough sets based on serial and transitive relations
- Approximation via a double-matroid structure
- Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction
- Four matroidal structures of covering and their relationships with rough sets
- Note on ``A rough set approach to the characterization of transversal matroids
- Connectedness of graphs and its application to connected matroids through covering-based rough sets
- The properties of rough matroids based on equivalence relations
- The relationships between degree rough sets and matroids
- Algebraic representation, dualities and beyond
- Connectedness of graph and matroid by covering-based rough sets
- The matroidal structures of the second type of covering-based rough set
- Rough Set Theory Applied to Simple Undirected Graphs
- Parametric matroid of rough set
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
- scientific article; zbMATH DE number 754444 (Why is no real title available?)
- Covering cycle matroid
- Characterization and reduction of concept lattices through matroid theory
- A New Description of Transversal Matroids Through Rough Set Approach
- scientific article; zbMATH DE number 6310775 (Why is no real title available?)
- Rough sets and matroids
- Rough set characterization for 2-circuit matroid
- A matroidal structure of the upper approximations of covering-based rough sets defined by neighborhoods
- A rough set approach to the characterization of transversal matroids
- Nullity-based matroid of rough sets and its application to attribute reduction
This page was built for publication: Matroidal structure of rough sets from the viewpoint of graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1760908)
