Variable precision rough set model
Journal of Computer and System Sciences
Extensions and intentions in the rough set theory
Information Sciences: an International Journal
Uncertainly measures of rough set prediction
Artificial Intelligence
Relational interpretations of neighborhood operators and rough set approximation operators
Information Sciences—Informatics and Computer Science: An International Journal
Rough set approach to incomplete information systems
Information Sciences: an International Journal
Rules in incomplete information systems
Information Sciences: an International Journal
Rough set theory applied to (fuzzy) ideal theory
Fuzzy Sets and Systems
International Journal of Human-Computer Studies
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
A Generalized Definition of Rough Approximations Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
Approximate Reducts and Association Rules - Correspondence and Complexity Results
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Reduction and axiomization of covering generalized rough sets
Information Sciences: an International Journal
Maximal consistent block technique for rule acquisition in incomplete information systems
Information Sciences: an International Journal
Approaches to knowledge reduction based on variable precision rough set model
Information Sciences—Informatics and Computer Science: An International Journal - Mining stream data
Topological approaches to covering rough sets
Information Sciences: an International Journal
Information Sciences: an International Journal
Measures for evaluating the decision performance of a decision table in rough set theory
Information Sciences: an International Journal
A systematic study on attribute reduction with rough sets based on general binary relations
Information Sciences: an International Journal
Converse approximation and rule extraction from decision tables in rough set theory
Computers & Mathematics with Applications
Approximations and reducts with covering generalized rough sets
Computers & Mathematics with Applications
Communicating between information systems
Information Sciences: an International Journal
Neighborhood rough set based heterogeneous feature subset selection
Information Sciences: an International Journal
Constructive and algebraic methods of the theory of rough sets
Information Sciences: an International Journal
Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
Information Sciences: an International Journal
Selecting discrete and continuous features based on neighborhood decision error minimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Positive approximation: An accelerator for attribute reduction in rough set theory
Artificial Intelligence
Information Sciences: an International Journal
Rough implication operator based on strong topological rough algebras
Information Sciences: an International Journal
Sequential covering rule induction algorithm for variable consistency rough set approaches
Information Sciences: an International Journal
The superiority of three-way decisions in probabilistic rough set models
Information Sciences: an International Journal
On minimization of axiom sets characterizing covering-based approximation operators
Information Sciences: an International Journal
Probabilistic model criteria with decision-theoretic rough sets
Information Sciences: an International Journal
Modeling rough granular computing based on approximation spaces
Information Sciences: an International Journal
Textures and covering based rough sets
Information Sciences: an International Journal
Information Sciences: an International Journal
Approximations and uncertainty measures in incomplete information systems
Information Sciences: an International Journal
Covering based rough set approximations
Information Sciences: an International Journal
The fourth type of covering-based rough sets
Information Sciences: an International Journal
Extended rough set-based attribute reduction in inconsistent incomplete decision systems
Information Sciences: an International Journal
Fuzzy-Rough Sets Assisted Attribute Selection
IEEE Transactions on Fuzzy Systems
Relationships among generalized rough sets in six coverings and pure reflexive neighborhood system
Information Sciences: an International Journal
Rough sets attributes reduction based expert system in interlaced video sequences
IEEE Transactions on Consumer Electronics
Parameterized attribute reduction with Gaussian kernel based fuzzy rough sets
Information Sciences: an International Journal
A general frame for intuitionistic fuzzy rough sets
Information Sciences: an International Journal
Communication between information systems with covering based rough sets
Information Sciences: an International Journal
Tolerance Approximation Spaces
Fundamenta Informaticae
A novel and better fitness evaluation for rough set based minimum attribute reduction problem
Information Sciences: an International Journal
Using one axiom to characterize rough set and fuzzy rough set approximations
Information Sciences: an International Journal
Rough set approach to incomplete numerical data
Information Sciences: an International Journal
Approximation operators on complete completely distributive lattices
Information Sciences: an International Journal
Hi-index | 0.07 |
Attribute reduction has become an important step in pattern recognition and machine learning tasks. Covering rough sets, as a generalization of classical rough sets, have attracted wide attention in both theory and application. This paper provides a novel method for attribute reduction based on covering rough sets. We review the concepts of consistent and inconsistent covering decision systems and their reducts and we develop a judgment theorem and a discernibility matrix for each type of covering decision system. Furthermore, we present some basic structural properties of attribute reduction with covering rough sets. Based on a discernibility matrix, we develop a heuristic algorithm to find a subset of attributes that approximate a minimal reduct. Finally, the experimental results for UCI data sets show that the proposed reduction approach is an effective technique for addressing numerical and categorical data and is more efficient than the method presented in the paper [D.G. Chen, C.Z. Wang, Q.H. Hu, A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets, Information Sciences 177(17) (2007) 3500-3518].