#### Abstract

Rough set theory was introduced by Pawlak in 1982 to handle imprecision, vagueness, and uncertainty in data analysis. Our aim is to generalize rough set theory by introducing concepts of -lower and -upper approximations which depends on the concept of -sets. Also, we study some of their basic properties.

#### 1. Introduction

Pawlak is credited with creating the “rough set theory” [1], a mathematical tool for dealing with vagueness or uncertainty. Since 1982, the theory and applications of rough set have impressively developed. There are many applications of rough set theory especially in data analysis, artificial intelligence, and cognitive sciences [2–4]. Some basic aspects of the research of rough sets and several applications have recently been presented by Pawlak and Skowron [5, 6]. Rough set theory [5–8] is an extension of set theory in which a subset of a universe is described by a pair of ordinary sets called the lower and upper approximation. Yao [9] classified broadly methods for the development of rough set theory into two classes, namely, the constructive and axiomatic (algebraic) approaches. In constructive methods, lower and upper approximations are constructed from the primitive notions, such as equivalence relations on a universe and neighborhood systems. In rough sets, the equivalence classes are the building blocks for the construction of the lower and upper approximations. The lower approximation of a given set is the union of all the equivalence classes which are subsets of the set, and the upper approximation is the union of all the equivalence classes which have a nonempty intersection with the set. It is well known that a partition induces an equivalence relation on a set and vice versa. The properties of rough sets can thus be examined via either partition or equivalence classes. Rough sets are a suitable mathematical model of vague concepts. The main idea of rough sets corresponds to the lower and upper approximations. Pawlak’s definitions for lower and upper approximations were originally introduced with reference to an equivalence relation. Many interesting properties of the lower and upper approximations have been derived by Pawlak and Skowron [5, 6] based on the equivalence relations. However, the equivalence relation appears to be a stringent condition that may limit the applicability of Pawlak’s rough set model. Many extensions have been made in recent years by replacing equivalence relation or partition by notions such as binary relations [10–12], neighborhood systems, and Boolean algebras [12–16]. Abu-Donia [17] discussed three types of upper (lower) approximations depending on the right neighborhood by using general relation, also generalized this types by using a family of finite binary relations in two ways. Many proposals have been made for generalizing and interpreting rough sets [4, 18–25]. In 1983, Abd El-Monsef et al. [26] introduced the concept of -open sets. In 1986, Maki [27] has introduced the concept of -sets in topological spaces as the sets that coincide with their kernel. The kernel of a set is the intersection of all open supersets of . In 2004, Noiri and Hatir [28] introduced the -sets (or -sets) and investigated some of their properties. In 2008, Abu-Donia and Salama [29] introduced and investigated the concept of -approximation space. The theory of rough sets can be generalized in several directions. Within the set-theoretic framework, generalizations of the element based definition can be obtained by using nonequivalence binary relations [9, 23, 30–32], generalizations of the granule based definition can be obtained by using coverings [12, 30, 33–35], and generalizations of subsystem based definition can be obtained by using other subsystems [36, 37]. In the standard rough set model, the same subsystem is used to define lower and upper approximation operators. When generalizing the subsystem based definition, one may use two subsystems, one for the lower approximation operator and the other for the upper approximation operator. Yao [24] defined a pair of generalized approximation operators by replacing the equivalence relations with the family of open sets for lower approximation operator "interior operators" and the equivalence relations with the family of closed sets for upper approximation operator “closure operators”. In this paper we used a new subsystem called -sets to define new types of lower and upper approximation operators, called -lower approximation and -upper approximation. We study -rough sets, the comparison between this concept and rough sets is studied. Also, we give some counter examples.

#### 2. Basic Concepts

A topological space [10] is a pair consisting of a set and family of subset of satisfying the following conditions:

(1) ,

(2) is closed under arbitrary union,

(3) is closed under finite intersection.

The pair is called a topological space, the elements of are called points of the space, the subsets of belonging to are called open sets in the space, and the complement of the subsets of belonging to are called closed set. The family of open subsets of is also called a topology for .

is called -closure of a subset .

Evidently, is the smallest closed subset of which contains . Note that is closed if and only if .

is called the -interior of a subset .

Evidently, is the union of all open subsets of which containing in . Note that is open if and only if . And is called the -boundary of a subset .

Let be a subset of a topological spaces . Let , and be closure, interior, and boundary of , respectively. is exact if , otherwise is rough. It is clear is exact if and only if .

*Definition 1 (see [26]). * A subset of a topological space is called open if .

The complement of -open set is called -closed set. We denote the family of all -open (resp., -closed) sets by (resp., ).

*Remark 2. * For any topological space , we have

