Pessimistic Multigranulation Roughness of a Fuzzy Set Based on Soft Binary Relations Over Dual Universes and Its Application

: The rough set model for dual universes and multi granulation over dual universes is an interesting generalization of the Pawlak rough set model. In this paper, we present a pessimistic multigranulation roughness of a fuzzy set based on soft binary relations over dual universes. Firstly, we approximate fuzzy set w.r.t aftersets and foresets of the ﬁnite number of soft binary relations. As a result, we obtained two sets of fuzzy soft sets known as the pessimistic lower approximation of a fuzzy set and the pessimistic upper approximation of a fuzzy set—the w.r.t aftersets and the w.r.t foresets. The pessimistic lower and pessimistic upper approximations of the newly proposed multigranulation rough set model are then investigated for several interesting properties. This article also addresses accuracy measures and measures of roughness. Finally, we give a decision-making algorithm as well as examples from the perspective of application.


Introduction
We come across various problems in our surroundings that involve some uncertainties.For example, the notion of beautiful guys is imprecise (uncertain), because we cannot uniquely classify all beautiful guys into two classes: beautiful guys and not beautiful guys.Thus the beauty is not exact but rather an uncertain (vague) concept.For this reason, uncertainty is important to philosophers, mathematicians, and recently also computer scientists have turned their interest to these vague (uncertainty) concepts.There are several theories for dealing with uncertainty, including probability theory, vague set theory, and interval mathematics.Each approach has its advantages and disadvantages.
Zadeh [1] developed the concept of a fuzzy set, which was the first successful approach to imprecision.Sets are defined by partial membership in this technique, as opposed to exact membership in the classical set.It can deal with problem uncertainties and solve the problems of decision-making.Each of these theories is well-known and frequently beneficial for characterizing imprecision, but each of them has its own number of difficulties, as indicated in [2].In 1999, a Russian mathematician Molodtsov [2] presented a novel mathematical framework to deal with impression.This novel approach is know as soft set theory (SST).SST is a new technique that avoids the problems that present in existing theories.This theory has wider applications.Maji et al. [3,4] provided the first practical implementations of soft theory, as well as establishing many operations and a theoretical study on SST.Ali et al. [5] introduces various additional operations on SS and improves the concept of a SS complement.To solve a problem in soft sets theory, the parameters are usually ambiguous phrases or sentences involving vague terms.Maji et al. [6] defined a fuzzy soft set (FSS) as a combination of (FS) and (SS).FSS can deal with the problems of DM in real life.Roy and Maji [7] discussed an FSS theoretic approach towards a discussion DM, Yang et al. [8] presented the notion of interval valued FSS, and the interval valued FSS is being used to examine a DM problem, Bhardwaj et al. [9] recently discussed an advanced uncertainty measure based on FSS, as well as its application to DM problems.Yang et al. [10] presented the notion of FS matrices and their applications.Petchimuthu et al. [11] discussed the mean operators and generalized products of fuzzy soft matrices and their applications in MCGDM.They also discussed the adjustable approaches to multi-criteria group decision making based on inverse fuzzy soft matrices in [12].
Another mathematical method for dealing with problem containing imprecision is the rough set theory (RST), which was presented by Pawlak in 1982 [13].RST is a frequently used method for dealing with imprecision.Similar to FST, it is not an alternative to traditional set theory, but rather an integrated part of it.RST has the advantage of requiring no preliminary or supplemental data knowledge, such as statistical probability.Many applications of RST have been discovered.Machine learning, information acquisition, decision making, knowledge production from databases, expert systems, inductive reasoning, and pattern recognition are just a few examples.The rough set technique is crucial in artificial intelligence and cognitive sciences [13][14][15].Partition is the foundation of Pawlak's RST.Many application are restricted by such a partition, because it can only deal with complete data.To address these issues, tolerance relations, similarity relations, general binary relations, neighborhood systems, and others are used in place of partitions.Feng et al. [16] combined SS with FS and RS, the RSS and SRS are investigated in [17][18][19], the rough set approximation based on SBr and knowledge bases was discussed by Li et al. [20], Meng et al. [21] discussed SRFS and SFRS, Zhang et al. [22] presented novel FRS models and corresponding applications to MCDM.Many authors have blended the concepts of FS and RS in various ways, as demonstrated in [23][24][25][26].
In many practical situations, the usual RS model is built on a single equivalence relation, which has difficulties when dealing with multi-granulation information.To address these issue, Qian et al. [27][28][29] proposed a multi-granulation rough sets (MGRS) model to approximate a set in w.r.t finite number of equivalence relations rather than a single equivalence relation, Qaian et al. [30] also presented Pessimistic RS based decisions, a fusion strategy.Many scholars from all around the world have been drawn to MGRS and have contributed significantly to their development and applications.Xu et al. [31,32] discussed two types of MGRSs based on ordered and tolerance relations, FMGRS can be found in [33][34][35], new types of dominance based MGRS and their applications in conflict analysis problems were described by Ali et al. [36].Xu et al. [37] created two new forms of MGRS., Lin, et al. [38] discussed neighborhood-based MGRS, MGCR was discussed by Liu et al. [39], Kumar et al [40] proposed a OMGRS based classification for medical diagnostics, and Huang et al. [41] combined the idea of MGRS and intuitionistic FS and defined intuitionistic FMGRSs.
In reality, many practical problems, such as disease symptoms and medications used in disease diagnostics, contain multiple universes of objects.The Pawlak RS model deals with the problems of a single universe.To address these issue, the RS model over dual universes was presented by Liu [42] and Yan et al. [43], establishing a relationship between the RS model over a single universe, and the RS model over dual universes was discussed.To measure the uncertainty of knowledge, Ma and Sun [44] proposed probabilistic RS over dual universes, the graded RS model based on dual universes and its features were addressed by Liu et al. [45], Shabir et al. [46] discussed approximation of a set based on SBr over dual universes and their application in the reduction of an information system, Zhang et al. [47] generalized FRS to dual universes with interval valued data, Wu et al. [48] discussed FR approximation over dual universes, and Sun et al. [49] presented MGRS over dual universes of objects.MGRS in two universes is a well-structured framework for dealing with a variety of decision-making problems.It has become a hot topic in the field of multiple decision problems, attracting a wide spectrum of theoretical and application studies.Zhang et al. [50] described the Pythagorean FMGRS and its applications in mergers and acquisitions, Sun et al. [51,52] described the MGFRS over dual universes and its application to DM and three way GDM.Multigranulation vague rough set and diversified binary relation based FMGRS over dual universes and application to multiple attribute GDM can be found in [53,54], Zhang et al. [55] proposed a steam turbine defect diagnostic model based on an interval valued hesitant FMGRS over dual universes, and Tan et al. [56] presented granulation selection and DM with MGRS over dual universes.
Qian et al. [27][28][29][30], presented the notion of MGRS based on multi equivalence relations over an universe, Sun et al. [49] generalized this notion and introduced optimistic and pessimistic MGRS over dual universes, replacing equivalence relations with general binary relations from an universe set U to V. On the other hand, Shabir et al. [46], generalized these concepts of RS and replaced relation by SBr from an universal U to V..The MGRS based on SBr was recently presented by Shabir et al. [57].This paper mainly focuses on pessimistic MGRFS based on BSr over dual universes U and V and approximates an FS λ ∈ F(V) by using the aftersets of SBr and approximates an FS γ ∈ F(U) by using foresets of SBr, where λ, γ are fuzzy sets in U, V respectively.F(U) and F(V) represent a set of all fuzzy sets in U, V respectively.After that, we looked at some of the algebraic properties of our proposed model.
The rest of the paper is laid out as follows.Section 2 recalls the basic concepts of FS, Pawlak RS, MGRSs, SBr, and FSS.Section 3 presents the pessimistic MGR of a FS over dual universes by two SBrs and their basic algebraic properties and examples.Section 4 presents the pessimistic MGR of an FS over dual universes by multi SBrs and their basic algebraic properties.In Section 5 the accuracy measures of the pessimistic MGFSS are presented.In Section 6 we focus on algorithms and a practical example about DM problems.Finally, in Section 7 we conclude the paper.

