Two Different Views for Generalized Rough Sets with Applications

: Rough set philosophy is a signiﬁcant methodology in the knowledge discovery of databases. In the present paper, we suggest new sorts of rough set approximations using a multi-knowledge base; that is, a family of the ﬁnite number of general binary relations via different methods. The proposed methods depend basically on a new neighborhood (called basic-neighborhood). Generalized rough approximations (so-called, basic-approximations) represent a generalization to Pawlak’s rough sets and some of their extensions as conﬁrming in the present paper. We prove that the accuracy of the suggested approximations is the best. Many comparisons between these approaches and the previous methods are introduced. The main goal of the suggested techniques was to study the multi-information systems in order to extend the application ﬁeld of rough set models. Thus, two important real-life applications are discussed to illustrate the importance of these methods. We applied the introduced approximations in a set-valued ordered information system in order to be accurate tools for decision-making. To illustrate our methods, we applied them to ﬁnd the key foods that are healthy in nutrition modeling, as well as in the medical ﬁeld to make a good decision regarding the heart attacks problem. Author Contributions: Conceptualization, M.A.E.-G. and M.K.E.-B.; methodology, M.K.E.-B.; valida-tion, R.A.-G., M.A.E.-G. and K.K.F.; formal analysis, M.K.E.-B.; investigation, M.A.E.-G. and K.K.F.; data curation, R.A.-G. and K.K.F.; writing—original draft preparation, M.K.E.-B.; writing—review and editing, M.K.E.-B. and M.A.E.-G.; project administration, M.K.E.-B.; funding acquisition, R.A.-G.


Introduction
Rough set theory, proposed by Pawlak [1,2], has been conceived as a tool to conceptualize and analyze various kinds of data. It can be used in attribute value representation models to describe the dependencies among attributes, evaluate the significance of attributes and derive decision rules. The theory presents important applications to intelligent decision-making and cognitive sciences, as a tool for dealing with vagueness and uncertainty of information [3][4][5][6][7][8][9][10][11]. Originally, the rough set theory was based on an assumption that every object in the universe of discourse is associated with some information. Objects which are characterized by the same information are indiscernible. The indiscernibility relation generated in this way shapes the mathematical basis for the theory of rough sets. The set of all indiscernible objects is called an elementary set or equivalent class. Any set of objects, being a union of some elementary sets, is referred to as a crisp set; otherwise it is called a rough set. A rough set can be described by a pair of crisp sets, called the lower and upper approximations. However, this relation represents the basic block in this methodology which is an equivalence relation. But the constraints of this relation restrict the application fields.
By relaxing indiscernibility in relation to more general binary relation, the classical rough set can be extended to a more general model. Slowinski and Vanderpooten [12], (1) To initiate a novel neighborhood (so-called basic-neighborhood) construct from any general binary relation and study its properties; (2) To propose new generalized rough approximations and investigate their properties based on this neighborhood; (3) To solve some problems in set-valued ordered information systems concerning finding the key foods suitable in order to be healthy.
Consequently, the main goals of our approaches were to extend the application fields of rough sets by applying the proposed techniques in decision-making problems such as finding the key foods that are healthy in nutrition modeling, and also in the medical diagnosis of the heart attacks problem. Besides, introducing and studying a novel approach to generalize rough sets of multi-information systems based on a finite number of binary relations. In other words, the main objectives of the present work are to use an arbitrary binary relation to generalize the equivalence relation in the element-based definition from a neighborhood's point of view. Neighborhood systems are a pivotal technique to reduce the boundary region and to improve the accuracy measure. Thus, we suggested the new notion "basic-neighborhood" which is induced via a general binary relation to investigate this aim. On the other hand, the concept of a neighborhood generated by relations represents a vital bridge between the rough set theory and the other important models such as graph theory, which has many different applications in real-life problems. In simple directed graphs, the rough set theory is used to study nano-topology. Adjacent vertices in digraphs are only used to define their neighborhoods. Therefore, we can use the basic-neighborhoods to introduce new types of vertices neighborhood systems that are dependent on both adjacent vertices and associated edges. Furthermore, the generalization of some concepts presented by Pawlak and Lellis Thivagar, as well as some of their properties, are investigated. Lellis Thivagar has introduced the concept of "nano-topology" based on Pawlak's rough sets which depend basically on an equivalence relation. Accordingly, their methods restrict the application fields of real-life problems. Thus, we can extend the application fields of graph theory such as "present a new model of the human heart's blood circulation system based on blood paths and introduce a modern model to smart city which makes a restructuring for the factors which build smart cities in terms of a connected graph".
The remainder of the paper is organized as follows: The next section provides the basic concepts and results that are used in the paper. Section 3 is devoted to defining the new neighborhood (basic-neighborhood) and to study its properties. Further, we examined the relationships of this neighborhood with other neighborhoods. The main goal of Section 4 was to suggest two different methods to generalize Pawlak rough sets. The first method depends basically on the basic-neighborhood that is induced from any general binary relation and hence we proved that the proposed approximations are generalizations to the Pawlak approach and their generalizations included . In the second method, we presented an improvement to Marei's method [31]. We introduced a novel method for generalized rough approximations based on a finite number of binary relations. This method solved the problems in multi-information systems which depend on many attributes and hence, this method extends the application fields of rough set theory. Comparisons between the proposed methods and the other techniques mentioned in the introduction section were investigated. Finally, in the last section, we introduced two real-life applications, the first of which was in nutrition modeling for our methods. This application shows the significance of our approaches in decision-making. The second was in medical applications; we illustrated the importance of the suggested methods in decision making regarding the heart attacks problem.

