A Generalized Definition of Rough Approximations Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
Reduction and axiomization of covering generalized rough sets
Information Sciences: an International Journal
Topological approaches to covering rough sets
Information Sciences: an International Journal
Knowledge reduction based on the equivalence relations defined on attribute set and its power set
Information Sciences: an International Journal
Learning fuzzy rules from fuzzy samples based on rough set technique
Information Sciences: an International Journal
Axiomatic systems for rough sets and fuzzy rough sets
International Journal of Approximate Reasoning
Attribute reduction in decision-theoretic rough set models
Information Sciences: an International Journal
The algebraic structures of generalized rough set theory
Information Sciences: an International Journal
Generalized rough sets based on reflexive and transitive relations
Information Sciences: an International Journal
Relationship between generalized rough sets based on binary relation and covering
Information Sciences: an International Journal
Fuzzy Sets and Systems
Fuzzy rough set based attribute reduction for information systems with fuzzy decisions
Knowledge-Based Systems
Binary nullity, Euler circuits and interlace polynomials
European Journal of Combinatorics
Rule learning for classification based on neighborhood covering reduction
Information Sciences: an International Journal
Axiomatic systems of generalized rough sets
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Matroidal approaches to rough sets via closure operators
International Journal of Approximate Reasoning
Attribute reduction of data with error ranges and test costs
Information Sciences: an International Journal
Temporal Dynamics in Information Tables
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Matroidal structure of rough sets and its characterization to attribute reduction
Knowledge-Based Systems
Quantitative analysis for covering-based rough sets through the upper approximation number
Information Sciences: an International Journal
Attribute selection based on a new conditional entropy for incomplete decision systems
Knowledge-Based Systems
Rough matroids based on relations
Information Sciences: an International Journal
Decision rule mining using classification consistency rate
Knowledge-Based Systems
Four matroidal structures of covering and their relationships with rough sets
International Journal of Approximate Reasoning
Hi-index | 0.07 |
Rough sets were proposed to deal with vagueness and incompleteness of knowledge in information systems. In this field, there are many optimization issues such as attribute reduction. Matroids generalized from matrices have been widely used in many fields, particularly greedy algorithm design, which plays an important role in attribute reduction. Therefore, it is meaningful to combine matroids with rough sets to solve the optimization problems. In this paper, we construct a type of matroid of rough sets based on the concept of nullity and apply it to attribute reduction. First, we propose a nullity operator for rough sets to induce a matroid and then we present a specific type of matroid called a nullity-based matroid. Second, given the relationship between nullities and matrices, we present two types of matrices to characterize this type of matroid and its nullity operator. Third, the dual of this type of matroid is induced by the second type of matrix. Finally, we apply the obtained matroids to attribute reduction issues in information systems. In summary, this paper provides a new approach to studying rough sets.