Preliminaries
This section introduces the fuzzy set, rough set, multi-granulation rough set, soft set, soft binary relation, and fuzzy soft set concepts that will be used in subsequent sections.

Definition 1 ([1]
).A membership mapping λ : U → [0, 1] is known as an fuzzy set, where U = ∅ is a set of objects.The value λ(x) is known as the membership grade of the object x ∈ U. Let λ and γ be two FSs in U. Then λ ≤ γ if λ(x) ≤ γ(x), for all x ∈ U. Moreover λ = γ if λ ≤ γ and γ ≥ λ.An FS λ in U is know as null FS if λ(x) = 0 for all x ∈ U.An FS λ in U is known as a whole FS, if λ(x) = 1 for all x ∈ U. We usually denote the null FS by 0 and the whole FS by 1.

Definition 2 ([1]
).Let λ and γ be two FSs in U. Then their intersection and union are defined as follows for all x ∈ U, where ∧ and ∨ means minimum and maximum, respectively.

Definition 3 ([1]
).For a number 0 < α ≤ 1, the α cut of an FS λ in U is λ α = {x ∈ U : λ(x) ≥ α} which is a subset of U. Definition 4 ([13]).Let ρ be an equivalence relation on U. The Pawlak lower and upper approximations for any M ⊆ U w.r.t ρ are defined by Qian et al. [27,30] extended the Pawlak RS model to an MGRS model, in which set approximations are established by multi-equivalence relations on the universe.Definition 5 ([27]).Let ρ1 , ρ2 , . . ., ρm be m equivalence relations on U and M ⊆ U. Then the lower and upper approximations of M are defined as Definition 6 ([30]).Let ρ1 , ρ2 , . . ., ρm be m equivalence relations on an universal set U and M ⊆ U. Then the pessimistic lower and upper approximations of M are defined as