Pawlak Rough Sets and Some of Its Generalizations
This section provides the basic concepts and results Pawlak's rough sets, as well as some of their generalizations (namely, Yao [18], Allam et al. [19], Dai et al. [15], and Marei [31]) that are used in the paper.

Pawlak Rough Set Theory
Definition 1 ([37]). A binary relation R between the two sets M and N (or from M to N ) is a subset of the Cartesian product M × N , which is a set of ordered pairs ( , ) ∈ R where ∈ M and ∈ N .
Note that: If R is a binary relation from a set M to itself, then it is said to be a binary relation on M. Moreover, if ( , ) ∈ R, then we write R to express that is R-related to . On the other hand, the class R = { ∈ M : R } (resp. R = { ∈ M : R }) is called the after set (resp. fore set) of ∈ M. In the other words, R (resp. R ) is interpreted as the right-neighborhood (resp. left-neighborhood) [18].
). Suppose that R eq represents an equivalence relation on the finite non-empty set S, called the universe; thus, the pair P = S, R eq is said to be the Pawlak approximation space. In addition, the Pawlak-lower (resp. Pawlak-upper) approximation of a subset M ⊆ S is: (i) The subset M is called an exact set if P * (M) = P * (M) and we refer to the pair (P * (M), P * (M)) by rough sets with respect to R eq . Otherwise, M is called a rough set; (ii) If M is exact, then Bnd R eq (M) = Φ and Θ R eq (M) = 1. On the other hand, if M is rough, then Bnd R eq (M) = Φ and Θ R eq (M) = 1.

Yao's Rough Sets
Definition 3 ([18]). If R is a binary relation on the universe S, then for each ∈ S, we propose its "right neighborhood" by ( ) = { ∈ S : R }.

Definition 4 ([18]
). If R is a binary relation on the universe S, then the right-lower and rightupper approximations of M ⊆ S are proposed, respectively, by: The right-boundary and the right-accuracy of approximations of a subset M ⊆ S are defined, respectively, by: Note that: The above approximations satisfied some properties of Pawlak's basic properties in a general case and the remainders of the properties are achieved only if the relation is a preorder relation.

Allam et al.'s Rough Sets
Definition 5 ([19]). Consider that R represents an arbitrary binary relation on the universe S. The minimal neighborhood (briefly, -neighborhood) of ∈ S, is given by: Definition 6 ( [19]). Consider that R represents an arbitrary binary relation on the universe S. Then the minimal-lower (resp. minimal-upper) approximations are: The boundary and the accuracy of minimal-approximations of a subset M ⊆ S are given, respectively, by: Note that: The above approximations satisfied some properties of Pawlak's basic properties in a general case and the remainders of the properties are achieved only if the relation is a reflexive relation.

