Abstract
FUZZY INFORMATION AND ENGINEERING 2021, VOL. 13, NO. 3, 335–367 https://doi.org/10.1080/16168658.2021.1943187 Picture Fuzzy N-Soft Sets and Their Applications in Decision-Making Problems Ubaid Ur Rehman and Tahir Mahmood Department of Mathematics and Statistics, International Islamic University Islamabad, Islamabad, Pakistan ABSTRACT ARTICLE HISTORY Received 6 February 2021 In this article, firstly, we describe picture fuzzy N-soft sets (PFN-SSs) as Revised 28 May 2021 a generalization of picture fuzzy sets (PFSs) and N-soft sets (N-SS) by Accepted 1 June 2021 observing that one of the essential concept of neutral grade is miss- ing in intuitionistic fuzzy N-SS (IFN-SS) theory. The concept of neutral- KEYWORDS ity grade can be observed in the situation when we encounter human Picture fuzzy N-soft sets; views including more answers of type: yes, abstain, no, refusal. For intuitionistic fuzzy N-soft instance, in election the election commission or election council sets; N-soft sets; soft sets; picture fuzzy soft sets; issues voting papers for the candidate. The voting outcomes are cat- decision-making egorized into 4 groups with the number of papers namely, vote for, abstain, vote against, and refusal voting. Further, We define the fun- damental properties of PFN-SS and introduce M-subset, F-subset, compliment, intersections, unions, of PFN-SS and give their exam- ples. Secondly, we define an algorithm to cope with PFN-SS data which is more generalized then the algorithm defined for IFN-SS. To show the advantage and usefulness of the defined technique, we give two examples from real life by utilizing PFN-SS data. The result shows in the comparison that our initiated method is more general and suitable than the IFN-SS, fuzzy N-SS (FN-SS), and N-SS. 1. Introduction The majority of the real-life problems include uncertainty and vagueness in data. Handling such data is a big issue in many fields like engineering, social sciences, medical sciences, and economics. In light of this worry, Zadeh [1] presented fuzzy sets (FSs). The idea of FS is truly manageable because it catches vague and uncertain data. In FSs theory the grade of membership belongs to a closed interval [0,1]. Nonetheless, it may not generally be right to assume that the grade of non-membership in FS is equivalent to 1 minus the grade of mem- bership, due to the presence of the degree of uncertainty or indeterminacy. Consequently, Atanassov [2] defined the idea of intuitionistic FSs (IFSs), which is a suitable generalisation of FSs. After this, Cuong [3] characterised a new idea by putting an additional grade which is a grade of neutral membership, and named it to picture FS (PFS). It triply contains positive membership, neutral membership, and negative membership. Researchers show interest to work on PFS because it is straightforwardly applied to tackle everyday life issues. Some fuzzy logic operators for PFSs were given by Cuong and Van Hai [4]. Luo and Zhang et al. [5] CONTACT Tahir Mahmood tahirbakhat@iiu.edu.pk © 2021 The Author(s). Published by Taylor & Francis Group on behalf of the Fuzzy Information and Engineering Branch of the Operations Research Society, Guangdong Province Operations Research Society of China. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/ by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 336 U. U. REHMAN AND T. MAHMOOD described new similarity measures for PFSs and its applications. Khan et al. [6] presented bi-parametric distance and similarity measures of PFSs and their applications in medical diagnosis. Khan et al. [7] presented distance and similarity measures for spherical FSs and their application in selecting mega projects. Mahmood et al. [8] gave the concept of com- plex hesitant FSs (CHFSs). The idea of complex dual hesitant FSs (CDHFSs) was given by Mahmood et al. [9]. Nonetheless, Molodtsov [10] showed that few challenges of the previously mentioned notions can be overwhelmed with the establishment of parameterised interpretation of the universe, an idea giving rise to soft sets (SSs) [10]. Soon, Maji et al. [11] established few algebraic operations in SS theory, which currently assume a significant part in fields such as DM [12–16] and data analysis [17]. Ali et al. [18] defined some modified opera- tions in SS theory. Anyway, the information frequently comes across in a complex structure. A lot of researchers have developed new models to overcome such types of data and merge the advantages of the presented models. These models are developed to resolve a vast range of DM issues since they have more advantages than the original models. For example, by the mixture of FSs and SSs, Maji et al. [19] defined a new model, called fuzzy SS (FSS). A new idea of DM issues based on FSSs was given by Alcantud [20]. Maji et a. [21] gave the idea of intuitionistic FSSs (IFSSs) which is a mixture of IFSs and SSs. Khan et al. [22] defined a novel approach to generalised IFSSs and its application in deci- sion support system. Khan et al. [23] gave another view on generalised interval-valued IFSSs. The renewable energy source selection by remoteness index-based VIKOR method for generalised IFSSs was presented by khan et al. [24]. The distance and similarity mea- sures of generalised IFSSs were defined by khan and Kumam [25]. Yang et al. [26] defined an adjustable soft discernibility matrix based on PFSSs and its application in DM. Khan et al. [27] defined generalised PFSSs and described some modified operations for PFSSs. Jan et al. [28] defined multi-valued PFSSs and their applications in group DM problems. The applications of generalised PFSSs in concept selection were given by khan et al. [29]. Khan et al. [30] described an adjustable weighted soft discernibility matrix based on generalised PFSS and its applications in decision-making. Khan et al. [31] defined a theoretical-justifications for the empirically successful VIKOR approach to multi-criteria DM. Akram et al. [32] described hybrid DM frameworks under complex spherical FSSs. We noted a lot of modifications of SSs in various directions such as probabilistic SS theory [33], bijective SSs [34], and fuzzy bipolar SSs [35]. Specifically, Fatimah et al. [36] introduced N-SS as a modification of SS that takes into consideration multinary parame- terised interpretation of the universe. Alcantud et al. [37] interpreted an N-SS approach to rough sets. Kamaci and Petchimuthu [38] defined bipolar N-SS theory with applica- tions. Fatimah and Alcantud [39] presented the multi-fuzzy N-SS and its applications to DM. Akram et al. [40] defined complex neutrosophic N-SS. A hybrid DM approach under com- plex Pythagorean fuzzy N-SS was given by Akram et al. [41]. Mahmood et al. [42] defined the complex picture fuzzy N-SSs. Akram et al. [43] provided the parameter reductions in N-SSs and their applications in DM. The inspiration for their defined N-SS is given as. An investi- gation of models with SSs as one of their components had indicated that the authors were motivated by SSs and their work of assessments (memberships are either 0 or 1) or the situa- tion with partial memberships containing in [0,1] [17,44]. Anyway, a lot of real-life DM issues contain information with discrete and non-binary structure, which consequently didn’t in FUZZY INFORMATION AND ENGINEERING 337 the shape of those formats. It is simple to create examples including non-binary assess- ments. We frequently get them in ranking or rating position such as websites comparing software, movies, or mobile phones. Even though they frequently appear as several stars or dots (such as four stars, three stars, two stars, one star), which can simply be linked with natural numbers. As additional evidence of the capability of N-SS theory, Akram et al. [45] merge the N-SS with FS to defined FN-SS. After this, Akram et al. [46] defined the notion of IFN-SS which the mixture of IFS and N-SS. IFN-SS is a good tool to deal with uncertainty and is in the form of (K, ((I, T, N))), where K is an intuitionistic fuzzy number and (I, T, N) is N-SS. It is noticed that one of the essen- tial notion of neutrality grade is missing in IFN-SS theory. The notion of neutrality grade can be observed in the situation when we encounter human views including more answers of kinds: yes, abstain, no, and refusal. For instance, in an election, the election commission or election council issues ballot papers for the contestant. The voting outcomes are cate- gorised into 4 groups with the number of papers, i.e. vote for, abstain, vote against, and refusal voting. Class of abstain signifies that the voting paper is a white paper refusing both agree and disagree for the contestant but still takes the vote. Class of refusal voting is either unacceptable papers or avoiding the vote. Nevertheless, the neutral grade can be taken into the consideration in medical diagnosis. For example, there may not influence the symptoms of fever, leg pain on the diseases heart problem, and brain tumour. Likewise, the symptoms of heart problems and blood cancer have a neutral influence on the diseases flu, corona, TB, etc. In IFN-SS we lost some of the important information in the shape of neutral grade which effect the end result in the decision-making problem. To overcome this and other weaknesses presented in some existing models in this article, we presented the notion of PFN-SS which is the extension of IFN-SS, FN-SS and will perform better than IFN-SS in DM. The geometrical representation of the PFN-SS is given in Figure 1. The organisation of this article as follows: • Section 2 is consists with preliminaries in which we recall few basic definitions such as FSs, IFS, PFSs, SSs, FSS, IFSS, PFSS N-SSs, and IFN-SS. We also recall the basic properties of some of the above basic definitions. Figure 1. Flowchart of FSs, SSs, and their generalisation. 338 U. U. REHMAN AND T. MAHMOOD • Section 3 is a picture fuzzy N-Soft set in which we initiate PFN-SSs which is a mixture of PFSs and N-SS and explain it by giving examples. We also initiate the fundamental properties of PFN-SS in Section 3. • Section 4 of this article is applications of PFN-SS in which we introduce an algorithm to cope with PFN-SS data and to show the advantage and usefulness of the defined technique. • Section 5 is a comparison in which we do a comparison of our initiated model with IFN- SS. • In Section 6, the conclusion and future study of the proposed work are presented. 2. Preliminaries In this section, let us recall few basic definitions such as FSs, IFS, PFSs, SSs, FSS, IFSS, PFSS N-SSs, and IFN-SS. We also recall the basic properties of some of the above basic definitions. U =∅ be set of universe and A be set of attributes throughout this manuscript. Zadeh [1], defined the idea of FS, which gives a powerful structure to dealing with uncertainty. Definition 1: [1] A FS D over U is given as D ={(u, ξ (u)) : u ∈ U}, where ξ : U → [0, 1] is a grade of membership. For every u ∈ U, ξ (u) describes the D D degree to which u be a member of FS D.The pair (u, ξ (u)) is called fuzzy number (FN) In [1] Zadeh described some basic operations which are as follows: Definition 2: [1]Let D = (u, ξ (u)) and E = (u, ξ (u)) be two FNs. Then D E 1. D = E ⇔ ξ (u) = ξ (u); D E 2. D ⊆ E ⇔ ξ (u) ≤ ξ (u); D E 3. D = (u,1 − ξ (u)); 4. D ∪ E = (u,max(ξ (u), ξ (u))); D E 5. D ∩ E = (u,min(ξ (u), ξ (u))). D E In [2], Atanassov defined the concept of IFS Definition 3: [2]AnIFSover U is given as D ={(u, (ξ (u), ϑ (u))) : u ∈ U}, D D where ξ : U → [0, 1] is a grade of membership and ϑ : U → [0, 1] is the grade of D D non-membership with a condition that 0 ≤ ξ (u) + ϑ (u) ≤ 1for each u ∈ U.The pair D D (u, (ξ (u), ϑ (u))) is called intuitionistic FN (IFN). D D In [3], Cuong described PFSs by putting an additional grade of membership called the grade of neutral membership. Mainly, the notion of PFS may be appropriate in the envi- ronment when one faces human judgments containing more replies of the form: yes, no, abstain refusal. Voting is the best example of PFS. FUZZY INFORMATION AND ENGINEERING 339 Definition 4: [3] A PFS over U is given as D ={(u, (ξ (u), δ (u), ϑ (u))) : u ∈ U}, D D D where ξ : U → [0, 1], is a grade of membership, δ : U → [0, 1] is the grade of neutral D D membership and ϑ : U → [0, 1] is the grade of non-membership with a condition that 0 ≤ ξ (u) + δ (u) + ϑ (u) ≤ 1foreachu ∈ U.The pair (u, (ξ (u), δ (u), ϑ (u))) is called D D D D D D picture FN (PFN). In [3] Cuong also defined basic operations of PFS which are given below Definition 5 ([3): ] Let D = (u, (ξ (u), δ (u), ϑ (u))) and E = (u, (ξ (u), δ (u), ϑ (u))) be two PFNs. D D D E E E Then 1. D = E ⇔ ξ (u) = ξ (u), δ (u) = δ (u), ϑ (u) = ϑ (u); D E D E D E 2. D ⊆ E ⇔ ξ (u) ≤ ξ (u), δ (u) ≤ δ (u), ϑ (u) ≥ ϑ (u); D E D E D E 3. D = (u, ϑ (u), δ (u), ξ (u)); D D D 4. D ∪ E = (u,max(ξ (u), ξ (u)),min(δ (u), δ (u)),min(ϑ (u), ϑ (u))); D E D E D E 5. D ∩ E = (u,min(ξ (u), ξ (u)),min(δ (u), δ (u)),max(ϑ (u), ϑ (u))). D E D E D E In [10], Molodtsov described the SS which is entirely a new tool to cope with the uncer- tainties from a parametrisation opinion. Most of the time the parameter set contains characteristics, attributes, or properties of the alternatives. Definition 6: [10] A pair (I, T) is a SS over U where I : T → P(U) be set-valued function and T ⊆ A. Maji et al. [19] described the FSS, which is a mixture of FS and SS. In FSS, each parameter should be represented by grade of membership, as in real-world, the opinion of the people is represented by some degree of imprecision. Definition 7: [19] A pair (I , T) represents an FSS over U if I : T → FS(U), T ⊆ A, where FS(U) represents the set of all FS of U. Maji et al. [21] described the IFSS, which is a mixture of IFS and SS. Definition 8: [21] A pair (I , T) describes an IFSS over U if I : T → IFS(U), T ⊆ A, where IFS(U) represents the set of all IFS of U. In [26], Yang described the PFSS, a mixture of PFS and SS. In PFSS, we can view vagueness from a parametrisation opinion in a picture fuzzy (PF) environment. Definition 9: [26] Let PFS(U) be a set of all PFSs over U.Apair (I , T) is called the PFSS over U, where I : T → PFS(U), T ⊆ A. Fatimah et al. [36] described the idea of N-SS which is the modification of SS. Definition 10: [36] Let a universal set of alternatives be U and A be attributes. A triplet U×Y (I, T, N) is called N-SS over U, where I : T → 2 = P(U × Y), T ⊆ A, with the property that for every 𝓉 ∈ T and ∃ aunique ((u, 𝓎 ) ∈ P(U × Y)) such that (u, 𝓎 ) ∈ I(𝓉 ), u ∈ 𝓉 𝓉 U, 𝓎 ∈ Y ={0, 1, 2, ... , N − 1} be ordered grades set. 𝓉 340 U. U. REHMAN AND T. MAHMOOD Fatimah et al. [36] also described the extended and restricted intersection and union of N-SS which is given below Definition 11: [36] Let = (I , T , N ) and = (I , T , N ) be two N-SSs with T ∩ 1 1 1 1 2 2 2 2 1 T =∅. Then the restricted union and the intersection of and are described below: 2 1 2 ∪ = (I , T , N )∪ (I , T , N ) = (𝒽, T ∩ T ,max(N , N )) 1 R 2 1 1 1 R 2 2 1 1 2 1 2 1 2 1 where ∀𝓉 ∈ T ∩ T &u ∈ U ⇒ (u, 𝓎 ) ∈ 𝒽(𝓉 ) ⇔ 𝓎 = max(𝓎 , 𝓎 ), if (u, 𝓎 ) ∈ I (𝓉 )& 1 2 𝓉 𝓉 1 𝓉 𝓉 𝓉 (u, 𝓎 ) ∈ I (𝓉 ). ∩ = (I , T , N )∩ (I , T , N ) = (, T ∩ T ,min(N , N )) 1 R 2 1 1 1 R 2 2 2 1 2 1 2 1 2 1 where ∀𝓉 ∈ T ∩ T &u ∈ U ⇒ (u, 𝓎 ) ∈ (𝓉 ) ⇔ 𝓎 = min(𝓎 , 𝓎 ), if (u, 𝓎 ) ∈ I (𝓉 )& 1 2 𝓉 𝓉 1 𝓉 𝓉 𝓉 (u, 𝓎 ) ∈ I (𝓉 ). Definition 12: [36]Let = (I , T , N ) and = (I , T , N ) be two N-SSs. Then the 1 1 1 1 2 2 2 2 extended union and the intersection of and are described below 1 2 ∪ = (I , T , N )∪ (I , T , N ) = (𝒽, T ∪ T ,max(N , N )) 1 E 2 1 1 1 E 2 2 2 1 2 1 2 I (𝓉 ) if 𝓉 ∈ T \T 1 1 2 I (𝓉 ) if 𝓉 ∈ T \T 2 2 1 where 𝒽(𝓉 ) = 1 2 ⎪ (u, 𝓎 ) such taht 𝓎 = max(𝓎 , 𝓎 ), 𝓉 𝓉 ⎪ 𝓉 𝓉 1 2 where (u, 𝓎 ) ∈ I (𝓉 )&(u, 𝓎 ) ∈ I (𝓉 ) 1 2 𝓉 𝓉 ∩ = (I , T , N )∩ (I , T , N ) = (, T ∪ T ,max(N , N )) 1 E 2 1 1 1 e 2 2 2 1 2 1 2 I (𝓉 ) if 𝓉 ∈ T \T ⎪ 1 1 2 I (𝓉 ) if 𝓉 ∈ T \T 2 2 1 where (𝓉 ) = 1 2 ⎪ (u, 𝓎 ) such that 𝓎 = min(𝓎 , 𝓎 ), 𝓉 𝓉 ⎪ 𝓉 𝓉 1 2 where, (u, 𝓎 ) ∈ I (𝓉 )&(u, 𝓎 ) ∈ I (𝓉 ) 1 2 𝓉 𝓉 Akram et al. [46], defined IFN-SS. Definition 13: [46] Let a universal set of alternatives be U, A be attributes, and Y = {0, 1, 2, ... , N − 1} be ordered grades set with N ∈{2, 3, ···}.Apair (K, ((I, T, N))) is called U×Y U×Y IFN-SS, where (I, T, N) is an N-SS on U,and K : T → IF , where IF is the set of all IFS over U × Y. 3. Picture Fuzzy N-soft Sets In this part of the article, we describe the notion of PFN-SS and present some basic oper- ations on PFN-SS such as union, complement, intersection, and so on. PFN-SS is a hybrid model of PFS and N-SS. In this article, U represent the universe set, A be set of attributes, Y ={0, 1, 2, ... , N − 1} be a set of ordered grades and = (I, T, N) be N-SS over U, where T ⊆ A. Now we describe the definition of a PFN-SS and give an example to illustrate it. FUZZY INFORMATION AND ENGINEERING 341 Table 1. Information obtained from the associated data. U 𝓉 𝓉 𝓉 1 2 3 Definition 14: Let U be universe set and T ⊆ A be set of attributes. A pair (Y, ) is called PFN-SS over U, where = (I, T, N) be an N-SS over U with N ∈{2, 3, ...} and Y is a mapping from T to PF(U), i.e. Y : T → PF(U), where PF(U) be the set of all PFSs over U. In the above definition, for each parameter (attribute) the mapping Y allot a PFS on the image of that attribute under the mapping I. Consequently, for every 𝓉 ∈ T and u ∈ U∃ aunique (u, 𝓎 ) ∈ U × Y such that 𝓎 ∈ Y and ((u, 𝓎 ), (Y (u) = (ξ (u), δ (u), ϑ (u)))) ∈ 𝓉 𝓉 𝓉 𝓉 𝓉 𝓉 𝓉 Y(𝓉 ), which is the notation that condenses to Y (u) = Y(𝓉 )(u, 𝓎 ). 𝓉 𝓉 Example 1: Suppose U ={u , u , u , u , u } be a set of five corona vaccines which is under 1 2 3 4 5 consideration of a health expert to buy and T ={𝓉 , 𝓉 , 𝓉 } be a set of attributes, where 𝓉 1 2 3 1 represents price, 𝓉 represents experimental results of vaccines, and 𝓉 represents delivery 2 3 time. Based on these attributes the health expert assigns grades to the corona vaccines in the form of stars which is given in Table 1. Where Four stars are for ‘Excellent’, three stars are for ‘very good’, two stars are for ‘good’, one star is for ‘normal’, a hole is for ‘poor’. The setY ={0, 1, 2, 3, 4} can be associated with the stars given in Table 1, where 4 repre- sents , 3 represents , 2 represents , 1 represents , and 0 represents . The 5-SS (I, T,5) is given as follows: I(𝓉 ) ={(u ,3), (u ,1), (u ,2), (u ,3), (u ,2)} 1 1 2 3 4 5 I(𝓉 ) ={(u ,1), (u ,0), (u ,1), (u ,4), (u ,3)} 2 1 2 3 4 5 I(𝓉 ) ={(u ,2), (u ,3), (u ,4), (u ,3), (u ,0)} 3 1 2 3 4 5 The tabular form of 5-SS is interpreted in Table 2. The membership (ξ ), neutral (δ), and non-membership (ϑ ) follow the following grad- ing criteria. For all u ∈ U,0 ≤ ξ(u) + δ(u) + ϑ(u) ≤ 1, where 0 ≤ δ(u), ϑ(u) ≤ 1. We allot grade 0 if 0 ≤ ξ(u)< 0.1. Similarly ∀u ∈ U we relate: grade 1 if 0.1 ≤ ξ(u)< 0.3, grade 2, if 0.3 ≤ ξ(u)< 0.55, grade 3, if 0.55 ≤ ξ(u)< 0.8, grade 4, if 0.8 ≤ ξ(u) ≤ 1.0. Then by Definition 14 the PF5-SS is given as follows: ((u ,3), 0.56, 0.1, 0.2), ((u ,1), 0.25, 0.2, 0.5), ((u ,2), 0.45, 0.15, 0.3), 1 2 3 Y(𝓉 ) = ((u ,3), 0.7, 0.1, 0.1), ((u ,2), 0.4, 0.2, 0.3) 4 5 ((u ,1), 0.2, 0.3, 0.4), ((u ,0), 0.09, 0.3, 0.5), ((u ,1), 0.27, 0.5, 0.1), 1 2 3 Y(𝓉 ) = ((u ,4), 0.9, 0.05, 0.04), ((u ,3), 0.65, 0.1, 0.15) 4 5 ((u ,2), 0.5, 0.15, 0.3), ((u ,3), 0.75, 0.1, 0.1), ((u ,4), 0.8, 0.05, 0.1), 1 2 3 Y(𝓉 ) = ((u ,3), 0.79, 0.08, 0.05), ((u ,0), 0.05, 0.4, 0.5) 4 5 342 U. U. REHMAN AND T. MAHMOOD Table 2. The tabular form of 5-SS. (I,T,5) 𝓉 𝓉 𝓉 1 2 3 u 312 u 103 u 214 u 343 u 230 Table 3. The tabular representation of the picture fuzzy 5-soft set (Y, (I,T,5)) in Example 1. (Y, (I,T,5)) 𝓉 𝓉 𝓉 1 2 3 u 3, (0.56, 0.1, 0.2) 1, (0.2, 0.3, 0.4) 2, (0.5, 0.15, 0.3) u 1, (0.25, 0.2, 0.5) 0, (0.09, 0.3, 0.5) 3, (0.75, 0.1, 0.1) u 2, (0.45, 0.15, 0.3) 1, (0.27, 0.5, 0.1) 4, (0.8, 0.05, 0.1) u 3, (0.7, 0.1, 0.1) 4, (0.9, 0.05, 0.04) 3, (0.79, 0.08, 0.05) u 2, (0.4, 0.2, 0.3) 3, (0.65, 0.10.15) 0, (0.05, 0.4, 0.5) Table 4. Information obtained from the associated data. U 𝓉 𝓉 𝓉 1 2 3 Clearly, the PF5-SS can be described in the tabular form given in Table 3. Example 2: A multi-national company wants to enhance the security of its wireless net- work. The company plans to buy the next generation firewall for blocking illegal access. For that, the company hire an expert and provide him four next generation firewalls, i.e. U ={u , u , u , u }. The expert have to finalise one of the best next generation firewalls 1 2 3 4 in these four firewalls based on the three given attributes T ={𝓉 , 𝓉 , 𝓉 }, where 𝓉 rep- 1 2 3 1 resents scan for viruses and malware in allowed collaborative applications, 𝓉 represents identify and control applications sharing the same connection, and 𝓉 represents decrypt outbound SSL. Based on these attributes the expert assigns grades to given four next gen- eration firewalls in the form of stars. A 3-soft set can be obtained from Table 4, where three stars are for ‘very good’, two stars are for ‘good’, one star is for ‘normal’, a hole is for ‘poor’. The set Y ={0, 1, 2, 3} can be associated with the stars given in Table 4, where 3 rep- resents , 2 represents , 1 represents , and 0 represents .The4-SS (I, T,4) is given as follows: I(𝓉 ) ={(u ,0), (u ,2), (u ,2), (u ,0)} 1 1 2 3 4 I(𝓉 ) ={(u ,2), (u ,3), (u ,3), (u ,2)} 2 1 2 3 4 I(𝓉 ) ={(u ,3), (u ,2), (u ,1), (u ,2)} 3 1 2 3 4 The tabular form of 4-SS is interpreted in Table 5. The membership (ξ ), neutral (δ), and non-membership (ϑ ) follow the following grad- ing criteria. For all u ∈ U,0 ≤ ξ(u) + δ(u) + ϑ(u) ≤ 1, where 0 ≤ δ(u), ϑ(u) ≤ 1. We allot FUZZY INFORMATION AND ENGINEERING 343 Table 5. The tabular form of 5-SS. (I,T,4) 𝓉 𝓉 𝓉 1 2 3 u 023 u 232 u 231 u 022 Table 6. The tabular representation of the picture fuzzy 4-soft set (Y, (I,T,4)) in Example 2. (Y, (I,T,4)) 𝓉 𝓉 𝓉 1 2 3 u 0, (0.16, 0.4, 0.1) 2, (0.6, 0.2, 0.11) 3, (0.88, 0.05, 0.03) u 2, (0.65, 0.1, 0.15) 3, (0.8, 0.13, 0.05) 2, (0.58, 0.3, 0.1) u 2, (0.65, 0.25, 0.05) 3, (0.9, 0.05, 0.01) 1, (0.4, 0.2, 0.4) u 0, (0.1, 0.4, 0.4) 2, (0.7, 0.1, 0.0) 2, (0.7, 0.05, 0.2) grade 0 if 0 ≤ ξ(u)< 0.25. Similarly ∀u ∈ U we relate: grade 1 if 0.25 ≤ ξ(u)< 0.5, grade 2, if 0.5 ≤ ξ(u)< 0.75, grade 3, if 0.75 ≤ ξ(u)< 1.0. Then by Definition 14, the PF5-SS is given as follows: ((u ,0), 0.16, 0.4, 0.1), ((u ,2), 0.65, 0.1, 0.15), ((u ,2), 0.55, 0.25, 0.05), 1 2 3 Y(𝓉 ) = ((u ,0), 0.1, 0.4, 0.4) ((u ,2), 0.6, 0.2, 0.11), ((u ,3), 0.8, 0.13, 0.05), ((u ,3), 0.9, 0.05, 0.01), 1 2 3 Y(𝓉 ) = ((u ,2), 0.71, 0.1, 0.0) ((u ,3), 0.88, 0.05, 0.03), ((u ,2), 0.58, 0.3, 0.1), ((u ,1), 0.4, 0.2, 0.4), 1 2 3 Y(𝓉 ) = ((u ,2), 0.7, 0.05, 0.2) Clearly, the PF5-SS can be described in the tabular form given in Table 5 (Table 6). The above Examples 1 and 2 are examples of PFN-SS. Later in Section 4, we will get the results of both examples by solving them by our proposed algorithm. Any PFN-SS over U is also called PF(N+1)-SS. E.g. in Example 1, we have PF5-SS but we can also call it PF6-SS. In PF6-SS we suppose that we have 5 grades which are never used in the Example 1. Here we describe two kinds of containment in PFN-SS, i.e. F-subset and M-subset. Definition 15: Let (Y , = (I , T , N )) and (Y , = (I , T , N )) be two PFN-SSs over 1 1 1 1 1 2 2 2 2 2 U. Then (Y , ) is called picture fuzzy N-soft (PFN-S) F-subset of (Y , ), designated by 1 1 2 2 (Y , )⊆ (Y , ),if 1 1 F 2 2 1. T ⊆ T , 1 2 2. I (𝓉 ) ⊆ I (𝓉 ) ⇒ (u, 𝓎 ) ≤ (u, 𝓎 ) ⇒ 𝓎 ≤ 𝓎 ∀u ∈ U,Y (𝓉 ) ⊆ Y (𝓉 ) ⇒ Y (u) ≤ 1 2 t t t t 1 2 𝓉 1 2 1 2 1 Y (u) ⇒ ξ (u) ≤ ξ (u), δ (u) ≤ δ (u), ϑ (u) ≥ ϑ (u)∀𝓉 ∈ T ,and N ≤ N . 𝓉 𝓉 𝓉 𝓉 𝓉 𝓉 𝓉 1 1 2 2 1 2 1 2 1 2 Example 3: Let U ={u , u , u , u } be a universe set and T , T ⊆ A, where T ={𝓉 , 𝓉 }, 1 2 3 4 1 2 1 1 2 and T ={𝓉 , 𝓉 , 𝓉 }.Let (Y , = (I , T ,4)) and (Y , = (I , T ,5)) be PF4-SS and PF5- 2 1 2 3 1 1 1 1 2 2 2 2 SS over U respectively. The tabular form of (Y , = (I , T ,4)) and (Y , = (I , T ,5)) is 1 1 1 1 2 2 2 2 given in Tables 7 and 8 respectively. 344 U. U. REHMAN AND T. MAHMOOD Table 7. The tabular representation of the PF4-SS (Y ,Θ = (I ,T ,4)) assumed in Example 3. 1 1 1 1 (Y , (I ,T ,4)) 𝓉 𝓉 1 1 1 1 2 u 2, (0.5, 0.1, 0.3) 1, (0.27, 0.2, 0.4) u 1, (0.25, 0.1, 0.5) 0, (0.05, 0.1, 0.7) u 1, (0.3, 0.2, 0.4) 1, (0.26, 0.3, 0.2) u 2, (0.7, 0.1, 0.1) 3, (0.85, 0.05, 0.09) Table 8. The tabular representation of the PF5-SS (Y ,Θ = (I ,T ,5)) assumed in Example 3. 2 2 2 2 (Y , (I ,T ,5)) 𝓉 𝓉 𝓉 2 2 2 1 2 3 u 3, (0.56, 0.1, 0.2) 1, (0.29, 0.3, 0.3) 2, (0.5, 0.15, 0.3) u 1, (0.25, 0.2, 0.4) 0, (0.09, 0.3, 0.5) 3, (0.75, 0.1, 0.1) u 2, (0.45, 0.25, 0.2) 1, (0.27, 0.5, 0.1) 4, (0.8, 0.05, 0.1) u 3, (0.75, 0.15, 0.05) 4, (0.9, 0.05, 0.04) 3, (0.79, 0.08, 0.05) Table 9. The tabular representation of the PF5-SS (Y ,Θ = (I ,T ,5)) assumed in Example 4. 1 1 1 1 (Y , (I ,T ,5)) 𝓉 𝓉 1 1 1 1 2 u 3, (0.56, 0.1, 0.2) 1, (0.29, 0.3, 0.3) u 1, (0.25, 0.2, 0.4) 0, (0.09, 0.3, 0.5) u 2, (0.45, 0.25, 0.2) 1, (0.27, 0.5, 0.1) u 3, (0.75, 0.15, 0.05) 4, (0.9, 0.05, 0.04) Table 10. The tabular representation of the PF5-SS (Y ,Θ = (I ,T ,5)) provided in Example 4. 2 2 2 2 (Y , (I ,T ,5)) 𝓉 𝓉 𝓉 2 2 2 1 2 3 u 3, (0.56, 0.1, 0.2) 1, (0.29, 0.3, 0.3) 2, (0.5, 0.15, 0.3) u 1, (0.25, 0.2, 0.4) 0, (0.09, 0.3, 0.5) 3, (0.75, 0.1, 0.1) u 2, (0.45, 0.25, 0.2) 1, (0.27, 0.5, 0.1) 4, (0.8, 0.05, 0.1) u 3, (0.75, 0.15, 0.05) 4, (0.9, 0.05, 0.04) 3, (0.79, 0.08, 0.05) We can see that T ⊆ T ,I (𝓉 ) ⊆ I (𝓉 ) and Y (𝓉 ) ⊆ Y (𝓉 ) for all 𝓉 ∈ T . So this implies 1 2 1 2 1 2 1 that (Y , = (I , T ,4))⊆ (Y , = (I , T ,5)). 1 1 1 1 F 2 2 2 2 Definition 16: Let (Y , = (I , T , N )) and (Y , = (I , T , N )) be two PFN-SSs over 1 1 1 1 1 2 2 2 2 2 U. Then (Y , ) is called picture fuzzy N-soft M-subset of (Y , ), designated by 1 1 2 2 (Y , )⊆ (Y , ),if 1 1 M 2 2 1. T ⊆ T , 1 2 2. I (𝓉 ) = I (𝓉 ) ⇒ (u, 𝓎 ) = (u, 𝓎 ) ⇒ 𝓎 = 𝓎 ∀u ∈ U,Y (𝓉 ) = Y (𝓉 ) ⇒ Y (u) = 1 2 t t t t 1 2 𝓉 1 2 1 2 1 Y (u) ⇒ ξ (u) = ξ (u), δ (u) = δ (u), ϑ (u) = ϑ (u)∀𝓉 ∈ T ,and N = N . 𝓉 𝓉 𝓉 𝓉 𝓉 𝓉 𝓉 1 1 2 2 1 2 1 2 1 2 Example 4: Let U ={u , u , u , u } be a universe set and T , T ⊆ A, where T ={𝓉 , 𝓉 }, 1 2 3 4 1 2 1 1 2 andT ={𝓉 , 𝓉 , 𝓉 }.Let (Y , = (I , T ,5)) and (Y , = (I , T ,5)) be two PF5-SS over 2 1 2 3 1 1 1 1 2 2 2 2 U. The tabular form of (Y , = (I , T ,5)) and (Y , = (I , T ,5))isgiveninTables9and 1 1 1 1 2 2 2 2 10, respectively. We can see that T ⊆ T ,I (𝓉 ) = I (𝓉 ) and Y (𝓉 ) = Y (𝓉 ) for all 𝓉 ∈ T . So this implies 1 2 1 2 1 2 1 that (Y , = (I , T ,5))⊆ (Y , = (I , T ,5)). 1 1 1 1 M 2 2 2 2 FUZZY INFORMATION AND ENGINEERING 345 Table 11. The tabular representation of the PF5-SS (Y,Θ = (I,T,5)) provided in Example 5 which is eﬃcient. (Y, (I,T,5)) 𝓉 𝓉 𝓉 1 2 3 u 3, (0.56, 0.1, 0.2) 1, (0.29, 0.3, 0.3) 2, (0.5, 0.15, 0.3) u 1, (0.25, 0.2, 0.4) 0, (0.09, 0.3, 0.5) 3, (0.75, 0.1, 0.1) u 2, (0.45, 0.25, 0.2) 1, (0.27, 0.5, 0.1) 4, (0.8, 0.05, 0.1) u 3, (0.75, 0.15, 0.05) 4, (1.0, 0.0, 0.0) 3, (0.79, 0.08, 0.05) Table 12. The picture fuzzy weak complement of PF5-SS (Y,Θ = (I,T,5)) in Example 1. c c (Y , (I ,T,5)) 𝓉 𝓉 𝓉 1 2 3 u 4, (0.2, 0.1, 0.56) 2, (0.4, 0.3, 0.2) 1, (0.3, 0.15, 0.5) u 0, (0.5, 0.2, 0.25) 2, (0.5, 0.3, 0.09) 1, (0.1, 0.1, 0.75) u 4, (0.3, 0.15, 0.45) 2, (0.1, 0.5, 0.27) 1, (0.1, 0.05, 0.8) u 4, (0.1, 0.1, 0.7) 2, (0.04, 0.05, 0.9) 1, (0.05, 0.08, 0.79) u 4, (0.3, 0.2, 0.4) 2, (0.15, 0.10.65) 1, (0.5, 0.4, 0.05) Definition 17: Let (Y , = (I , T , N )) and (Y , = (I , T , N )) be two PFN-SSs over 1 1 1 1 2 2 2 2 2 2 U. Then (Y , ) is called PFN-S equal to (Y , ), designated by (Y , ) = (Y , ),if 1 1 2 2 1 1 2 2 1. T = T , 1 2 2. I (𝓉 ) = I (𝓉 ) ⇒ (u, 𝓎 ) = (u, 𝓎 ) ⇒ 𝓎 = 𝓎 ∀u ∈ U,Y (𝓉 ) = Y (𝓉 ) ⇒ Y (u) = 1 2 t t t t 1 2 𝓉 1 2 1 2 1 Y (u) ⇒ ξ (u) = ξ (u), δ (u) = δ (u), ϑ (u) = ϑ (u)∀𝓉 ∈ T ,and N = N . 𝓉 𝓉 𝓉 𝓉 𝓉 𝓉 𝓉 1 1 2 2 1 2 1 2 1 2 We interpret the definition of efficient, minimised efficient PFN-SS. Definition 18: A PFN-SS (Y, = (I, T, N)) over U is efficient if Y(𝓉 ) = ((u , N − 1),1,0,0) for some u ∈ U, 𝓉 ∈ T. Example 5: Let PF5-SS over U in tabular form as given in Table 8, which is efficient as we can see that for u ∈ U and 𝓉 ∈ T we have (4, 1.0, 0.0, 0.0) in Table 11. 4 2 Definition 19: An efficient PFN-SS (Y, = (I, T, N)) is said to be minimised efficient denoted by (Y , = (I , T, N)) and describe as M = max I (𝓉 )(u ) + 1, (1, 0, 0) for M M M M k j some u and I (𝓉 )(u ) = I(𝓉 )(u ) for all 𝓉 ∈ T, u ∈ U. j M k j k j k j Next, we describe the definitions of picture fuzzy (PF) weak complement, top and bottom weak complements of PFN-SS. Definition 20: The PF weak complement of the PFN-SS (Y, = (I, T, N)) over U,is c c c c denoted by (Y , = (I , T, N)), where (I , T, N) is a weak complement of N-SS, i.e. I(𝓉 ) ∩ c c I (𝓉 ) =∅ for all 𝓉 ∈ T,and Y (𝓉 ) ={(u , 𝓎 ), (ϑ (u , 𝓎 ), δ(u , 𝓎 ), ξ(u , 𝓎 ))|(u , 𝓎 ) k k k j 𝓉 j 𝓉 j 𝓉 j 𝓉 j 𝓉 k k k k k ∈ U × Y} for all 𝓉 ∈ T. Example 6: A PF weak complement of PF5-SS (Y, = (I, T,5)) giveninTable 3 of Example c c c 1, denoted by (Y , = (I , T,5)), is described in Table 12. 346 U. U. REHMAN AND T. MAHMOOD Table 13. The top picture fuzzy weak complement of PF5-SS (Y,Θ = (I,T,5)) in Example 1. c T (Y , (I ,T,5)) 𝓉 𝓉 𝓉 1 2 3 u 4, (0.2, 0.1, 0.56) 4, (0.4, 0.3, 0.2) 4, (0.3, 0.15, 0.5) u 4, (0.5, 0.2, 0.25) 4, (0.5, 0.3, 0.09) 4, (0.1, 0.1, 0.75) u 4, (0.3, 0.15, 0.45) 4, (0.1, 0.5, 0.27) 0, (0.1, 0.05, 0.8) u 4, (0.1, 0.1, 0.7) 0, (0.04, 0.05, 0.9) 4, (0.05, 0.08, 0.79) u 4, (0.3, 0.2, 0.4) 4, (0.15, 0.10.65) 4, (0.5, 0.4, 0.05) Table 14. The bottom picture fuzzy weak complement of PF5-SS (Y,Θ = (I,T,5)) in Example 1. c B (Y , (I ,T,5)) 𝓉 𝓉 𝓉 1 2 3 u 0, (0.2, 0.1, 0.56) 0, (0.4, 0.3, 0.2) 0, (0.3, 0.15, 0.5) u 0, (0.5, 0.2, 0.25) 4, (0.5, 0.3, 0.09) 0, (0.1, 0.1, 0.75) u 0, (0.3, 0.15, 0.45) 0, (0.1, 0.5, 0.27) 4, (0.1, 0.05, 0.8) u 0, (0.1, 0.1, 0.7) 0, (0.04, 0.05, 0.9) 0, (0.05, 0.08, 0.79) u 0, (0.3, 0.2, 0.4) 0, (0.15, 0.10.65) 0, (0.5, 0.4, 0.05) c T Definition 21: The top PF weak complement of a PFN-SS (Y, = (I, T,5)) is (Y , = (I , T,5)) where, N − 1 if 𝓎 < N − 1 T 𝓉 I (𝓉 ) = 0 if 𝓎 = N − 1 Example 7: A top PF weak complement of PF5-SS (Y, = (I, T,5)) given in Table 3 of c T T Example 1, denoted by (Y , = (I , T,5)), is described in Table 13. Definition 22: The bottom PF weak complement of a PFN-SS (Y, = (I, T,5)) is c B B (Y , = (I , T,5)) where, 0 if 𝓎 > 0 I (𝓉 ) = N − 1 if 𝓎 = 0 Example 8: A bottom PF weak complement of PF5-SS (Y, = (I, T,5)) given in Table 3 of c B B Example 1, denoted by (Y , = (I , T,5)), is described in Table 14. The notion of union and intersection of PFN-SS are given below Definition 23: Let (Y , = (I , T , N )) and (Y , = (I , T , N )) be two PFN-SS over 1 1 1 1 1 2 2 2 2 2 U, where and are N-SSs over U. Then their restricted intersection is represented 1 2 by (Y , = (I , T , N ))∩ (Y , = (I , T , N )) and is describe as (, ∩ ), where 1 1 1 1 1 2 2 2 2 2 1 2 ∩ = (℘, T ∩ T ,min(N , N ))∀𝓉 ∈ T ∩ T , u ∈ U, ((u , 𝓎 ), α, β, γ) ∈ (𝓉 ) ⇔ 1 2 1 2 1 2 k 1 2 j j 𝓉 k 1 2 1 2 1 2 𝓎 = min(𝓎 , 𝓎 ), α = min(ξ (u , 𝓎 ), ξ (u , 𝓎 )), β = min(δ (u , 𝓎 ), δ (u , 𝓎 )),and 𝓉 1 j 2 j 1 j 2 j k 𝓉 𝓉 𝓉 𝓉 𝓉 𝓉 k k k k k k 1 2 1 1 1 1 γ = max(ϑ (u , 𝓎 ), ϑ (u , 𝓎 )) if ((u , 𝓎 ), ξ (u , 𝓎 ), δ (u , 𝓎 ), ϑ (u , 𝓎 )) ∈ Y (𝓉 ) and 1 j 2 j j 1 j 1 j 1 j 1 k 𝓉 𝓉 𝓉 𝓉 𝓉 𝓉 k k k k k k 2 2 2 2 ((u , 𝓎 ), ξ (u , 𝓎 ), δ (u , 𝓎 ), ϑ (u , 𝓎 )) ∈ Y (𝓉 ). j 2 j 2 j 2 j 2 𝓉 𝓉 𝓉 𝓉 k k k k Example 9: Let U ={u , u , u , u } be a universe set and T , T ⊆ A, where T = 1 2 3 4 1 2 1 {𝓉 , 𝓉 , 𝓉 },and T ={𝓉 , 𝓉 , 𝓉 }.Let (Y , = (I , T ,5)) and (Y , = (I , T ,6)) be 1 2 4 2 1 2 3 1 1 1 1 2 2 2 2 PF5-SS and PF6-SS over U respectively. The tabular form of (Y , = (I , T ,5)) and 1 1 1 1 (Y , = (I , T ,6)) is given in Tables 15 and 16 respectively. Then their restricted inter- 2 2 2 2 section is given in Table 17. FUZZY INFORMATION AND ENGINEERING 347 Definition 24: Let (Y , = (I , T , N )) and (Y , = (I , T , N )) be two PFN-SS over 1 1 1 1 1 2 2 2 2 2 U, where and are N-SSs over U. Then their restricted union is represented by 1 2 (Y , = (I , T , N ))∪ (Y , = (I , T , N )) and is describe as (
, ∪ ), where 1 1 1 1 1 2 2 2 2 2 1 2 ∪ = (L, T ∩ T ,max(N , N ))∀𝓉 ∈ T ∩ T , u ∈ U, ((u , 𝓎 ), α, β, γ) ∈ (𝓉 ) ⇔ 1 2 1 2 1 2 1 2 j j 𝓉 k k 1 2 1 2 1 2 𝓎 = max(𝓎 , 𝓎 ), α = max(ξ (u , 𝓎 ), ξ (u , 𝓎 )), β = min(δ (u , 𝓎 ), δ (u , 𝓎 )), 𝓉 1 j 2 j 1 j 2 j k 𝓉 𝓉 𝓉 𝓉 𝓉 𝓉 k k k k k k 1 2 1 1 1 1 and γ = min(ϑ (u , 𝓎 ), ϑ (u , 𝓎 )) if ((u , 𝓎 ), ξ (u , 𝓎 ), δ (u , 𝓎 ), ϑ (u , 𝓎 )) ∈ Y 1 j 2 j j 1 j 1 j 1 j 1 𝓉 𝓉 𝓉 𝓉 𝓉 𝓉 k k k k k k 2 2 2 2 (𝓉 ) and ((u , 𝓎 ), ξ (u , 𝓎 ), δ (u , 𝓎 ), ϑ (u , 𝓎 )) ∈ Y (𝓉 ). j 2 j 2 j 2 j 2 k k 𝓉 𝓉 𝓉 𝓉 k k k k Example 10: Let U ={u , u , u , u } be a universe set and T , T ⊆ A, where T = 1 2 3 4 1 2 1 {𝓉 , 𝓉 , 𝓉 },and T ={𝓉 , 𝓉 , 𝓉 }.Let (Y , = (I , T ,5)) and (Y , = (I , T ,6)) be 1 2 4 2 1 2 3 1 1 1 1 2 2 2 2 PF5-SS and PF6-SS over U respectively. The tabular form of (Y , = (I , T ,5)) and 1 1 1 1 (Y , = (I , T ,6)) is given in Tables 15 and 16 respectively. Then their restricted union is 2 2 2 2 given in Table 18. Definition 25: Let (Y , = (I , T , N )) and (Y , = (I , T , N )) be two PFN-SS over 1 1 1 1 1 2 2 2 2 2 U, where and are N-SSs over U. Then their extended intersection is represented 1 2 by (Y , = (I , T , N ))∩ (Y , = (I , T , N )) andisdescribeas (, ∩ ), where 1 1 1 1 1 E 2 2 2 2 2 1 E 2 ∩ = (℘, T ∩ T ,max(N , N )) where 1 E 2 1 2 1 2 Y (𝓉 ) if 𝓉 ∈ T − T ⎪ 1 k k 1 2 Y (𝓉 ) if 𝓉 ∈ T − T 2 k k 2 1 ⎪ ((u , 𝓎 ), α, β, γ) j 𝓉 ⎨ k ⎛ ⎞ 1 2 1 2 such that 𝓎 = min(𝓎 , 𝓎 ), α = min(ξ (u , 𝓎 ), ξ (u , 𝓎 )), (𝓉 ) = 𝓉 1 j 2 j k 𝓉 𝓉 𝓉 𝓉 k k k k ⎜ 1 2 1 2 ⎟ ⎪ β = min(δ (u , 𝓎 ), δ (u , 𝓎 )),and γ = max(ϑ (u , 𝓎 ), ϑ (u , 𝓎 )) 1 j 2 j 1 j 2 j ⎜ ⎟ ⎪ 𝓉 𝓉 𝓉 𝓉 k k k k ⎜ ⎟ 1 1 1 1 ⎝ if ((u , 𝓎 ), ξ (u , 𝓎 ), δ (u , 𝓎 ), ϑ (u , 𝓎 )) ∈ Y (𝓉 ) ⎠ ⎪ j 1 j 1 j 1 j 1 𝓉 𝓉 𝓉 𝓉 ⎪ k k k k 2 2 2 2 and ((u , 𝓎 ), ξ (u , 𝓎 ), δ (u , 𝓎 ), ϑ (u , 𝓎 )) ∈ Y (𝓉 ). j 2 j 2 j 2 j 2 k 𝓉 𝓉 𝓉 𝓉 k k k k Example 11: Let U ={u , u , u , u } be a universe set and T , T ⊆ A, where T = 1 2 3 4 1 2 1 {𝓉 , 𝓉 , 𝓉 },and T ={𝓉 , 𝓉 , 𝓉 }.Let (Y , = (I , T ,5)) and (Y , = (I , T ,6)) be 1 2 4 2 1 2 3 1 1 1 1 2 2 2 2 PF5-SS and PF6-SS over U respectively. The tabular form of (Y , = (I , T ,5)) and 1 1 1 1 (Y , = (I , T ,6)) is given in Tables 15 and 16 respectively. Then their extended inter- 2 2 2 2 section is given in Table 19. Definition 26: Let (Y , = (I , T , N )) and (Y , = (I , T , N )) be two PFN-SS over 1 1 1 1 1 2 2 2 2 2 U, where and are N-SSs over U. Then their extended union is represented by 1 2 (Y , = (I , T , N ))∪ (Y , = (I , T , N )) and is describe as (
, ∪ ), where 1 1 1 1 1 E 2 2 2 2 2 1 E 2 ∪ = (L, T ∩ T ,max(N , N )) where 1 E 2 1 2 1 2 Y (𝓉 ) if 𝓉 ∈ T − T 1 1 2 ⎪ k k Y (𝓉 ) if 𝓉 ∈ T − T ⎪ 2 2 1 k k ⎪ ((u , 𝓎 ), α, β, γ) j 𝓉 ⎨ k ⎛ ⎞ 1 2 1 2 such that 𝓎 = max(𝓎 , 𝓎 ), α = max(ξ (u , 𝓎 ), ξ (u , 𝓎 )), (𝓉 ) = 𝓉 1 j 2 j k k 𝓉 𝓉 𝓉 𝓉 k k k k ⎜ ⎟ 1 2 1 2 β = min(δ (u , 𝓎 ), δ (u , 𝓎 )),and γ = min(ϑ (u , 𝓎 ), ϑ (u , 𝓎 )) ⎜ 1 j 2 j 1 j 2 j ⎟ ⎪ 𝓉 𝓉 𝓉 𝓉 k k k k ⎜ ⎟ 1 1 1 1 if ((u , 𝓎 ), ξ (u , 𝓎 ), δ (u , 𝓎 ), ϑ (u , 𝓎 )) ∈ Y (𝓉 ) ⎝ ⎠ ⎪ j 1 j 1 j 1 j 1 k 𝓉 𝓉 𝓉 𝓉 ⎪ k k k k 2 2 2 2 and ((u , 𝓎 ), ξ (u , 𝓎 ), δ (u , 𝓎 ), ϑ (u , 𝓎 )) ∈ Y (𝓉 ). j 2 j 2 j 2 j 2 k 𝓉 𝓉 𝓉 𝓉 k k k k 348 U. U. REHMAN AND T. MAHMOOD Table 15. The tabular form of PF5-SS of Example 9. (Y , (I ,T ,5)) 𝓉 𝓉 𝓉 1 1 1 1 2 4 u 2, (0.5, 0.1, 0.3) 2, (0.57, 0.2, 0.2) 0, (0.1, 0.2, 0.6) u 1, (0.25, 0.1, 0.5) 0, (0.15, 0.1, 0.6) 4, (0.9, 0.03, 0.06) u 1, (0.3, 0.2, 0.4) 2, (0.46, 0.3, 0.2) 3, (0.76, 0.1, 0.1) u 3, (0.7, 0.1, 0.1) 4, (0.85, 0.05, 0.09) 4, (0.87, 0.02, 0.1) Table 16. The tabular form of PF6-SS of Example 9. (Y , (I ,T ,6)) 𝓉 𝓉 𝓉 2 2 2 1 2 3 u 3, (0.6, 0.1, 0.2) 2, (0.49, 0.1, 0.2) 5, (0.95, 0.01, 0.02) u 1, (0.2, 0.2, 0.4) 1, (0.2, 0.3, 0.4) 4, (0.75, 0.1, 0.1) u 5, (0.85, 0.1, 0.02) 0, (0.13, 0.5, 0.1) 1, (0.25, 0.4, 0.3) u 2, (0.45, 0.15, 0.3) 4, (0.7, 0.15, 0.1) 3, (0.69, 0.1, 0.1) Table 17. The restricted intersection of (Y ,Θ = (I ,T ,5)) and (Y ,Θ = (I ,T ,5)). 1 1 1 1 2 2 2 2 (, ∩ ,5) 𝓉 𝓉 1 2 1 2 u 2, (0.5, 0.1, 0.3) 2, (0.49, 0.1, 0.2) u 1, (0.2, 0.1, 0.5) 0, (0.15, 0.1, 0.6) u 1, (0.3, 0.1, 0.4) 0, (0.13, 0.3, 0.2) u 2, (0.45, 0.1, 0.3) 4, (0.7, 0.05, 0.1) Table 18. The restricted union of (Y ,Θ = (I ,T ,5)) and (Y ,Θ = (I ,T ,5)). 1 1 1 1 2 2 2 2 (, ∪ ,6) 𝓉 𝓉 1 2 1 2 u 3, (0.6, 0.1, 0.2) 2, (0.57, 0.1, 0.2) u 1, (0.25, 0.1, 0.4) 1, (0.2, 0.1, 0.4) u 5, (0.85, 0.1, 0.02) 2, (0.46, 0.3, 0.1) u 3, (0.7, 0.1, 0.1) 4, (0.85, 0.05, 0.09) Table 19. The extended intersection of (Y ,Θ = (I ,T ,5)) and (Y ,Θ = (I ,T ,5)). 1 1 1 1 2 2 2 2 (, ∩ ,6) 𝓉 𝓉 𝓉 𝓉 1 E 2 1 2 3 4 u 2, (0.5, 0.1, 0.3) 2, (0.49, 0.1, 0.2) 5, (0.95, 0.01, 0.02) 0, (0.1, 0.2, 0.6) u 1, (0.2, 0.1, 0.5) 0, (0.15, 0.1, 0.6) 4, (0.75, 0.1, 0.1) 4, (0.9, 0.03, 0.06) u 1, (0.3, 0.1, 0.4) 0, (0.13, 0.3, 0.2) 1, (0.25, 0.4, 0.3) 3, (0.76, 0.1, 0.1) u 2, (0.45, 0.1, 0.3) 4, (0.7, 0.05, 0.1) 3, (0.69, 0.1, 0.1) 4, (0.87, 0.02, 0.1) Example 12: Let U ={u , u , u , u } be a universe set and T , T ⊆ A, where T = 1 2 3 4 1 2 1 {𝓉 , 𝓉 , 𝓉 },and T ={𝓉 , 𝓉 , 𝓉 }.Let (Y , = (I , T ,5)) and (Y , = (I , T ,6)) be 1 2 4 2 1 2 3 1 1 1 1 2 2 2 2 PF5-SS and PF6-SS over U respectively. The tabular form of (Y , = (I , T ,5)) and 1 1 1 1 (Y , = (I , T ,6)) is given in Tables 15 and 16 respectively. Then their extended union is 2 2 2 2 given in Table 20. Now we linked PFSSs with PFN-SS. Definition 27: Let (Y, = (I, T, N)) be PFN-SS over U,and 0 < H < N be a threshold. A PFSS linked with (Y, = (I, T, N)) and H, represented by (Y , T), is described as follows: Y (𝓉 ) = (u , (1.0, 0.0, 0.0)) if 𝓎 ≥ H k j 𝓉 (Y , T) = Y (𝓉 ) = (u , (0.0, 0.0, 1.0)) otherwise k j FUZZY INFORMATION AND ENGINEERING 349 Table 20. The extended union of (Y ,Θ = (I ,T ,5)) and (Y ,Θ = (I ,T ,5)). 1 1 1 1 2 2 2 2 (, ∪ ,6) 𝓉 𝓉 𝓉 𝓉 1 E 2 1 2 3 4 u 3, (0.6, 0.1, 0.2) 2, (0.57, 0.1, 0.2) 5, (0.95, 0.01, 0.02) 0, (0.1, 0.2, 0.6) u 1, (0.25, 0.1, 0.4) 1, (0.2, 0.1, 0.4) 4, (0.75, 0.1, 0.1) 4, (0.9, 0.03, 0.06) u 5, (0.85, 0.1, 0.02) 2, (0.46, 0.3, 0.1) 1, (0.25, 0.4, 0.3) 3, (0.76, 0.1, 0.1) u 3, (0.7, 0.1, 0.1) 4, (0.85, 0.05, 0.09) 3, (0.69, 0.1, 0.1) 4, (0.87, 0.02, 0.1) Table 21. The tabular form of PFSS is associated with threshold 1. (Y ,T) 𝓉 𝓉 𝓉 1 2 3 u 1.0, 0.0, 0.0 1.0, 0.0, 0.0 1.0, 0.0, 0.0 u 1.0, 0.0, 0.0 0.0, 0.0, 1.0 1.0, 0.0, 0.0 u 1.0, 0.0, 0.0 1.0, 0.0, 0.0 1.0, 0.0, 0.0 u 1.0, 0.0, 0.0 1.0, 0.0, 0.0 1.0, 0.0, 0.0 u 1.0, 0.0, 0.0 1.0, 0.0, 0.0 0.0, 0.0, 1.0 Table 22. The tabular form of PFSS is associated with threshold 2. (Y ,T) 𝓉 𝓉 𝓉 1 2 3 u 1.0, 0.0, 0.0 0.0, 0.0, 1.0 1.0, 0.0, 0.0 u 0.0, 0.0, 1.0 0.0, 0.0, 1.0 1.0, 0.0, 0.0 u 1.0, 0.0, 0.0 0.0, 0.0, 1.0 1.0, 0.0, 0.0 u 1.0, 0.0, 0.0 1.0, 0.0, 0.0 1.0, 0.0, 0.0 u 1.0, 0.0, 0.0 1.0, 0.0, 0.0 0.0, 0.0, 1.0 Table 23. The tabular form of PFSS is associated with threshold 3. (Y ,T) 𝓉 𝓉 𝓉 1 2 3 u 1.0, 0.0, 0.0 0.0, 0.0, 1.0 0.0, 0.0, 1.0 u 0.0, 0.0, 1.0 0.0, 0.0, 1.0 1.0, 0.0, 0.0 u 0.0, 0.0, 1.0 0.0, 0.0, 1.0 1.0, 0.0, 0.0 u 1.0, 0.0, 0.0 1.0, 0.0, 0.0 1.0, 0.0, 0.0 u 0.0, 0.0, 1.0 1.0, 0.0, 0.0 0.0, 0.0, 1.0 Table 24. The tabular form of PFSS is associated with threshold 4. (Y ,T) 𝓉 𝓉 𝓉 1 2 3 u 0.0, 0.0, 1.0 0.0, 0.0, 1.0 0.0, 0.0, 1.0 u 0.0, 0.0, 1.0 0.0, 0.0, 1.0 0.0, 0.0, 1.0 u 0.0, 0.0, 1.0 0.0, 0.0, 1.0 1.0, 0.0, 0.0 u 0.0, 0.0, 1.0 1.0, 0.0, 0.0 0.0, 0.0, 1.0 u 0.0, 0.0, 1.0 0.0, 0.0, 1.0 0.0, 0.0, 1.0 Specifically, we say that (Y , T) is the bottom PFSS linked with (Y, = (I, T, N)) and N−1 (Y , T) is the top PFSS linked with (Y, = (I, T, N)). Example 13: Let a PF5-SS (Y, = (I, T,5)) given in Table 3 of Example 1. From Definition 27, we have 0 < H < 5. The possible PFSSs associated with thresholds 1, 2, 3, and 4 are presented from Tables 21–24. 350 U. U. REHMAN AND T. MAHMOOD 4. Applications of the PFN-SS In this part of the manuscript, we interpreted the algorithm for the real-life problems that are presented in the form of PFN-SS. To show the usefulness of the PFN-SS we present the two examples (selection of corona vaccine and selection of next generation firewall) of DM using PFN-SS. 4.1. Algorithm We describe an algorithm for the selection of the alternative in the environment PFN-SS. We have the following 9 steps of the algorithm. The flow chart of of defined algorithm is given in Figure 2. 1. Input U ={u , u , u , ... , u } as universal set and T ={𝓉 , 𝓉 , 𝓉 , ... , 𝓉 }⊆ Aasaset 1 2 3 n 1 2 3 m of attributes. 2. Create a PFN-SS in tabular form. 3. Create the tables of Membership pole (MP), neutral membership pole (nMP), and non- membership pole (NMP). 4. Compute the comparison tables for membership pole, neutral membership pole, and non-membership pole. 5. Create the score tables for membership pole, neutral membership pole, and non- membership pole. 6. Add the scores of neutral membership pole, and non-membership pole. 7. Find out the final score by subtracting the sum of the scores of neutral membership pole, and non-membership pole from the score of membership. 8. Observe the greatest score with the highest grades, if it is in k − th row, then we will select option u ,1 ≤ k ≤ n. 9. The end. 4.2. Selection of Corona Vaccine The world is in the midst of a COVID-19 pandemic. A huge number of people are as yet exposed to coronavirus. It’s just the current restrictions that are saving extra people from the deathbed. A vaccine would show our bodies to oppose the infection by preventing us from getting coronavirus or if nothing else making Covid less dangerous. Having a vac- cine, alongside better treatments, is the exit strategy. WHO and other medical companies are working on the development of the corona vaccine. Nowadays few medical companies succeed in the development of the corona vaccine. In the following example, we will show that a country can select the best corona vaccine using PFN-SS. Example 14: Suppose a country wants to buy a corona vaccine, for this government hires a health expert who will select the best corona vaccine. Let U ={u , u , u , u , u } be a set 1 2 3 4 5 of five corona vaccines which is under consideration of a health expert to buy and T = {𝓉 , 𝓉 , 𝓉 } be a set of attributes, where 𝓉 represents price, 𝓉 represents experimental 1 2 3 1 2 results of vaccines, and 𝓉 represents delivery time. Based on these attributes, the health expert assigns grades to the corona vaccines in the form of stars which is given in Table 1 FUZZY INFORMATION AND ENGINEERING 351 Figure 2. The ﬂowchart of algorithm deﬁned in Section 4.1. 352 U. U. REHMAN AND T. MAHMOOD Table 25. The tabular form of MP in Example 14. ξ 𝓉 𝓉 𝓉 1 2 3 u 0.56 0.2 0.5 u 0.25 0.09 0.75 u 0.45 0.27 0.8 u 0.7 0.9 0.79 u 0.4 0.65 0.05 Table 26. The comparison table for MP in Example 14. . u u u u u 1 2 3 4 5 u 32102 u 13102 u 23312 u 33233 u 11103 Table 27. The score table for MP in Example 14. Grade sum 𝓎 Row sum (Rs ) Column sum (Cs ) = Rs − Cs 𝓉 1 1 1 1 1 𝒾 =1 u 68 10 −2 u 47 12 −5 u 711 8 3 u 10 14 4 10 u 56 13 −7 Table 28. The tabular representation of nMP in Example 14. δ 𝓉 𝓉 𝓉 1 2 3 u 0.1 0.3 0.15 u 0.2 0.3 0.1 u 0.15 0.5 0.05 u 0.1 0.05 0.08 u 0.2 0.1 0.4 in Section 3. The 5-SS is presented in Table 2 of Section 3 and PF5-SS is presented in Table 3 of Section 3. The tabular form of the MP is given in Table 25. Next, we create the comparison table for MP which is presented in Table 26. After this the membership score for every corona vaccine with the sum of grades 𝓎 is gotten by subtracting the column sum from the row sum of Table 26.We 𝒾 =1 𝒾 presented it in Table 27. Likewise, the tabular form of the nMP is given in Table 28. Next, we create the comparison table for nMP which is presented in Table 29. After this the neutral membership score for every corona vaccine with the sum of grades 𝓎 is gotten by subtracting the column sum from the row sum of Table 29.We 𝒾 =1 𝒾 presented it in Table 30. Similarly, now the tabular form of the NMP is given in Table 31. Next, we create the comparison table for NMP which is presented in Table 32. FUZZY INFORMATION AND ENGINEERING 353 Table 29. The comparison table for nMP in Example 14. . u u u u u 1 2 3 4 5 u 32131 u 23232 u 21321 u 10130 u 22233 Table 30. The score table for nMP in Example 14. Grade sum 𝓎 Row sum (Rs ) Column sum (Cs ) = Rs − Cs 𝓉 2 2 2 2 2 𝒾 =1 u 610 10 0 u 412 8 4 u 79 9 0 u 10 5 14 −9 u 512 7 5 Table 31. The tabular representation of NMP in Example 14. ϑ 𝓉 𝓉 𝓉 1 2 3 u 0.2 0.4 0.3 u 0.5 0.5 0.1 u 0.3 0.1 0.1 u 0.1 0.04 0.05 u 0.3 0.15 0.5 Table 32. The comparison table for NMP in Example 14. . u u u u u 1 2 3 4 5 u 31232 u 23332 u 11331 u 00030 u 21333 Table 33. The score table for NMP in Example 14. Grade sum 𝓎 Row sum (Rs ) Column sum (Cs ) = Rs − Cs 𝓉 3 3 3 3 3 𝒾 =1 u 611 8 3 u 413 6 7 u 79 11 −2 u 10 3 15 −12 u 512 8 4 After this the non-membership score for every corona vaccine with the sum of grades 𝓎 is gotten by subtracting the column sum from the row sum of Table 32.We 𝒾 =1 presented it in Table 33. Finally, we add the scores of neutral membership and non-membership and then sub- tract it by the score of membership as presented in Table 35. In Table 34, we show the addition of scores of neutral membership and non-membership. 354 U. U. REHMAN AND T. MAHMOOD Table 34. Add the score of nMP given in table (30) and NMP given in Table 33. Grade sum 𝓎 = + 𝓉 2 3 4 2 3 𝒾 =1 u 60 3 3 u 44 7 11 u 70 −2 −2 u 10 −9 −12 −21 u 55 4 9 Table 35. Table of ﬁnal score with grades linked with PF5-SS of Example 14. Grade sum 𝓎 FINAL SCORE= − 𝓉 1 4 1 4 𝒾 =1 u 6 −23 1 u 4 −511 −16 u 73 −25 u 10 10 −21 31 u 5 −79 −16 The corona vaccine u has highest grades with the greatest score so the health expert wants to buy the corona vaccine u for his country. He thinks that u is the best corona 4 4 vaccine among the present 5 corona vaccines which can save more people from the corona. 4.3. Selection of a Next Generation Firewall (NGFW) The firewall refers to a security gateway that protects the computer networks from mali- cious instructions. There are several kinds of firewalls in the market and every firewall has its benefits and disbenefits. Therefore, how to select a beneficial firewall by seeing its effectiveness and precision is a conventional multi-attribute DM (MADM) problem. Chances are you have probably heard or read about next generation firewalls, it seems like everyone is talking about what a great innovation it is in the network security market. Traditional firewalls are becoming less capable of adequately protecting enterprise wire- less networks with the rapid evolution of applications and threats. Instead of a completely new approach to wireless network security, the traditional firewall has been transformed into next generation firewall to restore application visibility and control and regain the advantage in protecting the enterprise wireless networks. See Figure 3. In this article, we discussed that a company wants to purchase a next generation firewall whose details are given in Example 2 Section 3. Below in Example 15 we will reconsider Example 2 to get the result. Example 15: A multi-national company wants to enhance the security of its wireless net- work. The company plans to buy the next generation firewall for blocking illegal access. For that, the company hire an expert and provide him four next generation firewalls, i.e. U ={u , u , u , u }. The expert have to finalise one of the best next generation firewalls 1 2 3 4 in these four firewalls based on the three given attributes T ={𝓉 , 𝓉 , 𝓉 }, where 𝓉 rep- 1 2 3 1 resents scan for viruses and malware in allowed collaborative applications, 𝓉 represents identify and control applications sharing the same connection, and 𝓉 represents decrypt 3 FUZZY INFORMATION AND ENGINEERING 355 Figure 3. The next generation ﬁrewall. Table 36. Information obtained from associated data. U 𝓉 𝓉 𝓉 1 2 3 outbound SSL. Based on these attributes the expert assigns grades to given four next gen- eration firewalls in the form of stars. A 3-soft set can be obtained from Table 36, where three stars are for ‘very good’, two stars are for ‘good’, one star is for ‘normal’, a hole is for ‘poor’. The set Y ={0, 1, 2, 3} can be associated with the stars given in Table 36, where 3 rep- resents , 2 represents , 1 represents , and 0 represents .The4-SS (I, T,4) is given as follows: I(𝓉 ) ={(u ,0), (u ,2), (u ,2), (u ,0)} 1 1 2 3 4 I(𝓉 ) ={(u ,2), (u ,3), (u ,3), (u ,2)} 2 1 2 3 4 I(𝓉 ) ={(u ,3), (u ,2), (u ,1), (u ,2)} 3 1 2 3 4 The tabular form of 4-SS is interpreted in Table 37. The membership (ξ ), neutral (δ), and non-membership (ϑ ) follow the following grad- ing criteria. For all u ∈ U,0 ≤ ξ(u) + δ(u) + ϑ(u) ≤ 1, where 0 ≤ δ(u), ϑ(u) ≤ 1. We allot grade 0 if 0 ≤ ξ(u)< 0.25. Similarly ∀u ∈ U we relate: grade 1 if 0.25 ≤ ξ(u)< 0.5, grade 2, if 0.5 ≤ ξ(u)< 0.75, grade 3, if 0.75 ≤ ξ(u)< 1.0. Then by Definition 14, the PF5-SS is given 356 U. U. REHMAN AND T. MAHMOOD Table 37. The tabular form of 4-SS. (I,T,5) 𝓉 𝓉 𝓉 1 2 3 u 023 u 232 u 231 u 022 Table 38. The tabular representation of the picture fuzzy 4-soft set in Example 15. (Y, (I,T,4)) 𝓉 𝓉 𝓉 1 2 3 u 0, (0.16, 0.4, 0.1) 2, (0.6, 0.2, 0.11) 3, (0.88, 0.05, 0.03) u 2, (0.65, 0.1, 0.15) 3, (0.8, 0.13, 0.05) 2, (0.58, 0.3, 0.1) u 2, (0.65, 0.25, 0.05) 3, (0.9, 0.05, 0.01) 1, (0.4, 0.2, 0.4) u 0, (0.1, 0.4, 0.4) 2, (0.7, 0.1, 0.0) 2, (0.7, 0.05, 0.2) Table 39. The tabular form of MP Example 15. ξ 𝓉 𝓉 𝓉 1 2 3 u 0.16 0.6 0.88 u 0.65 0.8 0.58 u 0.65 0.9 0.4 u 0.1 0.7 0.7 Table 40. The comparison table for MP in Example 15. . u u u u 1 2 3 4 u 3113 u 2322 u 2232 u 1113 as follows: ((u ,0), 0.16, 0.4, 0.1), ((u ,2), 0.65, 0.1, 0.15), ((u ,2), 0.55, 0.25, 0.05), 1 2 3 Y(𝓉 ) = ((u ,0), 0.1, 0.4, 0.4) ((u ,2), 0.6, 0.2, 0.11), ((u ,3), 0.8, 0.13, 0.05), ((u ,3), 0.9, 0.05, 0.01), 1 2 3 Y(𝓉 ) = ((u ,2), 0.71, 0.1, 0.0) ((u ,3), 0.88, 0.05, 0.03), ((u ,2), 0.58, 0.3, 0.1), ((u ,1), 0.4, 0.2, 0.4), 1 2 3 Y(𝓉 ) = ((u ,2), 0.7, 0.05, 0.2) Clearly, the PF5-SS can be described in the tabular form given in Table 38. The tabular form of the MP is given in Table 39. Next, we create the comparison table for MP which is presented in Table 40. After this the membership score for every firewall with the sum of grades 𝓎 𝒾 =1 𝒾 is gotten by subtracting the column sum from the row sum of Table 40. We presented it in the Table 38 (Table 41). Likewise, the tabular form of the nMP is given in Table 42. Next, we create the comparison table for nMP which is presented in Table 43. FUZZY INFORMATION AND ENGINEERING 357 Table 41. The score table for MP in Example 15. Grade sum 𝓎 Row sum (Rs ) Column sum (Cs ) = Rs − Cs 𝓉 1 1 1 1 1 𝒾 =1 u 58 8 0 u 79 7 2 u 69 7 2 u 46 10 −4 Table 42. The tabular representation of nMP in Example 15. δ 𝓉 𝓉 𝓉 1 2 3 u 0.4 0.2 0.05 u 0.10.130.3 u 0.25 0.05 0.2 u 0.4 0.1 0.05 Table 43. The comparison table for nMP in Example 15. . u u u u 1 2 3 4 u 3223 u 1322 u 1131 u 2123 Table 44. The score table for nMP in Example 15. Grade sum 𝓎 Row sum (Rs ) Column sum (Cs ) = Rs − Cs 𝓉 2 2 2 2 2 𝒾 =1 u 510 7 3 u 78 7 1 u 66 9 −3 u 48 9 −1 Table 45. The tabular representation of NMP in Example 15. ϑ 𝓉 𝓉 𝓉 1 2 3 u 0.1 0.11 0.03 u 0.15 0.05 0.1 u 0.05 0.01 0.4 u 0.4 0.0 0.2 After this the neutral membership score for every firewall with the sum of grades 𝓎 is gotten by subtracting the column sum from the row sum of Table 43.We 𝒾 =1 𝒾 presented it in Table 44. Similarly, now the tabular form of the NMP is given in Table 45. Next we create the comparison table for NMP which is presented in Table 46. After this the non-membership score for every firewall with the sum of grades 𝓎 is gotten by subtracting the column sum from the row sum of Table 46.We 𝒾 =1 𝒾 presented it in Table 47. 358 U. U. REHMAN AND T. MAHMOOD Table 46. The comparison table for NMP in Example 15. . u u u u 1 2 3 4 u 3121 u 2321 u 1132 u 2213 Table 47. The score table for NMP in Example 15. Grade sum 𝓎 Row sum (Rs ) Column sum (Cs ) = Rs − Cs 𝓉 3 3 3 3 3 𝒾 =1 u 57 7 0 u 78 7 1 u 67 8 −1 u 48 7 1 Table 48. Add the score of nMP given in table (44) and NMP given in Table 47. Grade sum 𝓎 = + 𝓉 2 3 4 2 3 𝒾 =1 u 53 0 3 u 71 1 2 u 6 −3 −1 −4 u 4 −11 0 Table 49. Table of ﬁnal score with grades linked with PF6-SS of Example 15. Grade sum 𝓎 FINAL SCORE= − 𝓉 1 4 1 4 𝒾 =1 u 50 3 −3 u 72 2 0 u 62 −46 u 4 −40 −4 Finally, we add the scores of neutral membership and non-membership and then sub- tract it by the score of membership as presented in Table 49. In Table 48 we show the addition of scores of neutral membership and non-membership. The firewall u has the greatest score so the expert wants to prefer the firewall u to the 3 1 company to purchase. 5. Comparison In this segment, we will compare our presented work PFN-SS with IFN-SS. By the following, we will show that the PFN-SS is more general and more effective than the IFN-SS. Example 16: An expert wants to give his opinion about the presidential election of Amer- ica. Let there are 3 presidential candidates in the election, i.e. U ={u , u , u },and T = 1 2 3 {𝓉 , 𝓉 , 𝓉 } be a set of attributes, where 𝓉 represents experience, 𝓉 represents working 1 2 3 1 2 abilities, and 𝓉 future vision. An expert gives them grades based on these attributes in the 3 FUZZY INFORMATION AND ENGINEERING 359 Table 50. Information obtained from the associated data. 𝓉 𝓉 𝓉 1 2 3 Table 51. The tabular form of 5-SS. (I,T,5) 𝓉 𝓉 𝓉 1 2 3 u 434 u 344 u 104 Table 52. The tabular representation of IF5-SS (K, (I,T,5)) in Example 16. (K, (I,T,5)) 𝓉 𝓉 𝓉 1 2 3 u 4, (0.9, 0.04) 3, (075, 0.1) 4, (0.85, 0.1) u 3, (0.75, 0.2) 4, (0.87, 0.08) 4, (0.89, 0.04) u 1, (0.25, 0.5) 0, (0.13, 0.4) 4, (0.9, 0.04) shape of stars which is presented in Table 50. Where Four stars are for ‘Excellent’, three stars are for ‘very good’, two stars are for ‘good’, one star is for ‘normal’, a hole is for ‘poor’. The set Y ={0, 1, 2, 3, 4} can be associated with the stars given in Table 50, where 4 rep- resents , 3 represents , 2 represents , 1 represents , and 0 represents .The 5-SS (I, T,5) is given as follows: I(𝓉 ) ={(u ,4), (u ,3), (u ,1)} 1 1 2 3 I(𝓉 ) ={(u ,3), (u ,4), (u ,0),} 2 1 2 3 I(𝓉 ) ={(u ,4), (u ,4), (u ,4),} 3 1 2 3 The tabular form of 5-SS is interpreted in Table 51. An expert link an IFN with each of the grade given by his self. In the result, he will get IF5-SS which is presented in Table 49 (Table 52). To explain this more we consider the cell in the 1st row and 3rd column, i.e. 3, (0.75, 0.1), where 3 is the grade given by the expert to the candidate u on his working ability, 0.75 be the grade of membership which is given by the expert to the candidate u based on his working ability and 0.1 is the grade of non-membership given to the candidate u by the expert. Now we will use the algorithm defined for IFN-SS by Akram et al. [46] to find which can- didate will win the election in the expert’s opinion. The tabular form of MP is described in Table 53. We create the comparison table for MP which is presented in Table 54.Afterthis the membership score for every presidential candidate with the sum of grades 𝓎 𝒾 =1 𝒾 is gotten by subtracting the column sum from the row sum of Table 54. We presented it in Table 55. Similarly, now the tabular form of the NMP is given in Table 56. We create the comparison table for NMP which is presented in Table 57. After this the non-membership score for a 360 U. U. REHMAN AND T. MAHMOOD Table 53. The tabular representation of MP Example 16. ξ 𝓉 𝓉 𝓉 1 2 3 u 0.9 0.75 0.85 u 0.75 0.87 0.89 u 0.25 0.13 0.9 Table 54. The comparison table for MP in Example 16. . u u u 1 2 3 u 312 u 232 u 113 Table 55. The score table for MP in Example 16. Grade sum 𝓎 Row sum (Rs ) Column sum (Cs ) = Rs − Cs 𝓉 1 1 1 1 1 𝒾 =1 u 11 6 6 0 u 11 7 5 2 u 55 7 −2 Table 56. The tabular representation of NMP in Example 16. ϑ 𝓉 𝓉 𝓉 1 2 3 u 0.04 0.1 0.1 u 0.2 0.08 0.04 u 0.5 0.4 0.04 Table 57. The comparison table for NMP in Example 16. . u u u 1 2 3 u 321 u 131 u 233 presidential candidate with the sum of grades 𝓎 is gotten by subtracting the 𝒾 =1 𝒾 column sum from the row sum of Table 57. We presented it in the Table 58. Finally, we subtract the score of non-membership by the membership which is described in Table 59. According to the algorithm defined by Akram et al. [46], the expert found that presiden- tial candidate u has highest grades with the greatest score so he thinks u will the next 2 2 president of America. Table 58. The score table for NMP in Example 16. Grade sum 𝓎 Row sum (Rs ) Column sum (Cs ) = Rs − Cs 𝓉 3 3 3 3 3 𝒾 =1 u 11 6 6 0 u 11 5 8 −3 u 58 5 3 3 FUZZY INFORMATION AND ENGINEERING 361 Table 59. Table of ﬁnal score with grades linked with IF5-SS of Example 16. Grade sum 𝓎 FINAL SCORE= − 𝓉 1 3 1 3 𝒾 =1 u 11 0 0 0 u 11 2 −35 u 5 −23 −5 Table 60. The tabular form of PF5-SS of Example 16. (Y, (I,T,5)) 𝓉 𝓉 𝓉 1 2 3 u 4, (0.9, 0.05, 0.04) 3, (075, 0.01, 0.1) 4, (0.85, 0.04, 0.1) u 3, (0.75, 0.09, 0.2) 4, (0.87, 0.04, 0.08) 4, (0.89, 0.06, 0.04) u 1, (0.25, 0.08, 0.5) 0, (0.13, 0.03, 0.4) 4, (0.9, 0.05, 0.04) Table 61. The tabular representation of MP in Example 16. ξ 𝓉 𝓉 𝓉 1 2 3 u 0.9 0.75 0.85 u 0.75 0.87 0.89 u 0.25 0.13 0.9 Table 62. The comparison table for MP in Example 16. . u u 1 2 u 31 2 u 23 2 u 11 3 Later the expert realised that in this DM, he forgot to count the grade of neutral member- ship. Now he wants to add the grade of neutral membership in this DM because he knows that the voters may be categorised into 4 groups, i.e. vote for, abstains, vote against, and refusal of the voting. In the above DM, he has no abstain so now he wants to add this in this DM to get a more accurate and exact result. But he can’t add this grade of neutral mem- bership in the environment of IFN-SS. IFN-SS is unable to solve such data. To get the result the expert will use PFN-SS. Reconsider Example 15, The expert will link a PFN to every grade given in Table 51. As a result, he will get PF5-SS which is presented in Table 60. To explain this more we consider the cell in the 1st row and 3rd column, i.e. 3, (0.75, 0.01, 0.1), where 3 is the grade given by the expert to the candidate u on his work- ing ability, 0.75 be the grade of membership which is given by the expert to the candidate u based on his working ability, 0.01 is the grade of neutral membership, and 0.1 is the grade of non-membership given to the candidate u by the expert. Now we will use the algorithm defined in Section 4 of this article to find that which can- didate will win the election in the expert’s opinion. The tabular form of MP is described in Table 61. We create the comparison table for MP which is presented in Table 62.Afterthis the membership score for every presidential candidate with the sum of grades 𝓎 𝒾 =1 𝒾 is gotten by subtracting the column sum from the row sum of Table 62. We presented it in Table 63. 362 U. U. REHMAN AND T. MAHMOOD Table 63. The score table for MP in Example 16. Grade sum 𝓎 Row sum (Rs ) Column sum (Cs ) = Rs − Cs 𝓉 1 1 1 1 1 𝒾 =1 u 11 6 6 0 u 11 7 5 2 u 55 7 −2 Table 64. The tabular form of nMP is given in Example 16. δ t t t 1 1 1 u 0.05 0.01 0.045 u 0.09 0.04 0.06 u 0.08 0.03 0.05 Table 65. The comparison table for nMP in Example 16. . u u u 1 2 3 u 300 u 333 u 303 Table 66. The score table for nMP in Example 16. Grade sum 𝓎 Row sum (Rs ) Column sum (Cs ) = Rs − Cs 𝓉 2 2 2 2 2 𝒾 =1 u 11 3 9 −6 u 11 9 3 6 u 56 6 0 Table 67. The tabular form of NMP given in Example 16. ϑ 𝓉 𝓉 𝓉 1 2 3 u 0.04 0.1 0.1 u 0.2 0.08 0.04 u 0.5 0.4 0.04 Likewise, the tabular form of the nMP is given in Table 64.We create the comparison table for nMP which is presented in Table 65. After this the neutral membership score for every presidential candidate with the sum of grades 𝓎 is gotten by subtracting 𝒾 =1 𝒾 thecolumnsumfrom therow sumofTable 65. We presented it in Table 66. Similarly, now the tabular form of the NMP is given in Table 67. We create the comparison table for NMP which is presented in Table 68. After this the non-membership score for a presidential candidate with the sum of grades 𝓎 is gotten by subtracting the 𝒾 =1 𝒾 column sum from the row sum of Table 68. We presented it in Table 69. Finally, we add the scores of neutral membership and non-membership and then sub- tract it by the score of membership as presented in Table 63. In Table 70, we show the addition of scores of neutral membership and non-membership. FUZZY INFORMATION AND ENGINEERING 363 Table 68. The comparison table for NMP in Example 16. . u u u 1 2 3 u 321 u 131 u 233 Table 69. The score table for NMP in Example 16. Grade sum 𝓎 Row sum (Rs ) Column sum (Cs ) = Rs − Cs 𝓉 3 3 3 3 3 𝒾 =1 u 11 6 6 0 u 11 5 8 −3 u 58 5 −3 Table 70. Add the score of nMP given in table (66) and NMP given in Table 69. Grade sum 𝓎 = + 𝓉 2 3 4 2 3 𝒾 =1 u 11 −60 −6 u 11 6 −33 u 50 3 −3 Table 71. Table of ﬁnal score with grades linked with PF5-SS of Example 16. Grade sum 𝓎 FINAL SCORE= − 𝓉 1 4 1 4 𝒾 =1 u 11 0 −66 u 11 2 3 −1 u 5 −2 −31 According to the algorithm defined in Section 4 of this article, the expert found that pres- idential candidate u has highest grades with the greatest score as presented in Table 71, so he thinks u will the next president of America. From Example 16, we observe the following results 1. When the expert uses the data in the form of IFN-SS, the candidate u is selected as a president but when he took the data in the shape of PFN-SS, the candidateu is selected as president. 2. In the IFN-SS the expert ignores the grade of neutral membership which effected the result of selecting candidates as we can see that after adding the neutral membership the result is different from the previous result. 3. On viewpoint 1 and 2 we can say that our proposed model PFN-SS give more precise and accurate result in DM. 4. Our defined algorithm in Section 4 is more general than the algorithm defined by Akram et al. [46]. One can solve IFN-SS data by our proposed algorithm by taking the neutral membership zero. By our proposed algorithm one can also solve the FN-SS by taking neutral membership and non-membership zero. 5. Our described model PFN-SS is more general than the IFN-SS and FN-SS. 6. PFN-SS is more effective and powerful than the existing methods. 364 U. U. REHMAN AND T. MAHMOOD 6. Conclusion and Future Study It is observed that one of the essential concept of neutral grade is missing in the IFN-SS theory. Concept of neutrality grade can be observed in the situation when we encounter human views including more answers of type: yes, abstain, no, refusal. To overcome this issue, we interpreted the idea of PFN-SS by merging PFSs and N-SSs in this manuscript. We defined some relevant properties of PFN-SS such as a compliment, restricted intersection and union, extended intersection, and union, M-subset, and F-subset of PFN-SS. We also linked PFSSs with PFN-SS by using a threshold. Further, we gave numerical examples to explain these notions. We described an algorithm to deal with PFN-SS data. To show the advantage and usefulness of the defined technique, we used two examples which are 1. Selection of corona vaccine 2. Selection of next generation firewall from real life by utilising PFN-SS data. In the selection of the corona vaccine we have seen that the corona vaccine u was the best vaccine to purchase according to the health expert. Similarly in the selection of a company for a job, we have seen that the company u was the best company for a job according to the expert. After this, we did a comparison of our work with IFN-SS by using Example 16 given in Section 5 in which we have seen that how PFN-SS change the result which an expert got by using IFN-SS data. From that example, we got the results that our defined algorithm in Section 4 is more general than the algorithm defined by Akram et al. [46]. One can solve IFN-SS data by our proposed algorithm by taking the neutral membership zero. By our proposed algorithm one can also solve the FN-SS by taking neutral membership and non-membership zero. This showed that our initiated method is more general and suitable than the intuitionistic fuzzy N-SS (IFN-SS), fuzzy N-SS (FN-SS), and N-SS. In near future, we aim to discuss this study in the environment of spherical fuzzy sets, T-spherical fuzzy sets [47], the environment of bipolar soft sets [48], etc. [49–52]. Disclosure statement No potential conflict of interest was reported by the author(s). Data Statement The data used in this manuscript is artificial and anyone can use it without prior permission by just citing this article. Notes on contributors Ubaid Ur Rehman received the MSC degrees in Mathematics from International Islamic University Islamabad, Pakistan, in 2018. He received has M.S. degrees in Mathematics from International Islamic University Islamabad, Pakistan, in 2020. Currently, He is a Student of Ph. D in mathematics from Inter- national Islamic University Islamabad, Pakistan. His research interests include similarity measures, soft set, fuzzy logic, fuzzy decision making, and their applications. He has published 7 articles in reputed journals. FUZZY INFORMATION AND ENGINEERING 365 Tahir Mahmood is Assistant Professor of Mathematics at Department of Mathematics and Statistics, International Islamic University Islamabad, Pakistan. He received his Ph.D. degree in Mathematics from Quaid-i-Azam University Islamabad, Pakistan in 2012 under the supervision of Professor Dr. Muham- mad Shabir. His areas of interest are Algebraic structures, Fuzzy Algebraic structures, and Soft sets. He has more than 180 international publications to his credit and he has also produced more than 46 MS students and 6 Ph.D. students. References [1] Zadeh LA. Fuzzy sets. Inf Control. 1965;8(3):338–353. [2] Atanassov K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986;20(1):87–96. [3] Cuong BC, Kreinovich V. Picture fuzzy sets. J Comput Sci Cyberne. 2014;30(4):409–420. [4] Cuong BC, Van Hai P. Some fuzzy logic operators for picture fuzzy sets. In 2015 seventh interna- tional conference on knowledge and systems engineering (KSE); 2015 Oct; IEEE. p. 132–137. [5] Luo M, Zhang Y. A new similarity measure between picture fuzzy sets and its application. Eng Appl Artif Intell. 2020;96:1–22. [6] Khan MJ, Kumam P, Deebani W, et al. Bi-parametric distance and similarity measures of picture fuzzy sets and their applications in medical diagnosis. Egypt Inf J. 2020;22(2):201–212. [7] Khan MJ, Kumam P, Deebani W, et al. Distance and similarity measures for spherical fuzzy sets and their applications in selecting mega projects. Mathematics. 2020;8(4):1–14. [8] Mahmood T, Rehman UU, Ali Z, et al. Hybrid vector similarity measures based on complex hesi- tant fuzzy sets and their applications to pattern recognition and medical diagnosis. J Intell Fuzzy Syst. 2020; (Preprint), 1–22. [9] Mahmood T, Rehman UU, Ali Z, et al. Jaccard and dice similarity measures based on novel complex dual hesitant fuzzy sets and their applications. Math Probl Eng. 2020;2020:1–25. [10] Molodtsov D. Soft set theory—first results. Comput Math Appl. 1999;37(4–5):19–31. [11] Maji PK, Biswas R, Roy A. Soft set theory. Comput Math Appl. 2003;45(4–5):555–562. [12] Feng F, Jun YB, Liu X, et al. An adjustable approach to fuzzy soft set based decision making. J Comput Appl Math. 2010;234(1):10–20. [13] Alcantud JCR, Santos-García G. A new criterion for soft set based decision making problems under incomplete information. Int J Comput Intell Syst. 2017;10(1):394–404. [14] Kong Z, Gao L, Wang L. Comment on “A fuzzy soft set theoretic approach to decision making problems”. J Comput Appl Math. 2009;223(2):540–542. [15] Roy AR, Maji PK. A fuzzy soft set theoretic approach to decision making problems. J Comput Appl Math. 2007;203(2):412–418. [16] Maji PK, Roy AR, Biswas R. An application of soft sets in a decision making problem. Comput Math Appl. 2002;44(8–9):1077–1083. [17] Zou Y, Xiao Z. Data analysis approaches of soft sets under incomplete information. Knowl Based Syst. 2008;21(8):941–945. [18] Ali MI, Feng F, Liu X, et al. On some new operations in soft set theory. Comput Math Appl. 2009;57(9):1547–1553. [19] Maji PK, Biswas RK, Roy A. (2001). Fuzzy soft sets. [20] Alcantud JCR. A novel algorithm for fuzzy soft set based decision making from multiobserver input parameter data set. Inf Fusion. 2016;29:142–148. [21] Maji PK, Biswas R, Roy AR. Intuitionistic fuzzy soft sets. J Fuzzy Math. 2001;9(3):677–692. [22] Khan MJ, Kumam P, Liu P, et al. A novel approach to generalized intuitionistic fuzzy soft sets and its application in decision support system. Mathematics. 2019;7(8):1–21. [23] Khan MJ, Kumam P, Liu P, et al. Another view on generalized interval valued intuitionistic fuzzy soft set and its applications in decision support system. J Intell Fuzzy Syst. 2020; (Preprint), 1–15. [24] Khan MJ, Kumam P, Alreshidi NA, et al. The renewable energy source selection by remote- ness index-based VIKOR method for generalized intuitionistic fuzzy soft sets. Symmetry (Basel). 2020;12(6):1–30. 366 U. U. REHMAN AND T. MAHMOOD [25] Khan MJ, Kumam P. Distance and similarity measures of generalized intuitionistic fuzzy soft set and its applications in decision support system. In International Conference on Intelligent and Fuzzy Systems; 2020, Jul. Cham: Springer; p. 355–362. [26] Yang Y, Liang C, Ji S, et al. Adjustable soft discernibility matrix based on picture fuzzy soft sets and its applications in decision making. J Intell Fuzzy Syst. 2015;29(4):1711–1722. [27] Khan MJ, Kumam P, Ashraf S, et al. Generalized picture fuzzy soft sets and their application in decision support systems. Symmetry (Basel). 2019;11(3):1–27. [28] Jan N, Mahmood T, Zedam L, et al. Multi-valued picture fuzzy soft sets and their applications in group decision-making problems. Soft Comput. 2020;24(24):18857–18879. [29] Khan MJ, Phiangsungnoen S, Kumam W. Applications of generalized picture fuzzy soft set in concept selection. Thai J Math. 2020;18(1):296–314. [30] Khan MJ, Kumam P, Liu P, et al. An adjustable weighted soft discernibility matrix based on generalized picture fuzzy soft set and its applications in decision making. J Intell Fuzzy Syst. 2020;38(2):2103–2118. [31] Khan MJ, Kumam P, Kumam W. Theoretical justifications for the empirically successful VIKOR approach to multi-criteria decision making. Soft Comput. 2021:1–7. https://doi.org/10.1007/ s00500-020-05548-6 [32] Akram M, Shabir M, Al-Kenani AN, et al. Hybrid decision-making frameworks under complex spherical fuzzy-soft sets. J Math. 2021;2021:1–46. [33] Fatimah F, Rosadi D, Hakim RBF, et al. Probabilistic soft sets and dual probabilistic soft sets in deci- sion making with positive and negative parameters. J Phys: Conf Ser. 2018 Mar; 983(1): 012112. IOP Publishing. [34] Gong K, Xiao Z, Zhang X. The bijective soft set with its operations. Comput Math Appl. 2010;60(8):2270–2278. [35] Naz M, Shabir M. On fuzzy bipolar soft sets, their algebraic structures and applications. J Intell Fuzzy Syst. 2014;26(4):1645–1656. [36] Fatimah F, Rosadi D, Hakim RF, et al. N-soft sets and their decision making algorithms. Soft comput. 2018;22(12):3829–3842. [37] Alcantud JCR, Feng F, Yager RR. An N-soft set approach to rough sets. IEEE Trans Fuzzy Syst. 2019;28(11):2996–3007. [38] Kamacı H, Petchimuthu S. Bipolar N-soft set theory with applications. Soft Comput. 2020;24(22): 16727–16743. [39] Fatimah F, Alcantud JCR. The multi-fuzzy N-soft set and its applications to decision-making. Neural Comput Appl. 2021;22(12):1–10. [40] Akram M, Shabir M, Ashraf A. Complex neutrosophic N-soft sets: a new model with applications. Neutrosophic Sets Syst. 2021;42:278–301. [41] Akram M, Wasim F, Al-Kenani AN. A hybrid decision-making approach under complex Pythagorean fuzzy N-soft sets. Int J Comput Intell Syst. 2021;14(1):1263–1291. [42] Mahmood T, Rehman UU, Ahmmad J. Complex picture fuzzy N-soft sets and their decision making algorithm. 2021; https://doi.org/10.21203/rs.3.rs-278288/v1. [43] Akram M, Ali G, Alcantud JC, et al. Parameter reductions in N-soft sets and their applications in decision-making. Expert Syst. 2021;38(1):1–15. [44] Ma X, Liu Q, Zhan J. A survey of decision making methods based on certain hybrid soft set models. Artif Intell Rev. 2017;47(4):507–530. [45] Akram M, Adeel A, Alcantud JCR. Fuzzy N-soft sets: a novel model with applications. J Intell Fuzzy Syst. 2018;35(4):4757–4771. [46] Akram M, Ali G, Alcantud JCR. New decision-making hybrid model: intuitionistic fuzzy N-soft rough sets. Soft Comput. 2019;23(20):9853–9868. [47] Mahmood T, Ullah K, Khan Q, et al. An approach towards decision making and medical diagnosis problems using the concept of spherical fuzzy sets. Neural Comput Appl. 2019;31:7041–7053. [48] Mahmood T. A novel approach toward bipolar soft Sets and their applications. J Math. 2020;2020:1–11. [49] Mahmood T, Rehman UU, Ali Z. Exponential and non-exponential based generalized similarity measures for complex hesitant fuzzy sets with applications. Fuzzy Inf Eng. 2020;12(1):1–33. FUZZY INFORMATION AND ENGINEERING 367 [50] Garg H, Mahmood T, Rehman UU, et al. CHFS: complex hesitant fuzzy sets-their applications to decision making with different and innovative distance measures. CAAI Trans Intell Technol. 2021;6(1):93–122. [51] Chinram R, Mahmood T, Rehman UU, et al. Some novel cosine similarity measures based on complex hesitant fuzzy sets and their applications. J Math. 2021;2021:1–20. [52] Rehman UU, Mahmood T, Ali Z, et al. A novel approach of complex dual hesitant fuzzy sets and their applications in pattern recognition and medical diagnosis. J Math. 2021;2021:1–31.
Journal
Fuzzy Information and Engineering
– Taylor & Francis
Published: Jul 3, 2021
Keywords: Picture fuzzy N-soft sets; intuitionistic fuzzy N-soft sets; N-soft sets; soft sets; picture fuzzy soft sets; decision-making