Definition 7 ([2]
).A soft set over U is a pair (ρ, A), where ρ is a mapping given by ρ : A → P(U), U = ∅ finite set and A ⊆ E (set of parameters), where P(U) is a power set of U. Definition 8 ([58]).If (ρ, A) is a soft set over U × U, then (ρ, A) is referred to as a soft binary relation on U.
SBr(U) will be used to represent the collection of all soft binary relations on U.
Li et al. [20] modified the notion of an SBr over a set U to include a SBr from U to V.

Definition 9 ([20]
).If (ρ, A) is a soft set over U × V, then (ρ, A) is a soft binary relation (SBr) from U to V. We shall denote the collection of all soft binary relations from U to V by SBr(U, V).

Definition 10 ([7]
).Let F(U) be the set of all FSs on U. Then the pair (ρ, A) is known as FSS over U, where A ⊆ E (set of parameters) Definition 11 ([7]).Let (ρ 1 , A) and (ρ 2 , B) be two FSSs over a common universe, (ρ 1 , A) is a fuzzy soft subset of (ρ 2 , B) if A ⊆ B and ρ 1 (e) is a fuzzy soft subset of ρ 2 (e) for each e ∈ A.. The fuzzy soft sets (ρ 1 , A) and (ρ 2 , B) are equal if and only if (ρ 1 , A) is a fuzzy soft subset of (ρ 2 , B) and (ρ 2 , B) is a fuzzy soft subset of (ρ 1 , A).