Dai et al.'s Rough Sets
Definition 7 ([15]). Consider that R represents an arbitrary binary relation on the universe S. The maximal neighborhood (briefly, -neighborhood) of ∈ S, is given by: Definition 8 ([15]). Consider that R represents an arbitrary binary relation on the universe S. Then, the maximal-lower (resp. maximal-upper) approximation of M ⊆ V is given by: The boundary and the accuracy of maximal-approximations of a subset M ⊆ V are given, respectively, by: Note that: The above approximations satisfied some properties of Pawlak's basic properties in a general case and the remainders of the properties are achieved only if the relation is a similarity relation. Marei (2007), in [31], proposed a framework for generalizing Pawlak's rough sets based on a finite number of reflexive relations as shown in the following definitions. Definition 9 ([31]). Consider {R i : = 1, 2, 3, . . . , n} to be a family of binary relations on S. Then:

Marei's Rough Sets
(i) The first kind of n-lower (resp. n-upper) approximation of M ⊆ S is given by: (ii) The first kind of n-lower (resp. n-upper) approximation of M ⊆ S is given by: The boundary region and the accuracy of n-approximations of M ⊆ S are given, respectively, where n k R(M) = Φ and k ∈ {1, 2}.
Note that: The above approximations satisfied some properties of Pawlak's basic properties in a general case and the remainders of the properties are achieved only if the relation is a reflexive relation.

New Types of Generalized Neighborhoods
This section introduces and studies a novel kind of neighborhood (called basicneighborhood) which is induced from a binary relation. In fact, this neighborhood represents the reverse definition for the neighborhood "initial-neighborhood" [8]. Moreover, these two neighborhoods represent an extension of the concept of "core-neighborhood" [37]. Comparisons between the suggested neighborhood and the other types are superimposed.
First, let us remember the definition of "initial-neighborhood" and "core-neighborhood": . Consider that R is an arbitrary binary relation on the universe S. The initial-neighborhood of ∈ S is: ([37]). Consider that R is an arbitrary binary relation on the universe S. The core-neighborhood of ∈ S is given by: The following definition introduces the new notion of a neighborhood of an element induced by a binary relation which represents the opposite concept of the "initialneighborhood".

Lemma 2.
If R is a binary relation on S. Then, for each ∈ S: Lemma 3. If R is a reflexive relation on S, then, for each ∈ S: Proof. We proved (a) and in a similar way it is easy to demonstrate (b).
If a similarity relation on S. Then, for each ∈ S: Note that: The inverse of the above result is not correct generally.

Lemma 4.
If R is a transitive relation on S, then ( ) ⊆ ( ), for each ∈ S.
Conversely, let ∈ ( ). Then ( ) ⊆ ( ) . . . (2) Thus, we need to prove that belongs to every after set that contains as follows: Let ∃ ∈ S such that ∈ R and / ∈ R. Then, R and by (2), ∈ R (by reflexivity of R) which tends to R and R such that / ∈ R which is a contradiction to R is a transitive relation. Thus, ∈ R and this implies must be belonging to every after set containing . Therefore, ∈ ( ) and hence ( ) ⊆ ( ).

Two Different Views for Generalized Rough Sets via Basic Neighborhoods
In the present section, we suggest and study two different methods to generalize and improve Pawlak's rough set models. The second method is very important for multiinformation systems and hence, it can be useful in multi attributes decision making. Many comparisons between the proposed approaches and the previous methods (namely, Yao [18], Allam et al. [19], Dai et al. [15], and Marei [31]) are investigated.

