In covering rough set theory, the basic problem is the calculation of lower and upper
approximations for subsets of a covering approximation space. For a covering …

In covering-based rough sets, many basic issues are related to minimal and maximal
descriptions. For a covering approximation space with a large cardinal, it would be tedious …

Covering rough sets are natural extensions of the classical rough sets by relaxing the
partitions to coverings. Recently, the concept of neighborhood has been applied to define …

Granular computing is an emerging computing paradigm of information processing. Rough
set theory is a kind of models of granular computing and is used to deal with the vagueness …

The covering generalized rough set is an improvement of Pawlak rough set to deal with
more complex practical problems which the latter one cannot handle. However, many basic …

Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in
information systems, has originally described the indiscernibility of elements by equivalence …

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 …

Covering-based rough sets are important generalizations of the classical rough sets of
Pawlak. A common way to shape lower and upper approximations within this framework is …

In this paper, we focus on the study of covering based rough sets in covering approximation
spaces. Firstly, two pairs of covering approximation operators are reviewed, their properties …

In this paper, we present the covering rough sets based on neighborhoods by approximation
operations as a new type of extended covering rough set models. In fact, we have …