Pessimistic Roughness of a Fuzzy Set Over Two Universes Based on Two Soft Binary Relations
In this section, we discuss the pessimistic roughness of an FS by two SBrs and approximate an FS of universe V in universe U and an FS of universe U in universe V by using aftersets and foresets of SBr from U to V, respectively.As a result, we have two FSSs that correspond to the FS in V(U).Definition 12. Let (ρ 1 , A) and (ρ 2 , A), be two SBrs from U to V and λ be an FS in V.The pessimistic lower approximation (PLAP) ρ 1 + ρ 2 λ p and pessimistic upper approximation (PUAP) p ρ 1 + ρ 2 λ , of FS λ w.r.t aftersets of (ρ 1 , A) and (ρ 2 , A) are defined as where uρ } are aftersets of u for u ∈ U and e ∈ A.
and we say that (U, V, {ρ 1 , ρ 2 }) is a generalized Soft Approximation Space (GSAS).Next we add an example to elaborate the above defined concepts.
Example 1.A franchise X wants to select the best allrounder for their team and there are 15 top allrounders who are available for the tournament.These allrounders are categorized into two groups-platinum and diamond.Ghe set U = {p 1 , p 2 , p 3 , p 4 , p 5 , p 6 , p 7 , p 8 } represents the players of the platinum group and V = {p 1 , p 2 , p 3 , p 4 , p 5 , p 6 , p 7 } represents the players of the diamond group.Let A = {e 1 , e 2 } be the set of parameters, where e 1 represents the batsmen and e 2 represents the bowler.Let the two different teams of coaches analyze and compare these players based on their performance in the different leagues these players play throughout the world, from these comparisons, we have, represents the comparison of the first team of coaches as defined by: where ρ 1 (e 1 ) compares the batting performance of the players and ρ 1 (e 2 ) compares the bowling performance of the players.
From these comparisons, we get two SBrs from U to V. Now the aftersets are: where p i ρ j (e 1 ) represents all those players of the diamond group whose batting performance is similar to p i , and p i ρ j (e 2 ) represents all those players of the diamond group whose bowling performance is similar to p i .The foresets are: where ρ j (e 1 )p i represents all those players of the platinum group whose batting performance is similar to p i , and ρ j (e 2 )p i represents all those players of the platinum group whose bowling performance is similar to p i Define λ : V → [0, 1],, which represents the preference of the players given by franchise X such that which represents the preference of the players given by franchise X such that Hence, γ ρ 1 + ρ 2 p (e i )(p i ) gives the exact degree of the performance of the player to γ as a batsman and bowler and, γ ρ 1 + ρ 2 p (e 2 )(p i ) gives the possible degree of the performance of the player to γ as a batsman and bowler w.r.t foresets.
Next we study some properties of the above defined approximations.
Proposition 3. Let (ρ 1 , A) and (ρ 2 , A) be two SBrs from universe U to V, that is ρ 1 : A → P(U × V) and ρ 2 : Proposition 4. Let (ρ 1 , A) and (ρ 2 , A) be two SBrs from universe U to V, that is ρ 1 : A → P(U × V) and ρ 2 : Proof.The proof is similar to the proof of Proposition 3.
The following example shows that the equality does not hold in parts 4 and 6 of Propositions 5 and 6, generally.