The First Method to Generalization Based on a One Binary Relation
Based on the neighborhood (basic-neighborhood), new rough approximations are presented and their properties are studied. We proved that these approaches are stronger than the other methods.
Definition 13. Consider R is any arbitrary binary relation on S. The basic-lower (resp. basicupper) approximation of M ⊆ S is given by: The boundary and the accuracy of maximal-approximations of a subset M ⊆ S are given, respectively, by: Obviously, 0 ≤ Θ (M) ≤ 1 and if Θ (M) = 1 , then M is a basic-exact set (briefly, -exact). Otherwise, it is a basic-rough set (briefly, -rough).
The following proposition provides the main properties of the "basic-approximations". Theorem 1. If R is an arbitrary binary relation on S, and M, N ⊆ S. Then, the following axioms are held: Proof. The properties (L1-L3, LU) and (U1-U3) are straightforward. Thus, we prove the remaining properties as follows: In similar way, we can prove the properties (U4) and (U8). By using Corollary 2, we can easily prove the following result. Thus, the proof was omitted.
Theorem 2. If R is an equivalence relation on S, and M ⊆ S, then the following is held: Remark 8. The above results (Theorems 1 and 2) proved that the suggested approximations (basicapproximations) represent the natural generalization to Pawlak's rough set methodology and its generalizations. Since our methods satisfy all properties of Pawlak's models without any constraints, and thus these extend the application field of this interesting theory in many real-life problems and sciences.

The Second Method to Generalization Based on a Finite Number of Binary Relations
This subsection is devoted to suggesting generalized rough sets based on a finite number of binary relations. In fact, we extend Marei's [31] definition to any binary relation and provide some modifications and improvements for his approaches. Moreover, our approaches solve some problems in Marei's definition. Definition 14. Consider {R i : = 1, 2, 3, . . . , n} to be a family of binary relations on S. Then: (i) The first kind of n-basic lower (resp. n-basic upper) approximation of M ⊆ S is given by: (ii) The second kind of n-basic lower (resp. n-basic upper) approximation of M ⊆ S is given by: The boundary and the accuracy of n-basic approximations of a subset M ⊆ S are given, respectively, by: It is easy to prove the next results using Theorem 1, so we omitted the proof.  The elementary objective of the following result is to explain the relationship between the first and second kinds of n-basic approximations. Note that: The opposite statements in the above result need not be true, in general, as illustrated in the following example. Hence, we attain the following:

Comparisons between the Suggested Approaches and the Other Methods
The following results demonstrate the relationships among the suggested approximations (b-approximations) and some of the other approaches (existing methods in the literature).

Case (1): General binary relation.
Firstly, the different approximations (Yao [18], Allam [19], Dai [15], and current approaches) are independent. Further, the previous methods failed in satisfying the basic properties of Pawlak's methodology. On the other hand, our approaches satisfy all Pawlak's exact criteria for rough sets in general case without any restrictions. The following example shows these facts.
Thus, we shall compute the approximations for all subsets of S using the suggested method (in Definition 13) and Allam et al.'s method (in Definition 4) as shown in Table 1.     Table 1, we can notice the following: (i) The Yao, Allam, and Dai methods are not suitable to approximate the rough sets in the general case, since they could not be applied for any relation (since the main properties of the approximations did not hold), and thus these methods restrict the applications of rough set theory, for instance: For example, see the highlighted cells in Table 1. Accordingly, these methods make some contradictions to the rough set theory. Further, all subsets were rough according to these methods and this represents vagueness for data; (ii) On the other hand, our methods in the present paper were the best methods for approximating the sets in the general case, since these approximations satisfied all properties of Pawlak's rough sets without any conditions or restrictions. Therefore, the suggested method can help in discovering the vagueness in the data.

