Extensions and intentions in the rough set theory
Information Sciences: an International Journal
Rough set approach to incomplete information systems
Information Sciences: an International Journal
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
Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory
Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough Sets, Fuzzy Sets and Knowledge Discovery
Rough Sets, Fuzzy Sets and Knowledge Discovery
A Generalized Definition of Rough Approximations Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
Algebraic Structures of Rough Sets
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Reduction and axiomization of covering generalized rough sets
Information Sciences: an International Journal
On fuzzy-rough sets approach to feature selection
Pattern Recognition Letters
Information Sciences: an International Journal
A comparison of two types of rough sets induced by coverings
International Journal of Approximate Reasoning
Reduction about approximation spaces of covering generalized rough sets
International Journal of Approximate Reasoning
Extending soft sets with description logics
Computers & Mathematics with Applications
An application of covering approximation spaces on network security
Computers & Mathematics with Applications
Covering rough sets based on neighborhoods: An approach without using neighborhoods
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning
Bipartite graphs and coverings
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Multi knowledge based rough approximations and applications
Knowledge-Based Systems
The fourth type of covering-based rough sets
Information Sciences: an International Journal
Topological characterizations of covering for special covering-based upper approximation operators
Information Sciences: an International Journal
Communication between information systems with covering based rough sets
Information Sciences: an International Journal
Approximation Operators, Binary Relation and Basis Algebra in L-fuzzy Rough Sets
Fundamenta Informaticae - Knowledge Technology
Bipolar fuzzy rough set model on two different universes and its application
Knowledge-Based Systems
Information Sciences: an International Journal
Some properties of generalized rough sets
Information Sciences: an International Journal
Relationships between covering-based rough sets and relation-based rough sets
Information Sciences: an International Journal
Related family: A new method for attribute reduction of covering information systems
Information Sciences: an International Journal
A novel method for attribute reduction of covering decision systems
Information Sciences: an International Journal
An axiomatic characterization of probabilistic rough sets
International Journal of Approximate Reasoning
On the topological properties of generalized rough sets
Information Sciences: an International Journal
A Comparative Study of Ordered and Covering Information Systems
Fundamenta Informaticae
Hi-index | 0.09 |
The covering generalized rough sets are an improvement of traditional rough set model to deal with more complex practical problems which the traditional one cannot handle. It is well known that any generalization of traditional rough set theory should first have practical applied background and two important theoretical issues must be addressed. The first one is to present reasonable definitions of set approximations, and the second one is to develop reasonable algorithms for attributes reduct. The existing covering generalized rough sets, however, mainly pay attention to constructing approximation operators. The ideas of constructing lower approximations are similar but the ideas of constructing upper approximations are different and they all seem to be unreasonable. Furthermore, less effort has been put on the discussion of the applied background and the attributes reduct of covering generalized rough sets. In this paper we concentrate our discussion on the above two issues. We first discuss the applied background of covering generalized rough sets by proposing three kinds of datasets which the traditional rough sets cannot handle and improve the definition of upper approximation for covering generalized rough sets to make it more reasonable than the existing ones. Then we study the attributes reduct with covering generalized rough sets and present an algorithm by using discernibility matrix to compute all the attributes reducts with covering generalized rough sets. With these discussions we can set up a basic foundation of the covering generalized rough set theory and broaden its applications.