Pessimistic Roughness of a Fuzzy Set Over Two Universes Based on Multi Soft Binary Relations
In this section, we generalize the concept of the pessimistic multigranulation roughness (PMGR) of an FS based on two SBr to pessimistic multigranulation roughness (PMGR) of an FS based on multi SBrs.Definition 16.Let U, V be two non-empty finite universes and θ be a family of SBrs from U to V.Then, we say (U, V, θ) a multigranulation generalized soft approximation space (MGGSAS) over two universes.
It is easy to see that the multigranulation generalized soft approximation space (MGGSAS) (U, V, θ), is a generalization of soft approximation space over two universes (U, V, ρ).Definition 17.Let (U, V, θ) be a multigranulation generalized soft approximation space over two universes and λ be a fuzzy set in V.The pessimistic lower approximation p∑ m i=1 ρ i λ and pessimistic where uρ i (e) = {v ∈ V : (u, v) ∈ ρ i (e)}, are the aftersets of u for u ∈ U and e ∈ A. Definition 18.Let (U, V, θ) be a multigranulation generalized soft approximation space over two universes and γ be a fuzzy set in U.The pessimistic lower approximation γ ∑ m i=1 ρ i p and pessimistic upper approximation γ ∑ m i=1 ρ i p , of FS γ w.r.t foresets of SBrs (ρ i , A) ∈ θ are defined as where } are the foresets of v for v ∈ V and e ∈ A.
( γ ∑ m i=1 ρ i p , A), and ( γ ∑ m i=1 ρ i p , A) are two fuzzy soft sets over V.
Proposition 9. Let (U, V, θ) be a multigranulation generalized soft approximation space over two universes.The following properties hold the w.r.t aftersets.
(1) p∑ m i=1 ρ i 1 (e) = 1 for all e ∈ A if ∩uρ i (e) = ∅. ( Proof.The proof is similar to the proof of Proposition 1. Proposition 10.Let (U, V, θ) be a multigranulation generalized soft approximation space over two universes.The following properties hold the w.r.t forersets.
(1) 1 ∑ m i=1 ρ i p (e) = 1 for all e ∈ A if ∩ρ i (e)v = ∅. ( Proof.The proof of this is similar to the proof of Proposition 1. Proposition 11.Let (U, V, θ) be a multigranulation generalized soft approximation space over two universes and λ, λ 1 , λ 2 ∈ F(V).The following properties hold the w.r.t aftersets. ( Proof.The proof is similar to the proof of Proposition 5. Proposition 12. Let (U, V, θ) be a multigranulation generalized soft approximation space over two universes and γ, γ 1 , γ 2 ∈ F(U).The following properties hold the w.r.t foresets. ( Proof.The proof is similar to the proof of Proposition 5. Proposition 13.Let (U, V, θ) be a multigranulation generalized soft approximation space over two universes and Then, the following properties hold the w.r.t aftersets. ( Proposition 14.Let (U, V, θ) be a multigranulation generalized soft approximation space over two universes and Then, the following properties hold the w.r.t foresets. ( Definition 19.Let (U, V, θ) be a multi-granulation generalized soft approximation space over two universes, λ ∈ F(V).For any 0 < α ≤ 1, the α cut set of lower approximation p∑ m i=1 ρ i λ and upper approximation p ∑ m i=1 ρ i λ of λ are defined, respectively, as follows: These are the soft sets over U.
Definition 20.Let (U, V, θ) be a multi-granulation generalized soft approximation space over two universes, γ ∈ F(U).For any 0 < α ≤ 1, the α cut set of lower approximation γ ∑ m i=1 ρ i p and upper approximation γ ∑ m i=1 ρ i p of γ about the α are defined, respectively, as follows: These are soft sets over V.

Measures of Pessimistic Multigranulation Roughness of a Fuzzy Set
In this section, we discuss the accuracy measure and rough measure of pessimistic multigranulation roughness of fuzzy sets with respect to aftersets and foresets and their basic properties.Definition 21.Let (ρ 1 , A) and (ρ 2 , A) be two SBrs from a nonempty universe U to V and 0 < β ≤ α ≤ 1.Then the accuracy measure (or degree of accuracy) of membership λ ∈ F(V), with respect to α, β and the w.r.t aftersets of (ρ 1 , A), (ρ 2 , A) is defined as where |.| means the cardinality of the set, where PA means the pessimistic accuracy measure.It is is definable with respect to the aftersets.The pessimistic rough measure is defined as Definition 22.Let (ρ 1 , A) and (ρ 2 , A) be two SBrs from a non-empty universe U to V and 0 < β ≤ α ≤ 1, the accuracy measure (or degree of accuracy) of membership γ ∈ F(U), w.r.t α, β with respect to foresets of (ρ 1 , A), (ρ 2 , A) is defined as The pessimistic accuracy measures for λ with respect to α = 0.4 and β = 0.2 and the w.r.t aftersets of SBrs (ρ 1 , A), (ρ 2 , A) are calculated as shows the degree to which the FS λ ∈ F(V) is accurate constrained to the parameters α = 0.4 and β = 0.2 for i = 1, 2 w.r.t aftersets.Similarly for γ ∈ F(U) defined in Example 1, the α = 0.4 and β = 0.2 cut sets with respect to foresets are as follows, respectively.
Proof.The proof is similar to the proof of Proposition 17.
(1) (PA ( Proof.The proof is similar to the proof of Proposition 19.

Decision Making
In this section, we defined an algorithm for the above-proposed model.We know that FSS have a wide application in decision-making problems.In most cases the approaches to decision-making based on FSS are dependent on choice value "C k ".It is simply reasonable to select the object with the maximum choice value as the optimal alternative.So, we redefine the choice value C j for the decision alternative u j of the universe U with respect to the aftersets (foresets) of soft binary relations, to deal with decision-making problems based on RFSS.We know the lower and upper approximations are the two most close-sets to the approximated subsets of a universe.Therefore, we obtain two most corresponding values p∑ n k=1 ρ k λ (e i )(u j ) and P ∑ n k=1 ρ k λ (e i )(u j ) w.r.t aftersets, the decision alternative u j ∈ U by the FS lower and upper approximations of an FS λ ∈ F(V).
Here, we present two algorithms for the proposed model, which consist of the following steps.
Flowchart for algorithms 1 and 2.
Algorithm 1: An algorithm for the approach to a decision-making problem of thew.r.t aftersets is presented in the following.
Step 1: Compute the lower pessimistic multigranulation fuzzy soft set approximation Step 6: If k has more than one value, then any one of the u k may be chosen.Algorithm 2: An algorithm for the approach to a decision-making problem with respect to the foresets is presented in the following. Step Step 5: The worst decision is Step 6: If k has more than one value, then any one of v k may be chosen.

An Application of the Decision-Making Approach
Example 4 (Continued from Example 1).Consider the soft binary relations of Example 1 again, where a franchise X wants to pick a best foreign player (allrounder) for their team from the platinum and diamond categories.
Consider Tables 1 and 2 after applying the above algorithms.1 it is clear that the maximum choice-value C k = 2.7 = C 5 = C 8 is scored by the players p 5 and p 8 , and the decision is in the favor of selecting the players p 5 or p 8 .Moreover, player p 6 is ignored.Hence franchise X will choose any one of the players p 5 and p 8 from the platinum category with respect to the aftersets.Similarly, from Table 2, the maximum choice-value C k = 2 = C 3 = C 5 scored by the players p 3 , p 5 , and the decision is in the favor of selecting any one of the players p 3 , p 5 .Moreover, player p 6 is ignored.Hence franchise X will choose any one of the players p 3 or p 5 from the diamond category with respect to the foresets.

Conclusions
This article studies the pessimistic multigranulation roughness of a fuzzy set based on SBrs over two universes.Initially, we defined the pessimistic roughness of a fuzzy set with respect to the aftersets and foresets of two soft binary relations and approximate a fuzzy set λ ∈ F(V) in universe U, and a fuzzy set γ ∈ F(U) in universe V, by using the aftersets and foresets of binary relations from which we got two fuzzy soft sets over U and over V, with respect to the aftersets and foresets.We also investigate some fundamental properties of pessimistic multigranulation roughness of a fuzzy set.Then we generalized these definitions to the pessimistic multigranulation roughness of a fuzzy set based on a finite number of soft binary relations.In addition, we define the accuracy measures and roughness measures for this proposed pessimistic multigranulation roughness.Moreover, we presented two algorithms in decision-making with respect to the afterset and foresets.We also give an example to apply the above algorithm.The main advantage of this approach over other existing approaches is that we can approximate a fuzzy set of a universe in some other universe and we are able to take decision on the basis of each parameter.Future studies will focus on the practical applications of the proposed method in solving a wider range of selection problems, such as disease symptoms and medications used in disease diagnostics.

Table 1 .
The pessimistic result of the decision algorithm with respect to the aftersets.