Case (2):
Special cases of a binary relation. Now, the different approximations (Yao [18], Allam [19], Dai [15], and current approaches) are independent. The following theorem demonstrates this fact. Proof. According to Lemma 2, the proof is obvious. Corollary 3. If R is a reflexive relation on S, then for each M ⊆ S: Note that: The opposite of the previous results is not true in general as shown in the next example. According to Lemma 4, we can easily prove the following theorem. Thus, the proof was omitted.  According to Lemma 4, we can easily prove the following theorem. Thus, the proof was omitted.   The core objective of the next result is to prove that our methods represent a generalization to Marei's approaches. The core objective of the next result is to prove that our methods represent a generalization to Marei's approaches. Proof. We shall verify (i) only in the case of k = 1, and the others similarly.
Let ∈ n 1 R(M), then ∩ n i=1 R i ⊆ M. However, by using Lemma 2, ( ) ⊆ R, for each ∈ S. Hence, ∩ n i=1 ( ) ⊆ ∩ n i=1 R i ⊆ M and then ∈ n 1 R (M). Therefore, n 1 R(M) ⊆ n 1 R (M). Similarly, we can prove that: Note that: The next example demonstrated that the inverse of Theorem 8 was not correct generally.  Note that: We present the following example to show that the relationship between Marei's techniques and our approaches in the general case. Besides, this example illustrates that the suggested methods improve and solve the errors in the last methods (Marei's methods).

Applications
Here, we present two real-life applications to illustrate the importance of the suggested techniques.

Set-Valued Information Systems
Set-valued information systems represent generalized models of single-valued information systems. Firstly, in this subsection, we provide some fundamental concepts of set-valued information systems.
Definition 15 [10]. Suppose that S represents a finite set of objects, called the universe of discourse, A be a finite set of attributes such that, for each attribute ∈ A , associated with a set of its values V , and the map F : S × A → V is a total function such that F ( , ) ⊆ V for every ∈ A , ∈ S, and V = ∪ ∈A V called an information function. The quadruple (S, A , V, F ) is called a single-valued information system if each attribute has a unique attribute value; if a system is not a single-valued information system, it is called a multi-valued information system (or set-valued information system).
Note that: If the set of attributes A is divided into condition C and decision attributes, then this information system is called a set-valued decision information system and denoted by DIS = (S, C ∪ { }, V, F ), where A = C ∪ { }, C is a finite set of condition attributes, and is a decision attribute with C ∩ = Φ. If the domain (scale) of a condition attribute is ordered according to a decreasing or increasing preference, then the attribute is a criterion.
Definition 16 [10]. In any set-valued information system (S, A , V, F ), if the domain of a condition attribute is ordered according to a decreasing or increasing preference, then the attribute is a criterion. If every condition attribute is a criterion, then it is said to be a set-valued ordered information system. Definition 17 [10]. If the values of some objects in S under a condition attribute can be ordered according to an inclusion increasing or decreasing preference, then the attribute is an inclusion criterion.

