Matroidal structure of rough sets based on serial and transitive relations
From MaRDI portal
Abstract: The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery and data mining. The theory of matroids is a generalization of linear independence in vector spaces. It has been used in combinatorial optimization and algorithm design. In order to take advantages of both rough sets and matroids, in this paper we propose a matroidal structure of rough sets based on a serial and transitive relation on a universe. We define the family of all minimal neighborhoods of a relation on a universe, and prove it satisfy the circuit axioms of matroids when the relation is serial and transitive. In order to further study this matroidal structure, we investigate the inverse of this construction: inducing a relation by a matroid. The relationships between the upper approximation operators of rough sets based on relations and the closure operators of matroids in the above two constructions are studied. Moreover, we investigate the connections between the above two constructions.
Recommendations
Cites work
- A general approach to attribute reduction in rough set theory
- Abstract functional dependency structures
- Approximations and uncertainty measures in incomplete information systems
- Constructive and algebraic methods of the theory of rough sets
- Extensions and intensions in the rough set theory
- Generalized rough sets based on reflexive and transitive relations
- Generalized rough sets based on relations
- Granular computing applied to ontologies
- scientific article; zbMATH DE number 3831938 (Why is no real title available?)
- Matching Theory for Combinatorial Geometries
- Matroidal structure of rough sets from the viewpoint of graph theory
- On relationship between modified sets, topological spaces and rough sets
- Quantitative analysis for covering-based rough sets through the upper approximation number
- Reduction and axiomization of covering generalized rough sets.
- Relational interpretations of neighborhood operators and rough set approximation operators
- Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
- Rough set approach to incomplete information systems
- Topological approaches to covering rough sets
- Topological properties of generalized approximation spaces
Cited in
(9)- Matroidal structure of rough sets from the viewpoint of graph theory
- A matroidal approach to rough set theory
- Matrix approach to spanning matroids of rough sets and its application to attribute reduction
- Note on ``A rough set approach to the characterization of transversal matroids
- The relationships between degree rough sets and matroids
- The matroidal structures of the second type of covering-based rough set
- Graph and matrix approaches to rough sets through matroids
- A New Description of Transversal Matroids Through Rough Set Approach
- A rough set approach to the characterization of transversal matroids
This page was built for publication: Matroidal structure of rough sets based on serial and transitive relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1952848)
