The cocycle lattice of binary matroids
European Journal of Combinatorics - Special issue dedicated to Bernt Lindstro¨m
Variable precision rough set model
Journal of Computer and System Sciences
Theoretical Computer Science
A lattice-theoretical characterization of oriented matroids
European Journal of Combinatorics
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Algebraic Structures of Rough Sets
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Reduction and axiomization of covering generalized rough sets
Information Sciences: an International Journal
A generalized topological view of motion in discrete space
Theoretical Computer Science - Topology in computer science
An axiomatic characterization of a fuzzy generalization of rough sets
Information Sciences—Informatics and Computer Science: An International Journal
On Three Types of Covering-Based Rough Sets
IEEE Transactions on Knowledge and Data Engineering
Generalized rough sets over fuzzy lattices
Information Sciences: an International Journal
Information Sciences: an International Journal
The algebraic structures of generalized rough set theory
Information Sciences: an International Journal
The complexity of the matroid–greedoid partition problem
Theoretical Computer Science
A parameterized view on matroid optimization problems
Theoretical Computer Science
On the topological properties of fuzzy rough sets
Fuzzy Sets and Systems
Constructive and algebraic methods of the theory of rough sets
Information Sciences: an International Journal
Rough set theory for topological spaces
International Journal of Approximate Reasoning
Preface: Rough sets and fuzzy sets in natural computing
Theoretical Computer Science
Fuzzy-rough nearest neighbour classification and prediction
Theoretical Computer Science
Approximation of sets based on partial covering
Theoretical Computer Science
Transversal and function matroidal structures of covering-based rough sets
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Covering based rough set approximations
Information Sciences: an International Journal
The fourth type of covering-based rough sets
Information Sciences: an International Journal
Two Semantic Issues in a Probabilistic Rough Set Model
Fundamenta Informaticae - Advances in Rough Set Theory
Tolerance Approximation Spaces
Fundamenta Informaticae
Hi-index | 5.23 |
Rough set theory has been successfully applied to vague and uncertain data due to its approximation ability. Matroid is a sophisticated mathematical structure to provide a unifying abstract treatment for graph theory, linear algebra, and combinatorial optimization. In this paper, we redefine rough approximation operators through matroidal approaches and build a matroidal structure of rough set theory. First, each block of a partition is converted to a uniform matroid. In this way, a partition is transformed into a family of uniform matroids. Second, these matroids are combined through the direct sum operation to form a new matroid. Therefore the scattered uniform matroids are treated as a whole one. Third, each concept in a universe is transformed to a restriction matroid. The lower and the upper approximations of each concept are established with the matroidal approach. Fourth, for any two concepts in a universe, the relationships between the approximations of them are discussed and some new properties are revealed. These properties can be hardly found without the help of matroid theory. Fifth, the boundary region and the negative region of a concept in the universe are established directly with the matroidal approach. The lower and the upper approximations of each concept are then obtained through its boundary region. This work indicates a new approach for studying rough set theory.