Matroidal structure of rough sets based on serial and transitive relations
From MaRDI portal
Publication:1952848
DOI10.1155/2012/429737zbMath1264.05028arXiv1209.4976WikidataQ58905880 ScholiaQ58905880MaRDI QIDQ1952848
Publication date: 3 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.4976
rough sets; closure operators of matroids; connectedness in a matroid; matroidal structure; upper approximation operators of rough sets
05B35: Combinatorial aspects of matroids and geometric lattices
Related Items
Graph and matrix approaches to rough sets through matroids, Matrix approach to spanning matroids of rough sets and its application to attribute reduction, The Matroidal Structures of the Second Type of Covering-Based Rough Set
Cites Work
- Unnamed Item
- Topological properties of generalized approximation spaces
- Approximations and uncertainty measures in incomplete information systems
- Abstract functional dependency structures
- Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
- Topological approaches to covering rough sets
- Generalized rough sets based on reflexive and transitive relations
- Granular computing applied to ontologies
- Extensions and intensions in the rough set theory
- Constructive and algebraic methods of the theory of rough sets
- Reduction and axiomization of covering generalized rough sets.
- Matroidal structure of rough sets from the viewpoint of graph theory
- Relational interpretations of neighborhood operators and rough set approximation operators
- Rough set approach to incomplete information systems
- On relationship between modified sets, topological spaces and rough sets
- Quantitative analysis for covering-based rough sets through the upper approximation number
- A general approach to attribute reduction in rough set theory
- Generalized rough sets based on relations
- Matching Theory for Combinatorial Geometries