*Definition 3 (see [28]). * Let be a subset of a topological space . A subset is defined as follows: .

The complement of -set is called -set.

Noiri and Hater [28] stated some properties of in the following lemma.

Lemma 4. *For subsets , and () of a topological space , the following hold. *(1)*. *(2)* If , then .*(3)*. *(4)* If , . *(5)*. *(6)*. *

*Definition 5. * A subset of a topological space is called -set if .

Lemma 6. * For subsets and of a topological space , the following hold. * (1)* is set.*(2)* If is -open, then is -set. *(3)* If is for each , then is -set.*(4)* If is for each , then is -set.*

*Definition 7. * Let be a topological space the subset is called: (1)*α*open [38] if ,(2) Preopen [39] if .

*Remark 8. * the class of all -sets is stronger than open (resp., -open, preopen, and -open) sets as shown in the following diagram:

Motivation for rough set theory has come from the need to represent subsets of a universe in terms of equivalence classes of a partition of that universe. The partition characterizes a topological space, called approximation space , where is a set called the universe and is an equivalence relation [2]. The equivalence classes of are also known as the granules, elementary sets, or blocks; we will use to denote the equivalence class containing . In the approximation space, we consider two operators
called the lower approximation and upper approximation of , respectively. Also let denote the positive region of , denote the negative region of and denote the borderline region of .

Let be a finite nonempty universe, , the degree of completeness can also be characterized by the accuracy measure as follows:
where represents the cardinality of set. Accuracy measures try to express the degree of completeness of knowledge. is able to capture how large the boundary region of the data sets is; however, we cannot easily capture the structure of the knowledge. A fundamental advantage of rough set theory is the ability to handle a category that cannot be sharply defined given a knowledge base. Characteristics of the potential data sets can be measured through the rough sets framework. We can measure inexactness and express topological characterization of imprecision with the following.(1) If and , then is roughly -definable.(2) If and , then is internally -undefinable.(3) If and , then is externally -undefinable.(4) If and , then is totally -undefinable.

We denote the set of all roughly -definable (resp., internally -undefinable, externally -undefinable, and totally -undefinable) sets by (resp., , , and ).

With and classifications above we can characterize rough sets by the size of the boundary region and structure. Rough sets are treated as a special case of relative sets and integrated with the notion of Belnap’s logic [22].

*Remark 9. *We denote the relation which used to get a subbase for a topology on and a class of -open sets () by . Also, we denote -approximation space by .

*Definition 10. * Let be a -approximation space -lower (resp., -upper) approximation of any nonempty subset of is defined as: ,
. We can get the the -approximation operator as follows.(1) Get the right neighborhoods from the given relation as . (2) Using right neighborhoods as a sub-base to get the topology .(3) Using the open sets in the topology to get the family of -open sets “from Definition 1.”(4) Using the set of all -open sets to get -approximation operators (from Definition 10).

*Definition 11. *Let be a -approximation space and . Then there are memberships , , , and , say, strong, weak, -strong, and -weak memberships respectively which defined by (1) iff ,(2) iff ,(3) iff ,(4) iff .

*Remark 12. * According to Definition 11, -lower and -upper approximations of a set can be written as , .

*Definition 13. * Let be a -approximation space and . the -accuracy measure of defined as follows:

*Definition 14. *Let be a -approximation space, the set is called (1) roughly -definable, if and , (2) internally -undefinable, if and , (3) externally -undefinable, if and , (4) totally -undefinable, if and .

We denote the set of all roughly -definable (resp., internally -undefinable, externally -undefinable, and totally -undefinable) sets by (resp., , and ).

*Remark 15. * For any -approximation space the following hold: (1) , (2), (3),
(4).

#### 3. A New Type of Rough Classification Based on -Sets

In this section, we introduced and investigated the concept of -approximation space. Also, we introduce the concepts of -lower approximation and -upper approximation for any subset and study their properties.

*Remark 16. *We denote the relation which used to get a subbase for a topology on and a class of -sets by . Also, we denote-approximation space by .

*Example 17. *Let be a universe and a relation defined by ,,, thus , , , and . Then the topology associated with this relation is ,,, and -sets = ,,,,. So is a -approximation space.

*Definition 18. * Let be a -approximation space. -lower approximation and -upper approximation of any nonempty subset of is defined as ,
.

The following proposition shows the properties of -lower approximation and -upper approximation of any nonempty subset.

Proposition 19. *Let be a -approximation space and . Then: *(1),
(2), ,(3)*If**then**and*,
(4),(5), (6), (7), (8), (9), (10), (11), (12), (13).