Decision-Making of Multi-Information System of Nutrition Modeling via B-Rough Approximations
Each nutrient performs one or more of the general functions listed below. Heat, energy, and power are provided by carbohydrates and fats. Proteins, minerals, and vitamins help to build and promote growth, as well as renew and regulate body tissues and processes. For practical purposes, the recommended daily dietary allowances are divided into the following basic food groups, which are represented by a table.
Consider Table 2, which contains information about eight adolescents' eating habits. Table 2. Multi-information system of eight adolescents' eating habits. Accordingly, Table 2 represents a set valued ordered information system, where S = {ℊ 1 , ℊ 2 , ℊ 3 , . . . , ℊ 8 } is a finite set of students and A = {A 1 , A 2 , A 3 , A 4 , A 5 } is a finite set of attributes of the basic food groups and D is the decision attribute. The set of attribute values is given by V A = {C, P, F , V, M}, where C, P, F , V and M interpret, respectively, as carbohydrate, protein, fat, vitamins, and minerals.
Thus, Table 2 represents a multi-valued information system with general binary relations: The above relations are transitive. Thus, Pawlak's approach and some of its generalizations (such as Allam, Yao, Dai, and Marei methods) did not apply here and hence they could not deal with this problem, as illustrated in the following application.
Therefore, we use the approximations in Definition 14 to make an accurate decision for the nutrition system in Table 2.
Accordingly, Tables 3 and 4 provide the right and -neighborhoods of Table 2. Thus, by using Definition 14 we attain:  Table 2. Students n A 1 (ℊ ℊ ℊ ) n A 2 (ℊ ℊ ℊ ) n A 3 (ℊ ℊ ℊ ) n A 4 (ℊ ℊ ℊ ) n A 5 (ℊ ℊ ℊ ) We computed the approximations, the boundary region, and the accuracy of the approximations of only two decision sets (healthy set and unhealthy set) using the proposed method in Definition 14 and the other previous methods. Thus, we explain the importance of the suggested techniques in approximating the sets for helping in decision-making. From Table 2: The set of healthy food was H = {ℊ 2 , ℊ 3 , ℊ 5 , ℊ 6 , ℊ 8 }.
According to Marei's approach: 5 1 R(H) = S and 5 1 R(H) = Φ. This means that H is totally rough set according to Marei's technique. Therefore, we were unable to decide whether the healthy or unhealthy food. On the other hand, there were some contradictions to Pawlak's axioms [1], namely 5 1 R(H) H 5 1 R(H). According to our approach (Definition 14 (i)): 1 R (H) = H and 5 1 R (H) = S. This means that the set {ℊ 2 , ℊ 3 , ℊ 5 , ℊ 6 , ℊ 8 } only represented the healthy food, which coincided with the decision system Table 2. Moreover, 5 1 R (H) ⊆ H ⊆ 5 1 R (H). Observation: From the above comparisons, we noticed the following: (1) We could not use Pawlak's rough set model in the previous application because of its transitivity as we applied Pawlak's rough set model only in the case of equivalence relation. Moreover, these methods were applied easily without restrictions, so this may expand the field of the application of Pawlak's rough sets; (2) Using Marei's methods was not suitable for obtaining an accurate decision, since they produced some contradictions and vagueness. Consequently, we were unable to decide the suitable healthy food; (3) On the other hand, by using the suggested approximations, we confirmed between the experimental data and its mathematical analysis. The mathematical study depends on the classification of data by using the -neighborhoods. Hence, we minimized the vagueness in the data and also obtained a higher accuracy measure. Accordingly, we can say that the suggested approximations were more accurate than the previous methods for extracting the information and helping to eliminate the ambiguity of the data in the real-life problems, especially in the medical diagnosis which needed accurate decisions.

A Medical Application in Decision-Making of the Heart Attacks Problem
Since medical diagnosis always needs accurate tools to make decisions, we then applied the proposed methods in decision making to heart attacks. The data set in Table 5 shows the outcomes of five symptoms for twelve patients. The research was carried out at Al-Azhar University's cardiology department [38] (Hospital of Sayed Glal University-Cairo, Egypt). The study included twelve patients who presented to this hospital with different symptoms, as well as a detailed history, physical examination, full labs, a resting ECG, and a conventional echo assessment. In the end, the diagnosis of heart attacks was confirmed or ruled out. In other words, the columns represent the symptoms. Thus, the set of attributes was A = {A 1 , A 2 , A 3 , A 4 , A 5 }, where A 1 represents the breathlessness, A 2 represents the orthopnea, A 3 represents the paroxysmal nocturnal dyspnea, A 4 represents reduced exercise tolerance, and A 5 represents ankle swelling. Attribute D is the decision of heart attacks. On the other hand, the rows in Table 5 represent the patients, where = { 1 , 2 , · · · , 12 }. In the present application, we used a general binary relation to illustrate the significance of the suggested technique in decision-making. Therefore, the other methods (such as Pawlak [1,2], Yao [18], Allam [19], and Dai [15]) could not be applied here and hence we could say that our technique extended the application field of rough sets. Accordingly, we demonstrated that the suggested tools were more accurate than the other methods.
To determine the symptoms of every patient, we defined a map V : → P ( ) such that a symptom belonged to V( ), ∀ = 1, 2, . . . , 12 if the patient had this symptom. Therefore, from Table 5, we obtained the symptoms of every patient as follows: Thus, we could generate a binary relation between the patients depending on the map V as follows: R | ⇔ V( ) V | , for each , | ∈ {1, 2, . . . 12}. Note that: The relation was identified according to the viewpoint of the system's experts. Here, "yes" interpreted the patient had symptoms and "no" interpreted the patient had no symptoms.
Thus, we attained the following: Thus, the right neighborhoods of each element in of this relation were: Thus, Table 5 represents a decision system and thus the patients with confirmed heart attacks were surely H = { 1 , 3 , 8 , 9 }. Thus, we computed the approximations, the boundary, and the accuracy measure of H using the suggested method and the previous approach [15] to explain the significance of the suggested techniques in decision-making.
Concluding remark: From the above comparison, we noticed the following: (1) Pawlak's rough set model cannot be used in the above application because the used relation was transitive. Pawlak's rough set model was applied only when the relation was an equivalence relation. On the other hand, the suggested 664 methods were applied and hence, this extended the application fields of Pawlak's rough sets; (2) Using Dai et al.'s methods was not suitable for obtaining an accurate decision, since the boundary region was Bnd (H) = { 2 , 4 , 5 , 6 , 9 , 10 }, and the accuracy measure was Θ (H) = 2/7, which meant that all patients in may have been infected, although the infected patients were surely specified with the set H = { 1 , 3 , 8 , 9 }. Consequently, we were unable to decide whether the patient was infected with heart attacks, and this produced vagueness in decision making regarding the medical diagnosis; (3) On the other hand, using the suggested approximations, we attained the boundary Bnd (H) = { 2 , 4 , 5 , 6 , 9 , 10 }, and the accuracy measure was Θ (H) = 4 9 . Hence, we minimized the vagueness in the data and also obtained a higher accuracy measure. Accordingly, we can say that the suggested approximations were more accurate than the previous methods for extracting the information and helping to eliminate the ambiguity of the data in real-life problems, especially in the medical diagnosis which needed accurate decisions.

