Fuzzy Sets and Systems - Special issue: fuzzy sets: where do we stand? Where do we go?
Extensions and intentions in the rough set theory
Information Sciences: an International Journal
Relational interpretations of neighborhood operators and rough set approximation operators
Information Sciences—Informatics and Computer Science: 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
Chinese Wall Security Model and Conflict Analysis
COMPSAC '00 24th International Computer Software and Applications Conference
On Generalizing Pawlak Approximation Operators
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Reduction and axiomization of covering generalized rough sets
Information Sciences: an International Journal
Peculiarity Oriented Multidatabase Mining
IEEE Transactions on Knowledge and Data Engineering
Case Generation Using Rough Sets with Fuzzy Representation
IEEE Transactions on Knowledge and Data Engineering
Mining Constrained Gradients in Large Databases
IEEE Transactions on Knowledge and Data Engineering
Information-preserving hybrid data reduction based on fuzzy-rough techniques
Pattern Recognition Letters
Topological approaches to covering rough sets
Information Sciences: an International Journal
Information Sciences: an International Journal
Measuring roughness of generalized rough sets induced by a covering
Fuzzy Sets and Systems
Construction of rough approximations in fuzzy setting
Fuzzy Sets and Systems
Rough fuzzy approximations on two universes of discourse
Information Sciences: an International Journal
Expert Systems with Applications: An International Journal
A systematic study on attribute reduction with rough sets based on general binary relations
Information Sciences: an International Journal
Approximations and reducts with covering generalized rough sets
Computers & Mathematics with Applications
Generalized fuzzy rough approximation operators based on fuzzy coverings
International Journal of Approximate Reasoning
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
Relationship among basic concepts in covering-based rough sets
Information Sciences: an International Journal
On axiomatic characterizations of three pairs of covering based approximation operators
Information Sciences: an International Journal
Constructive and algebraic methods of the theory of rough sets
Information Sciences: an International Journal
Reduction about approximation spaces of covering generalized rough sets
International Journal of Approximate Reasoning
Consistency based attribute reduction
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Information Sciences: an International Journal
Axiomatization and conditions for neighborhoods in a covering to form a partition
Information Sciences: an International Journal
On minimization of axiom sets characterizing covering-based approximation operators
Information Sciences: an International Journal
Rule learning for classification based on neighborhood covering reduction
Information Sciences: an International Journal
Textures and covering based rough sets
Information Sciences: an International Journal
Information Sciences: an International Journal
Tolerance Approximation Spaces
Fundamenta Informaticae
Hi-index | 0.07 |
In terms of attribute reduction of covering based rough sets, the discernibility matrix is used as a conventional method to compute all attribute reducts. However, it is inapplicable to attribute reduction in certain circumstances. In this article, a new method, referred to as the related family, is introduced to compute all attribute reducts and relative attribute reducts for covering rough sets. Its core idea is to remove superfluous attributes while keeping the approximation space of covering information system unchanged. The related family method is more powerful than the discernibility matrix method, since the former can handle complicated cases that could not be handled by the latter. In addition, a simplified version of the related family and its corresponding heuristic algorithm are also presented.