*Definition 20. * Let be a -approximation space. The Universe can be divided into 24 regions with respect to any as follows. (1) The internal edg of , .(2) The -internal edg of , .(3) The -internal edg of , .(4) The external edg of , .(5) The -external edg of , .(6) The -external edg of , .(7) The boundary of , .(8) The -boundary of , .(9) The -boundary of , .(10) The exterior of , .(11) The -exterior of , .(12) The -exterior of , .(13).(14).(15).(16).

*Remark 21. * As shown in Figure 1, the study of -approximation spaces is a generalization for study of approximation spaces. Because of the elements of the regions [], [], and [] will be defined well in , while this points was undefinable in Pawlak’s approximation spaces. Also, the elements of the region [], [], and [] do not be belong to , while these elements was not well defined in Pawlak’s approximation spaces.

Figure 1 shows the above 24 regions.

Theorem 22. *For any topological space generated by a binary relation on , we have, .*

* Proof. *, that is, .

Also,

, that is, .

Consequently, .

*Definition 23. *Let ) be a -approximation space and . Then there are memberships and , say, -strong and -weak memberships respectively which defined by (1) iff ,(2) iff .

*Remark 24. *According to Definition 28, -lower and -upper approximations of a set can be written as (1),(2).

*Remark 25. * Let ) be a -approximation space and . Then (1), (2).

The converse of Remark 25 may not be true in general as seen in the following example.

*Example 26. * In Example 17. Let , we have but . Let , but . Let we have but . Let , but .

Let be a finite nonempty universe, , we can characterize the degree of completeness by a new tool named -accuracy measure defined as follows

*Example 27. * In Example 17, we can deduce the following table showing the degree of accuracy measure , -accuracy measure and -accuracy measure for some sets, see Table 1.

We see that the degree of exactness of the set by using accuracy measure equal to , by using -accuracy measure equal to . Also, the set by using -accuracy measure equal to and by using -accuracy measure equal to . Consequently -accuracy measure is better than accuracy and -accuracy measures in this case.

We investigate -rough equality and -rough inclusion based on rough equality and inclusion which introduced by Novotný and Pawlak in [7, 40].

*Definition 28. * Let be a -approximation space, . Then we say that and are (i)-roughly bottom equal if ,(ii)-roughly top equal if ,(iii)-roughly equal if and .

*Example 29. * In Example 17, we have the sets , are -roughly bottom equal and , are -roughly top equal.

*Definition 30. *Let be a -approximation space, . Then we say that (i) is -roughly bottom included in if ,(ii) is -roughly top included in if .(iii) is -roughly included in if and .

*Example 31. *In Example 17, we have is - roughly bottom included in . Also, is - roughly top included in . Also, is -roughly included in .

#### 4. -Rough Sets

We introduced a new concept of -rough set.

*Definition 32. *For any -approximation space , a subset of is called: (1)-definable (-exact) if ,(2)-rough if .

*Example 33. *Let be a -approximation space as in Example 17. We have the set is -exact while is -rough set.

Proposition 34. * Let be a -approximation space. Then *(1) every exact set in is -exact,(2) every -exact set in is -exact,(3) every -rough set in is -rough,(4) every -rough set in is rough.

* Proof. *Obvious.

The converse of all parts of Proposition 34 may not be true in general as seen in the following example.

*Example 35. *Let be an -approximation space as in Example 17. Then the set is -exact but not exact, the set is -exact but not -exact, the set is -rough but not -rough and the set is rough but not -rough.

*Definition 36. *Let be a -approximation space, the set is called: (1)roughly -definable, if and ,(2)internally -undefinable, if and ,(3)externally -undefinable, if and , (4)totally -undefinable, if and .

We denote the set of all roughly -definable (resp., internally -undefinable, externally -undefinable and totally -undefinable) sets by (resp., , and ).

*Remark 37. *For any -approximation space . The following are hold: (1),
(2),
(3),
(4).

*Example 38. * In Example 17, we have the set but . The set but . The set but .

#### 5. Conclusion

In this paper, we used the class of -sets to introduce a new type of approximations named -approximation operator. Also, using -approximation we can obtain 24 dissimilar granules of the universe of discourse. Our approach is the largest granulation based on -open sets in topological spaces. This made the accuracy measures higher than the use of any type of near open sets such as, -open, -open, and preopen sets. Some important properties of the classical. Pawlak’s rough sets are generalized. Also, we defined the concept of rough membership function using -sets. It is a generalization of classical rough membership function of Pawlak rough sets. The generalized rough membership function can be used to analyze which decision should be made according to a conditional attribute in decision information system. The rough set approach to approximation of sets leads to useful forms of granular computing that are part of computational intelligence.