Conclusions
The philosophy of rough sets is characteristically considered a creation based on the idea of an approximation space and the constructed lower and upper approximations of subsets of a universe. In the original rough set theory, the constraint of the equivalence relation has excessively restricted those energies against the application's fields of this theory. Thus, in the present paper, we introduced two different methods to generalize this theory. These methods were based on a novel neighborhood that was induced from a general binary relation. The first method depended on one binary relation to define the approximations which were compared with the previous approaches. Theorems 1, 2, 6 and 7 and Corollary 3 proved that the suggested methods represented a generalization to Pawlak's models and their generalizations. Furthermore, the generalization of some concepts which were presented by Pawlak and Lellis Thivagar, as well as some of their properties, can be investigated using the basic-rough sets. Since Lellis Thivagar introduced the concept of "nano-topology" based on Pawlak's rough sets, which are basically dependent on an equivalence relation, their methods restricted the application fields of real-life problems. Thus, we extended the application fields of graph theory. Moreover, these results illustrate that our approaches were more accurate and stronger than the other methods, such as Yao [18], Allam [19], Dai [15], and Marei [31]. In the second method, we succeeded in presenting improvements to Marei's methods. Consequently, the second method was to propose new methods for generalizing rough sets by a finite number of binary relations which were induced in multi-information systems, and hence we extended the application field of rough set theory in order to solve many problems of multi-attribute decision-making (MADM).
Finally, to illustrate the significance of the suggested methods, two different applications were investigated. First, we applied the proposed method in multi-information systems of nutrition modeling, and hence we succeeded in identifying the best feeding systems that were healthy. In medicine, the medical diagnosis always needs accurate tools to make the decision, so we applied the proposed methods in decision-making to the issue of heart attacks. We used a data set of five symptoms for twelve patients. The research was carried out at Al-Azhar University's cardiology department [38] and hence, we proved that the suggested methods were more accurate than the other methods (namely, Yao [18], Allam [19], Dai [15], and Marei [31]). In fact, we set an establishment between the experimental data and its mathematical analysis.
Overall, this work supplies a readable framework to the respective areas with interesting applications such as COVID-19, MADM, and graph theory. Generalized rough sets based solely on binary relations may not support MADM, so in our future work, we will study the suggested approaches in MADM as a starting point for future research. Further, we will use the proposed methods in extending the theory of fuzzy soft sets.