Interpreting Fuzzy Membership Functions in the Theory of Rough Sets
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Reduction and axiomization of covering generalized rough sets
Information Sciences: an International Journal
On the coverings by tolerance classes
Information Sciences—Informatics and Computer Science: An International Journal
Topological approaches to covering rough sets
Information Sciences: an International Journal
Entropies and Co-Entropies of Coverings with Application to Incomplete Information Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
A novel approach to fuzzy rough sets based on a fuzzy covering
Information Sciences: an International Journal
Defining matroids through sequential selection
European Journal of Combinatorics
Information Sciences: an International Journal
On Three Types of Covering-Based Rough Sets
IEEE Transactions on Knowledge and Data Engineering
Measures for evaluating the decision performance of a decision table in rough set theory
Information Sciences: an International Journal
Attribute reduction based on evidence theory in incomplete decision systems
Information Sciences: an International Journal
Attribute reduction in decision-theoretic rough set models
Information Sciences: an International Journal
Neighborhood rough set based heterogeneous feature subset selection
Information Sciences: an International Journal
Relationship between generalized rough sets based on binary relation and covering
Information Sciences: an International Journal
Rough sets approach to symbolic value partition
International Journal of Approximate Reasoning
Approaches to knowledge reduction of covering decision systems based on information theory
Information Sciences: an International Journal
A hierarchical model for test-cost-sensitive decision systems
Information Sciences: an International Journal
Relationship among basic concepts in covering-based rough sets
Information Sciences: an International Journal
Mining from incomplete quantitative data by fuzzy rough sets
Expert Systems with Applications: An International Journal
On some properties of base-matroids
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
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
On the structure of generalized rough sets
Information Sciences: an International Journal
Invertible approximation operators of generalized rough sets and fuzzy rough sets
Information Sciences: an International Journal
Positive approximation: An accelerator for attribute reduction in rough set theory
Artificial Intelligence
Roughness based on fuzzy ideals
Information Sciences: an International Journal
Test-cost-sensitive attribute reduction
Information Sciences: an International Journal
Covering based rough set approximations
Information Sciences: an International Journal
Quantitative analysis for covering-based rough sets through the upper approximation number
Information Sciences: an International Journal
A matroidal approach to rough set theory
Theoretical Computer Science
Four matroidal structures of covering and their relationships with rough sets
International Journal of Approximate Reasoning
Hi-index | 0.00 |
In many real world applications, information blocks form a covering of a universe. Covering-based rough set theory has been proposed to deal with this type of information. It is more general and complex than classical rough set theory, hence there is much need to develop sophisticated structures to characterize covering-based rough sets. Matroids are important tools for describing graphs and linear independence of matrix theory. This paper establishes two matroidal structures of covering-based rough sets. Firstly, the transversal matroidal structure of a family of subsets of a universe is constructed. We also prove that the family of subsets of a universe is a covering if and only if the constructed transversal matroid is a normal one. Secondly, the function matroidal structure is constructed through the upper approximation number. Moreover, the relationships between the two matroidal structures are studied. Specifically, when a covering of a universe is a partition, these two matroidal structures coincide with each other.