Next Article in Journal
Pre-Invexity and Fuzzy Fractional Integral Inequalities via Fuzzy Up and Down Relation
Previous Article in Journal
Traversable Wormhole in f(Q) Gravity Using Conformal Symmetry
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Picture Fuzzy Soft Prioritized Aggregation Operators and Their Applications in Medical Diagnosis

Department of Mathematics and Statistics, International Islamic University Islamabad, Islamabad 44000, Pakistan
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(4), 861; https://doi.org/10.3390/sym15040861
Submission received: 24 March 2023 / Revised: 31 March 2023 / Accepted: 1 April 2023 / Published: 4 April 2023
(This article belongs to the Section Mathematics)

Abstract

:
A medical diagnosis is one the most efficient processes of determining a disease based on a person’s symptoms and signs. In recent days, due to the complexities of the same type of diseases, it is very difficult to diagnose a disease by using old methods and techniques. In this way, new and efficient medical diagnosis methods can help a lot in reaching an accurate conclusion, depending upon the timing and sequences of symptoms and medical history. The physician relies on other clues like medical tests and imaging tests. So, in this way, a list of possible diagnoses can be determined, which are referred to as different diagnoses. To handle these types of issues in this manuscript, additional information is identified, and possible disease is confirmed. Under the consideration of classical data, it is a very difficult task to deal with complex and asymmetric sorts of data. Fuzzy set theory has a wide range of applications, from engineering to the medical field. Different methods and techniques have been proposed to support the decision-making process in medical fields. Picture fuzzy soft sets are more generalized structures and efficient tools to formalize the information more decently and accurately. So, devoted from this notion, in this article based on picture fuzzy soft settings, we firstly have established some basic operational laws for picture fuzzy soft number; then based on these operational laws, we have developed some aggregation operators named as picture fuzzy soft prioritized average and geometric aggregation operators. In real-world problems, these operators can be useful in analyzing uncomfortable and asymmetric information. Furthermore, some basic properties of the introduced operators have been initiated and discussed briefly. Moreover, to show the effective use of this developed approach to medical diagnoses, we have proposed an algorithm, along with a descriptive example. Additionally, a comparative analysis of the proposed work shows the superiority and effectiveness of the introduced approach.

1. Introduction

Before the development of modern technologies, techniques for the diagnosis and treatment in medicine were rudimentary, inconsistent, and unresponsive to a wide range of medical symptoms. Medical diagnosis before treatment is very important. Medical diagnosis is a challenging procedure that includes patient history, physical examinations, and tests. Keep in mind, a patient may describe a minor illness, such as a headache or an injured joint, using medical symptoms. However, in many cases medical symptoms are non-specific. For instance, two people with different illnesses—one with the heart, and the other with the lungs—might both experience chest pain. To make an accurate determination, a medical expert can create a list of symptoms and then compare it to other data; this means it is a very difficult task for the medical professional to decide the ailment of the patient suffering from a certain disease. In this regard, FST helps researchers to use it in medical fields. Many researchers have developed different methods and techniques to conform to the uses of FST in medical diagnoses. Since its inception, FST has been regarded as a suitable formalism to deal with many medical problems. Zadeh [1] initiated the idea of a fuzzy set that uses the membership grades belonging to [0, 1]. Many researchers find the uses of FS in medical fields, Steimann [2] uses FST in medicine, and Adlassnig [3] proposed a medical diagnosis based on FS settings. Moreover, based on the interval-valued fuzzy set, Choi et al. [4] proposed a medical diagnosis.
Note that FS is a limited notion, and it cannot describe the two types of aspects like membership grade (MG) and non-membership grade (NMG) in one structure. So, the idea of the intuitionistic fuzzy set (IFS) [5] has been developed to generalize the FS notion. IFS uses MG and NMG in one structure belonging to [0, 1]. After the successful invention of IFS, De et al. [6] utilizes IFS in medical diagnoses. Moreover, Yu [7] developed a group decision-making approach based on generalized IF geometric aggregation operators.
Additionally, Luo and Zhao [8] established distance measures between IFSs, and provided its application to medical diagnoses; this means that IFS also has applications in medical diagnoses. IFS is also a limited notion because when decision-makers come up with 0.5  as MG and 0.7  as NMG, then IFS fails to tackle this data because s u m ( 0.5 ,   0.7 ) [ 0 ,   1 ] . To cover this issue, the notion of the Pythagorean fuzzy set (PyFS) [9] has been developed. PyFS also has applications in medical diagnoses, because Xiao and Ding [10] established divergence measures based on PyFS settings and proved its application to medical diagnoses. Likewise, Khan et al. [11] proposed prioritized aggregation operators based on PyF settings and provide their applications to multi-attribute group decision-making (MAGDM). Moreover, Ejegwa [12] proposed an improved composite relations for PyFS, and initiated its applications to medical diagnoses. Furthermore, Lin et al. [13] provided directional correlation coefficient measures for PyFS and their applications to medical diagnoses and cluster analysis. Additionally, Molla et al. [14] provided an extended PROMETHEE method under the environment of PyFS, and used this method for medical diagnoses. Note that a q-rung orthopair fuzzy set (q-ROFS) [15] can generalize both IFS and PyFS, and this idea also has applications in medical fields. So, Liu et al. [16] introduced the definition of the complex q-rung orthopair fuzzy variation coefficient similarity measures and used this approach for medical diagnoses and pattern recognition. Similarly, Jan et al. [17] defined generalized dice similarity measures for q-ROFS with applications. Furthermore, Riaz et al. [18] introduced prioritized aggregation operators under the environment of q-ROF settings.
Note that all of the above ideas have their applications in medical diagnoses, but these structures are limited. We observe that in our real-life problems, we cannot restrict ourselves to two-dimensional strictures. Nevertheless, in any situation, we have to discuss three types of aspects like MG, abstinence grade (AG), or NMG. To cover these problems, Cuong [19] introduced the idea of a picture fuzzy set (PFS). PFS is a more advanced structure, and many researchers utilize this structure for medical diagnoses. We can see the applications and uses of PFS in medical diagnosis forms [20,21,22]. Additionally, Qiyas et al. [23] established linguistic PF Dombi aggregation operators and provided their application in MAGDM problems.
Molodtsov’s concept of a soft set [24] ( S f t S )  is a fundamental mathematical parameterization structure that can generalize FS. S f t S  is a function from a parameter to a crisp subset of the universe for modeling complex systems involving uncertain and unclear objects. Ali et al. [25] initiated basic algebraic structure for   S f t S .   After the notions of S f t S ,  many new developments have been made to show the importance of this idea. Many hybrid notions, like a fuzzy soft set ( F S f t S )  [26], IF soft set   ( I F S f t S )  [27], PyF soft set ( P y F S f t S )  [28], and q-ROF soft set ( q R O F S f t S )  [29], have been developed. Moreover, Akram and Nawaz [30] proposed fuzzy soft graphs with applications, and Arora and Garg [31] proposed prioritized average aggregation operators under the environment of I F S f t S s  settings. Furthermore, Hayat et al. [32] introduced applications of generalized I F S f t S s .
In the real world, there is a great deal of ambiguity, imprecision, and uncertainty. Dealing with uncertainty is a serious challenge in many disciplines, including economics, engineering, environmental research, medical science, and social science. Recently, modeling ambiguity has become a growing area of study for researchers. When there are several human answers, such as “no”, “yes”, “abstain”, and “refusal”, P F S f t S  models are typically used. A departmental employee of a corporation, for instance, may make a suitable example of a   P F S f t S . Some employees want to travel to two locations: one in Germany, and the other in Australia. However, some employees prefer to travel to Germany (MG) over Australia (NMG), while others prefer to travel to Australia (MG) over Germany (NMG), and still, others prefer to travel to both Germany and Australia—i.e., neutral employees. However, there are some employees who do not want to visit both places—i.e., refusal grades. The information aggregation step of the decision-making process is primarily responsible for the accuracy of the overall conclusion. So, in this regard, P F S f t S  is regarded as a more suitable structure to cover such kind of situations. Similarly, when we consider the phenomenon of voting, someone can vote in favor of someone, vote against someone, abstain to vote, or refuse to vote. So, picture fuzzy soft structure is the best tool where the three types of grades are utilized to model the human opinion—like yes, abstain, or no. We observe that all of the above structures are very useful and have their respective applications to FST, but the limitations of these existing theories are obvious. So, in this regard, the idea of P c F S f t S , introduced by Yang et al. [33], is a stronger structure, because note that
  • P c F S f t S  can discuss the parameterization tool.
  • P c F S f t S  involves three aspects—i.e., MG, NMG, and AG in one structure.
  • When we ignore the abstinence grade then the   P F S f t S    reduces to   I F S f t S .
Furthermore, note that when we use only one parameter in the basic structure of P F S f t S ,  then P F S f t S  reduces to a simple picture fuzzy set.
Asymmetric information is frequently used since choosing the best alternative information is not always symmetric because the alternatives do not have all the information. Nowadays, as medical diagnoses have become a hot topic in FST, we can observe from the above analysis that many scholars have used their respective fuzzy structures for medical diagnoses. So, due to the dominant features of picture fuzzy soft sets, in this article we have established some aggregation operators for picture fuzzy soft set settings. Additionally, based on these developed structures, we have introduced an application of these structures for medical diagnoses. All of the results show the effective use of this developed structure in the medical field.
The rest of the article is organized as follows: We have provided some fundamental definitions in the second part like FS, S f t S ,     F S f t S , I F S f t S ,     P y F S f t S ,     q R O F S f t S ,    PFS, and P F S f t S .  We have presented certain P F S f t  operating laws in Section 3. Section 4 deals with P F S f t P W A    aggregation operators and their properties are elaborated precisely. In Section 5, we have proposed P F S f t P W G  aggregation operators. Section 6 discusses an algorithm and an example to demonstrate how these operators operate. In Section 7, we have given a comparative analysis of established work. Finally, Section 8 deals with concluding remarks.

2. Preliminaries

A medical diagnosis refers to the process of determining a disease, condition, or manifestation of its signs and symptoms. A health history physical exam and biopsies may be used to help make a diagnosis. The process of a medical diagnosis helps medical professionals to reach an appropriate decision. The use of different FS structures in medical diagnoses can be seen in [3,6,7].
In the following, we will propose some basic definitions of FS, S f t S ,     F S f t S ,     I F S f t S ,     P y F S f t S ,     q R O F S f t S ,     P F S ,   a n d   P F S f t S .
Definition 1. 
[1]: Considering  Ζ  as a general set, the notion of the form
ζ = { L ( τ ) : τ Ζ }
is called an FS, where L ( τ ) :   Ζ [ 0 ,   1 ]  denotes the MG and 0 L ( τ ) 1 .
Definition 2. 
[24]: Let  Ζ  be a general set and  ρ  denote a parameter set (PS),    P ρ , a  S f t S  is a pair  ( ,   P ) ,  where  : P P ( Ζ ) ,    where  P ( Ζ )  is the power set of   Ζ .
Definition 3. 
[26]: Consider the universal set  Ζ ,    ρ  as a PS, and let   P ρ . The notion of  F S f t S  is a pair  ( ,   P ) ,  where  : P P ( F S )    and  P ( F S )  denotes the power set of FSs.
Definition 4. 
[27]: Consider the universal set  Ζ ,   ρ  as a PS, and let   P ρ . An  I F S f t S  is the pair  ( ,   P ) , where  : P I F S Ζ ,   a n d   I F S Ζ  denotes the power set of IFS given by
  ζ ρ ґ ӻ = ( τ ,   L ґ ӻ ( τ ) ,   T ґ ӻ ( τ ) |   τ Ζ )
where L ґ ӻ :   Ζ [ 0 ,   1 ]   denotes the MG and T ґ ӻ :   Ζ [ 0 ,   1 ] , denotes the NMG with the condition that 0 L ґ ӻ ( τ ) + T ґ ӻ ( τ ) 1 .
Definition 5. 
[27]: Consider the universal set  Ζ ,   ρ  as a set of parameters, and let   P ρ . A  P y F S f t S  is the pair  ( ,   P ) , where  : P P y F S Ζ ,   a n d   P y F S Ζ  denotes the power set of PyFS given by
  ζ ρ ґ ӻ = ( L ґ ӻ ,   T ґ ӻ )
where L ґ ӻ :   Ζ [ 0 ,   1 ]   represents the MG, and T ґ ӻ :   Ζ [ 0 ,   1 ]   denotes the NMG with 0 L ґ ӻ 2 + T ґ ӻ 2 1 .
Definition 6. 
[29]: Consider the universal set  Ζ ,   ρ  as a PS, and let   P ρ . A  q R O F S f t S  is the pair  ( ,   P ) , where  : P q R O F S Ζ ,   a n d   q R O F S Ζ  denotes the power set of q-ROFS given by
  ζ ρ ґ ӻ = ( L ґ ӻ ,   T ґ ӻ )
where L ґ ӻ :   Ζ [ 0 ,   1 ]    represents the MG, and T ґ ӻ :   Ζ [ 0 ,   1 ]    denotes the NMG with 0 L ґ ӻ q + T ґ ӻ a 1   f o r   q 1 .
Definition 7. 
[19]: A set of the form
ζ = { L ( τ ) ,   D ( τ ) ,   T ( τ ) :   τ Ζ }
is called a PFS on a universal set Ζ , where L ( τ ) :   Ζ [ 0 ,   1 ]  denotes the MG, D ( τ ) :   Ζ [ 0 ,   1 ]  denotes the AG, and T ( τ ) :   Ζ [ 0 ,   1 ]  denotes the NMG with s u ѫ   ( L ( τ ) ,   D ( τ ) ,   T ( τ ) ) [ 0 ,   1 ] .
Definition 8. 
[33]: For general set   Ζ ,   ρ  as a PS, and   P ρ . A pair  ( ,   P )  is called  P F S f t S  where  : P P F S Ζ ,  is defined by
  ζ ρ ґ ӻ = { L ґ ӻ ( τ ) ,   D ґ ӻ ( τ ) ,   T ґ ӻ ( τ ) : τ Ζ }
where P F S Ζ    denotes the collection of the PFS. Here, L ґ ӻ ( τ ) ,   D ґ ӻ ( τ )   and   T ґ ӻ ( τ )    denotes the MG, AG, and NMG, respectively, with   0 ( L ґ ӻ ( τ ) ) + ( D ґ ӻ ( τ ) ) + ( T ґ ӻ ( τ ) ) 1 .

3. Operational Laws for Picture Fuzzy Soft Numbers

In this section, we will discuss the fundamental operating rules for P F S f t N s .
Definition 9. 
Assume that   ζ ρ 11 = { ( L 11 ( τ ) , D 11 ( τ ) ,   T 11 ( τ ) ) : τ Ζ } ,     ζ ρ 12 = { ( L 12 ( τ ) ,   D 12 ( τ ) ,   T 12 ( τ ) ) : τ Ζ }    represents two  P F S f t N s , and for any real number  > 0 ,    the rules are given by
  • ζ ρ 11 ζ ρ 12 = { ( L 11 ( τ ) + L 12 ( τ ) L 11 ( τ ) L 12 ( τ ) ) ,   ( D 11 ( τ ) D 12 ( τ ) ) ,   ( T 11 ( τ ) T 12 ( τ ) ) } .
  • ζ ρ 11 ζ ρ 12 = { ( L 11 ( τ ) L 12 ( τ ) ) ,   ( D 11 ( τ ) D 12 ( τ ) ) ,   ( T 11 ( τ ) + T 12 ( τ ) T 11 ( τ ) T 12 ( τ ) ) } .
  • ζ ρ 11 = { ( 1 ( 1 L 11 ( τ ) ) ) ,   ( D 11 ( τ ) ) ,   ( T 11 ( τ ) ) } .
  • ζ ρ 11 = { ( L 11 ( τ ) ) ,   ( 1 ( 1 D 11 ( τ ) ) ) ,   ( 1 ( 1 T 11 ( τ ) ) ) }
Definition 10. 
For a   P F S f t N   ζ ρ = { ( L ( τ ) , D ( τ ) ,   T ( τ ) ) : τ Ζ } ,   the score function (SF) and accuracy function (AF) are respectively given by
S c ( ζ ρ ) = ( 1 + L ( τ ) T ( τ ) ) 2 ,   S c ( ζ ρ ) [ 0 ,   1 ]
A c ( ζ ρ ) = L ( τ ) T ( τ ) ,   A c ( ζ ρ ) [ 1 ,   1 ]
Definition 11. 
S u p p o s e   ζ ρ 11 = { ( L 11 ( τ ) , D 11 ( τ ) ,   T 11 ( τ ) ) : τ Ζ } ,     ζ ρ 12 = { ( L 12 ( τ ) ,   D 12 ( τ ) ,   T 12 ( τ ) ) : τ Ζ }  denotes two  P F S f t N s , then we have
  • If   S c (   ζ ρ 11 ) < S c (   ζ ρ 12 )    then   ζ ρ 11 < ζ ρ 12 .
  • If S c (   ζ ρ 11 ) = S c (   ζ ρ 12 )   then
(1)
If A c (   ζ 1 ) < A c (   ζ ρ 12 )   then   ζ ρ 11 < ζ ρ 12 .
(2)
If A c (   ζ ρ 11 ) = A c (   ζ ρ 12 )   then   ζ ρ 11 = ζ ρ 12 .
Theorem 1. 
(Commutative law) For two  P F S f t N s ,   ζ ρ 11 = { ( L 11 ( τ ) , D 11 ( τ ) ,   T 11 ( τ ) ) : τ Ζ } ,   ζ ρ 12 = { ( L 12 ( τ ) ,   D 12 ( τ ) ,   T 12 ( τ ) ) : τ Ζ } ,  we have
(1)
ζ ρ 11 ζ ρ 12 = ζ ρ 12 ζ ρ 11
(2)
ζ ρ 11 ζ ρ 12 = ζ ρ 12 ζ ρ 11 .
Theorem 2. 
(Associative law) For three  P F S f t N s ,   ζ ρ 11 = { ( L 11 ( τ ) , D 11 ( τ ) ,   T 11 ( τ ) ) : τ Ζ } ,   ζ ρ 12 = { ( L 12 ( τ ) ,   D 12 ( τ ) ,   T 12 ( τ ) ) : τ Ζ }  and   ζ ρ 13 = { ( L 13 ( τ ) ,   D 13 ( τ ) ,   T 13 ( τ ) ) : τ Ζ } ,
(1)
( ζ ρ 11 ζ ρ 12 ) ζ ρ 13 = ζ ρ 11 ( ζ ρ 12 ζ ρ 13 )
(2)
( ζ ρ 11 ζ ρ 12 ) ζ ρ 13 = ζ ρ 11 ( ζ ρ 12 ζ ρ 13 ) .
Theorem 3. 
For three  P F S f t N s ,   ζ ρ 11 = { ( L 11 ( τ ) , D 11 ( τ ) ,   T 11 ( τ ) ) : τ Ζ } ,   ζ ρ 12 = { ( L 12 ( τ ) ,   D 12 ( τ ) ,   T 12 ( τ ) ) : τ Ζ } , and    ζ ρ 13 = { ( L 12 ( τ ) ,   D 12 ( τ ) ,   T 12 ( τ ) ) : τ Ζ } ,  the following properties hold
(1)
( ζ ρ 11 ζ ρ 12 ) = ζ ρ 11 ζ ρ 12
(2)
( ζ ρ 11 ζ ρ 12 ) = ζ ρ 11 ζ ρ 12
(3)
1 ζ ρ 2 ζ ρ = ( 1 + 2 ) ζ ρ
(4)
ζ ρ 1 ζ ρ 2 = ζ ρ ( 1 + 2 ) .
Proofs of Theorems 1, 2, and 3 are straightforward, so we will omit their proofs.

4. Picture Fuzzy Soft Prioritized Average and Geometric Aggregation Operators

The fundamental description of P F S f t  prioritized average ( P F S f t P A )  aggregation operators is in this section. Additionally, the characteristics of these newly introduced operators have been described.

4.1. Picture Fuzzy Soft Prioritized Average ( P F S f t P A )  Aggregation Operators

In this subsection, we have to present P F S f t P A  aggregation operators. Furthermore, the properties of these operators are described.
Definition 12. 
Let    ζ ρ ґ ӻ = ( L ґ ӻ ,   D ґ ӻ ,   T ґ ӻ )  denote the family of  P F S f t N s ,  ( ґ   =   1 ,   2 ,   ,   ѫ ;   ӻ =   1 ,   2 ,   ,   и ) . Then, picture fuzzy soft prioritized weighted average aggregation operator is defined by
P F S f t P W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) = ґ = 1 ѫ ɧ ґ ґ = 1 ѫ ɧ ґ ( ӻ = 1 и ӻ ӻ = 1 и ӻ   ζ ρ ґ ӻ )
where 1 = 1 ,   ɧ 1 = 1 , ӻ = t = 1 ӻ 1 S c ( ζ ρ ґ t ) ,   ӻ   =   2 ,   3 ,   ,   и ,   ɧ ґ = o = 1 ґ 1 S c ( ζ ρ o ) ( ґ   =   2 ,   3 ,   ,   ѫ ) ,  and S c (   ζ ρ ґ ӻ )  represents the SF of P F S f t N s .
Now, by using the above-given Definition 12, we can define the following results:
Theorem 4. 
For a collection of   P F S f t N s  and    ζ ρ ґ ӻ = ( L ґ ӻ ,   D ґ ӻ ,   T ґ ӻ ) , the aggregated result for   P F S f t P W A  operator is again a   P F S f t N  given by
P F S f t P W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) = ( 1 ґ = 1 ѫ ( ӻ = 1 и ( 1 L ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ,   ґ = 1 ѫ ( ӻ = 1 и ( D ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ , ґ = 1 ѫ ( ӻ = 1 и ( T ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ )
Proof. 
For и = 1 ,  we get
P F S f t P W A (   ζ ρ 11 ,     ζ ρ 21 ,   ,     ζ ρ ѫ 1 ) = ґ = 1 ѫ ɧ ґ ґ = 1 ѫ ɧ ґ   ζ ρ ґ 1
= ( 1 ґ = 1 ѫ ( ( 1 L ґ 1 ) ɧ ґ ґ = 1 ѫ ɧ ґ ) ,   ґ = 1 ѫ ( D ґ 1 ) ɧ ґ ґ = 1 ѫ ɧ ґ , ґ = 1 ѫ ( T ґ 1 ) ɧ ґ ґ = 1 ѫ ɧ ґ )
= ( 1 ґ = 1 ѫ ( ӻ = 1 1 ( 1 L ґ ӻ ) ӻ ӻ = 1 1 ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ,   ґ = 1 ѫ ( ӻ = 1 1 ( D ґ ӻ ) ӻ ӻ = 1 1 ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ , ґ = 1 ѫ ( ӻ = 1 1 ( T ґ ӻ ) ӻ ӻ = 1 1 ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ )
and for ѫ   = 1 ,
P F S f t P W A (   ζ ρ 11 ,     ζ ρ 21 ,   ,     ζ ρ ѫ 1 ) = ӻ = 1 и ӻ ӻ = 1 и ӻ   ζ ρ 1 ӻ
= ( 1 ӻ = 1 и ( ( 1 L 1 ӻ ) ӻ ӻ = 1 и ӻ ) ,   j = 1 n ( D 1 j ) ӻ ӻ = 1 и ӻ , j = 1 n ( T 1 j ) ӻ ӻ = 1 и ӻ )
= ( 1 ґ = 1 1 ( ӻ = 1 и ( 1 L ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 1 ɧ ґ ,   ґ = 1 1 ( ӻ = 1 и ( D ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 1 ɧ ґ , ґ = 1 1 ( ӻ = 1 и ( T ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 1 ɧ ґ )
Hence, Equation (2) holds for и   =   1  and ѫ   =   1 .  Assuming that Equation (2) holds for   ѫ   =   α 1 + 1 , и   =   α 2 , ѫ   =   α 1 , and и   =   α 2 + 1 , we get
P F S f t P W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) = ґ = 1 α 1 + 1 ɧ ґ ґ = 1 ѫ ɧ ґ ( ӻ = 1 α 2 ӻ ӻ = 1 и ӻ   ζ ρ ґ ӻ )
= ( 1 ґ = 1 α 1 + 1 ( ӻ = 1 α 2 ( 1 L ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ,   ґ = 1 α 1 + 1 ( ӻ = 1 α 2 ( D ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ , ґ = 1 α 1 + 1 ( ӻ = 1 α 2 ( T ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ )
and
ґ = 1 α 1 ɧ ґ ґ = 1 ѫ ɧ ґ ( ӻ = 1 α 2 + 1 ӻ ӻ = 1 и ӻ   ζ ρ ґ ӻ )
= ( 1 ґ = 1 α 1 ( ӻ = 1 α 2 + 1 ( 1 L ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ,   ґ = 1 α 1 ( ӻ = 1 α 2 + 1 ( D ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ , ґ = 1 α 1 ( ӻ = 1 α 2 + 1 ( T ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ )
Now,
ґ = 1 α 1 + 1 ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ( ӻ = 1 α 2 + 1 ӻ ӻ = 1 α 2 + 1 ӻ   ζ ρ ґ ӻ ) = ґ = 1 α 1 + 1 ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ( ӻ = 1 α 2 ӻ ӻ = 1 α 2 + 1 ӻ   ζ ρ ґ ӻ α 2 + 1 ӻ = 1 α 2 + 1 ӻ   ζ ρ ( α 2 + 1 ) ӻ ) = ( ґ = 1 α 1 + 1 ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ӻ = 1 α 2 ( ӻ ӻ = 1 α 2 + 1 ӻ   ζ ρ ґ ӻ ) ) ґ = 1 α 1 + 1 ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ( α 2 + 1 ӻ = 1 α 2 + 1 ӻ   ζ ρ ( α 2 + 1 ) ӻ ) = ( 1 ґ = 1 α 1 + 1 ( ӻ = 1 α 2 ( 1 L ґ ӻ ) ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ 1 ґ = 1 α 1 + 1 ( ( 1 L α 2 + 1 ӻ ) ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ,   ґ = 1 α 1 + 1 ( ӻ = 1 α 2 ( D ґ ӻ ) α 2 + 1 ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ   ґ = 1 α 1 + 1 ( ( D α 2 + 1 ӻ ) α 2 + 1 ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ґ = 1 α 1 + 1 ( ӻ = 1 α 2 ( T ґ ӻ ) α 2 + 1 ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ґ = 1 α 2 + 1 ( ( T α 2 + 1 ӻ ) α 2 + 1 ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ) = ( 1 ґ = 1 α 1 + 1 ( ӻ = 1 α 2 + 1 ( 1 L ґ ӻ ) ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ,   ґ = 1 α 1 + 1 ( ӻ = 1 α 2 + 1 ( D ґ ӻ ) ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ , ґ = 1 α 1 + 1 ( ӻ = 1 α 2 + 1 ( T ґ ӻ ) ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ )
Hence, Equation (2) holds for ѫ = α 1 + 1  and и = α 2 + 1 .  So, the result holds for all positive integers ѫ ,   и 1 , by mathematical induction. □

4.2. Properties of Picture Fuzzy Soft Prioritized Weighted Average Aggregation Operators

Here in this section, we will discuss some basic properties of P F S f t P W A  aggregation operators.
  • (Idempotency): If   ζ ρ ґ ӻ = ζ ρ = ( L ,   D ,   T )  for all ґ ,   ӻ , then
    P F S f t P W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) = ζ ρ .
Proof. 
Proof is trivial. □
2.
(Boundedness): If   ζ ρ ґ ӻ = ( min ґ min ӻ { L ґ ӻ } ,   max ґ max ӻ { D ґ ӻ } ,   max ґ max ӻ { T ґ ӻ } )  and   ζ + ρ ґ ӻ = ( max ґ max ӻ { L ґ ӻ } ,   min ґ min ӻ { D ґ ӻ } ,   min ґ min ӻ { T ґ ӻ } ) , then   ζ ρ ґ ӻ P F S f t P W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n )   ζ + ρ ґ ӻ .
Proof. 
As   ζ ρ ґ ӻ  denote P F S f t N s , then for all ґ ,   ӻ
min ґ min ӻ { L ґ ӻ } { L ґ ӻ } max ґ max ӻ { L ґ ӻ } 1 max ґ max ӻ { L ґ ӻ } 1 L ґ ӻ   1 min ґ min ӻ { L ґ ӻ }
( 1 max ґ max ӻ ( L ґ ӻ ) ) ӻ ӻ = 1 и ӻ ( 1 ( L ґ ӻ ) ) ӻ ӻ = 1 и ӻ ( 1 min ґ min ӻ ( L ґ ӻ ) ) ӻ ӻ = 1 и ӻ
( 1 max ґ max ӻ ( L ґ ӻ ) ) ( ӻ = 1 и ( 1 L ґ ӻ ) ӻ ӻ = 1 и ӻ ) ( 1 max ґ max ӻ ( L ґ ӻ ) )
( 1 max ґ max ӻ ( L ґ ӻ ) ) ґ = 1 ѫ ( ӻ = 1 и ( 1 L ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ( 1 min ґ min ӻ ( L ґ ӻ ) )
Hence,
( min ґ min ӻ ( L ґ ӻ ) ) 1 ґ = 1 ѫ ( ӻ = 1 и ( 1 L ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ( max ґ max ӻ ( L ґ ӻ ) )
Furthermore,
min ґ min ӻ ( D ґ ӻ ) ( D ґ ӻ ) max ґ max ӻ ( D ґ ӻ )
( min ґ min ӻ ( D ґ ӻ ) ) ӻ ӻ = 1 и ӻ ( D ґ ӻ ) ӻ ӻ = 1 и ӻ ( max ґ max ӻ ( D ґ ӻ ) ) ӻ ӻ = 1 и ӻ
( min ґ min ӻ ( D ґ ӻ ) ) ӻ = 1 и ( D ґ ӻ ) ӻ ӻ = 1 и ӻ ( max ґ max ӻ ( D ґ ӻ ) )
( min ґ min ӻ ( D ґ ӻ ) ) ɧ ґ ґ = 1 ѫ ɧ ґ ( ӻ = 1 и ( D ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ( max ґ max ӻ ( D ґ ӻ ) ) ɧ ґ ґ = 1 ѫ ɧ ґ
( min ґ min ӻ ( D ґ ӻ ) ) ґ = 1 ѫ ɧ ґ ґ = 1 ѫ ɧ ґ ґ = 1 ѫ ( ӻ = 1 и ( D ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ( max ґ max ӻ ( D ґ ӻ ) ) ґ = 1 ѫ ɧ ґ ґ = 1 ѫ ɧ ґ
Hence,
( min ґ min ӻ ( D ґ ӻ ) ) ґ = 1 ѫ ( ӻ = 1 и ( D ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ( max ґ max ӻ ( D ґ ӻ ) )
Additionally,
min ґ min ӻ ( T ґ ӻ ) ( T ґ ӻ ) max ґ max ӻ ( T ґ ӻ ) ( min ґ min ӻ ( T ґ ӻ ) ) ӻ ӻ = 1 и ӻ ( T ґ ӻ ) ӻ ӻ = 1 и ӻ ( max ґ max ӻ ( T ґ ӻ ) ) ӻ ӻ = 1 и ӻ ( min ґ min ӻ ( T ґ ӻ ) ) ӻ = 1 и ( T ґ ӻ ) ӻ ӻ = 1 и ӻ ( max ґ max ӻ ( T ґ ӻ ) ) ( min ґ min ӻ ( T ґ ӻ ) ) ɧ ґ ґ = 1 ѫ ɧ ґ ( ӻ = 1 и ( T ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ( max ґ max ӻ ( T ґ ӻ ) ) ɧ ґ ґ = 1 ѫ ɧ ґ ( min ґ min ӻ ( T ґ ӻ ) ) ґ = 1 ѫ ɧ ґ ґ = 1 ѫ ɧ ґ ґ = 1 ѫ ( ӻ = 1 и ( T ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ( max ґ max ӻ ( T ɧ ӻ ) ) ґ = 1 ѫ ɧ ґ ґ = 1 ѫ ɧ ґ
Hence,
( min ґ min ӻ ( T ґ ӻ ) ) ґ = 1 ѫ ( ӻ = 1 и ( T ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ( max ґ max ӻ ( T ґ ӻ ) )
Let   ξ = P F S f t P W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) = ( L ξ ,   D ξ ,   T ξ ) , then by Equations (3)–(5), we have min ґ min ӻ ( L ґ ӻ ) L ξ max ґ max ӻ ( L ґ ӻ ) ,   min ґ min ӻ ( D ґ ӻ ) D ξ max ґ max ӻ ( D ґ ӻ ) , and min ґ min ӻ ( T ґ ӻ ) T ξ max ґ max ӻ ( T ґ ӻ ) .  Now
S c ( ξ ) = ( 1 + L ξ T ξ ) 2 ( 1 + max ґ max ӻ ( L ґ ӻ ) min ґ min ӻ ( T ґ ӻ ) 2 ) = S c (   ζ + ρ ґ ӻ ) ,
and
S c ( ξ ) = ( 1 + L ξ T ξ ) 2 ( 1 + min ґ min ӻ ( L ґ ӻ ) max ґ max ӻ ( T ґ ӻ ) 2 ) = S c (   ζ ρ ґ ӻ ) S c ( ξ ) Sc (   ζ ρ ґ ӻ ) .
Now, the following cases arise
Case 1: 
If S c (   ζ ρ ґ ӻ ) < S c (   ζ + ρ ґ ӻ )  and   S c (   ζ ρ ґ ӻ ) > S c (   ζ ρ ґ ӻ ) ,  then by the comparison law for the two P F S f t N s , we have
  ζ ρ ґ ӻ P F S f t P W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n )   ζ + ρ ґ ӻ
Case 2: 
If   S c (   ζ ρ ґ ӻ ) = S c (   ζ + ρ ґ ӻ ) , that is ( 1 + L ξ T ξ ) 2 = ( 1 + max ґ max ӻ ( L ґ ӻ ) min ґ min ӻ ( T ґ ӻ ) 2 ) ,   then by using the above inequalities, we get L ξ = max ӻ max ґ ( L ґ ӻ ) , D ξ = min ӻ min ґ ( D ґ ӻ ) , and   T ξ = min ӻ min ґ ( T ґ ӻ ) .
Thus, A c ( ξ ) = L ξ T ξ = max ӻ max ґ ( L ґ ӻ ) + min ӻ min ґ ( D ґ ӻ ) + min ӻ min ґ ( T ґ ӻ ) = A c (   ζ + ρ ґ ӻ ) ; this implies that
P F S f t P W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) = (   ζ + ρ ґ ӻ ) .
Case 3: 
If   S c (   ζ ρ ґ ӻ ) = S c (   ζ + ρ ґ ӻ ) ,   that   i s, L ξ + D ξ + T ξ = ( 1 + min ґ min ӻ ( L ґ ӻ ) max ґ max ӻ ( T ґ ӻ ) 2 ) ,   then by using the above inequalities, we get L ξ = min ӻ min ґ ( L ґ ӻ ) , D ξ = max ӻ max ґ ( D ґ ӻ )  and   T ξ = max ӻ max ґ ( T ґ ӻ ) .
Thus, A c ( ξ ) = L ξ T ξ = min ӻ min ґ ( L ґ ӻ ) + max ӻ max ґ ( D ґ ӻ ) + max ӻ max ґ ( T ґ ӻ ) = A c (   ζ ρ ґ ӻ ) ; this implies that
P F S f t P W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) = (   ζ ρ ґ ӻ ) .
3.
Monotonicity: Let   ζ ^ ρ ґ ӻ = ( L ^ ґ ӻ ,   D ^ ґ ӻ ,   T ^ ґ ӻ )  be any other family of the P F S f t N s , such that     ζ ρ ґ ӻ ζ ^ ρ ґ ӻ  for all ґ ,   ӻ , then the P F S f t P W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) P F S f t P W A (   ζ ^ ρ 11 ,     ζ ^ ρ 12 ,   ,     ζ ^ ρ m n ) .
Proof. 
The proof is similar to the proof of property 2. □

4.3. Picture Fuzzy Soft Prioritized Ordered Weighted Average ( P F S f t P O W A )  Aggregation Operator

The fundamental definition of P F S f t P O W A  aggregation operators and their characteristics are covered in this subsection.
Definition 13. 
Let     ζ ρ ґ ӻ = ( L ґ ӻ ,   D ґ ӻ ,   T ґ ӻ ) denote the family of the   P F S f t N s , where   ( ґ = 1 ,   2 ,   ,   и ;   ӻ = 1 ,   2 ,   ,   ѫ ) . Then, picture fuzzy soft prioritized ordered weighted average aggregation operator is defined by
P F S f t P O W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) = ґ = 1 ѫ ɧ ґ ґ = 1 ѫ ɧ ґ ( ӻ = 1 и ӻ ӻ = 1 и ӻ   ζ ρ d ( ґ ) 𝓽 ( ӻ ) )
where 1 = 1 , ; ɧ 1 = 1 ; ӻ = t = 1 ӻ 1 S c ( ζ ρ ґ 𝓽 ( t ) ) ,   w h e r e   ӻ = 2 ,   3 ,   ,   и ; and ɧ ґ = o = 1 ґ 1 S c ( ζ ρ d ( o ) ) ( ґ = 2 ,   3 ,   ,   ѫ ) ,  where S c (   ζ ρ ґ ӻ )  represents the SF of P F S f t N s . Furthermore, d  and 𝓽  are the permutations of ( 1 ,   2 , ,   3 , , ѫ )   a n d   ( 1 ,   2 ,   3 ,   ,   и ) , such that ρ d ( ґ ) ӻ   ρ d ( ґ 1 ) ӻ  and ρ ґ 𝓽 ( ӻ 1 )   ρ ґ 𝓽 ( ӻ 1 )  for ґ = 2 ,   3 ,   ,   ѫ   and   j = 2 ,   3 ,   ,   и .
Theorem 5. 
For a family of  P F S f t N s ,    ζ ρ ґ ӻ = ( L ґ ӻ ,   D ґ ӻ ,   T ґ ӻ ) , the aggregated result for the  P F S f t P O W A  operator is again a  P F S f t N , given by
P F S f t P O W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ и ѫ ) = ( 1 ґ = 1 ѫ ( ӻ = 1 и ( 1 L d ґ 𝓽 ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ,   ґ = 1 ѫ ( ӻ = 1 и ( D d ґ 𝓽 ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ , ґ = 1 ѫ ( ӻ = 1 и ( T d ґ 𝓽 ӻ ) ӻ ӻ = 1 и ѫ ) ɧ ґ ґ = 1 ѫ ɧ ґ )
where 1 = 1 , ; ɧ 1 = 1 ; ӻ = t = 1 ӻ 1 S c ( ζ ρ ґ 𝓽 ( t ) ) ,   w h e r e   ӻ = 2 ,   3 ,   ,   и ; and ɧ ґ = o = 1 ґ 1 S c ( ζ ρ d ( o ) ) ( ґ = 2 ,   3 ,   ,   ѫ ) ,  where S c (   ζ ρ ґ ӻ )  represents the SF of P F S f t N s .
Proof. 
The proof is similar to the proof of Theorem 4. □
Similar to the P F S f t P W A  aggregation operators, the P F S f t P O W A  aggregation operator also satisfies some properties given by
  • Idempotency: If   ζ ρ ґ ӻ = ζ ρ = ( L ,   D ,   T )  for all ґ ,   ӻ , then
    P F S f t P O W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) = ζ ρ .
  • Boundedness: If   ζ ρ ґ ӻ = ( min ґ min ӻ { L ґ ӻ } ,   max ґ max ӻ { D ґ ӻ } ,   max ґ max ӻ { T ґ ӻ } )  and   ζ + ρ ґ ӻ = ( max ґ max ӻ { L ґ ӻ } ,   min ґ min ӻ { D ґ ӻ } ,   min ґ min ӻ { T ґ ӻ } ) , then   ζ ρ ґ ӻ P F S f t P O W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n )   ζ + ρ ґ ӻ .
  • Monotonicity: Let   ζ ^ ρ ґ ӻ = ( L ^ ґ ӻ ,   D ^ ґ ӻ ,   T ^ ґ ӻ )  be any other family of the P F S f t N s , such that     ζ ρ ґ ӻ ζ ^ ρ ґ ӻ  for all ґ ,   ӻ , then P F S f t P O W A (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) P F S f t P O W A (   ζ ^ ρ 11 ,     ζ ^ ρ 12 ,   ,     ζ ^ ρ m n ) .

5. Picture Fuzzy Prioritized Weighted Geometric ( P F S f t P W G )  Aggregation Operators

In this part of the article, we will discuss the basic definition and properties of P F S f t P W G  aggregation operators.
Definition 14. 
Let    ζ ρ ґ ӻ = ( L ґ ӻ ,   D ґ ӻ ,   T ґ ӻ )  denote the family of  S f t N s   ( ґ = 1 ,   2 ,   ,   и ;   ӻ = 1 ,   2 ,   ,   ѫ ) . Then, picture fuzzy soft prioritized weighted geometric aggregation operator is defined by
P F S f t P W G (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) = ґ = 1 ѫ ɧ ґ ґ = 1 ѫ ɧ ґ ( ӻ = 1 и ӻ ӻ = 1 и ӻ   ζ ρ ґ ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ
where 1 = 1 ;   ɧ 1 = 1 ; ӻ = t = 1 ӻ 1 S c ( ζ ρ ґ t ) , w h e r e   ӻ = 2 ,   3 ,   ,   и ; and ɧ ґ = o = 1 ґ 1 S c ( ζ ρ o ) ( ґ = 2 ,   3 ,   ,   ѫ ) ,  where S c (   ζ ρ ґ ӻ )  represents the SF of P F S f t N s .
Theorem 6. 
For a family of   P F S f t N s ,     ζ ρ ґ ӻ = ( L ґ ӻ ,   D ґ ӻ ,   T ґ ӻ ) , the aggregated result for   P F S f t P W G operator is again a   P F S f t N , given by
P F S f t P W G (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ и ѫ ) = ( ґ = 1 ѫ ( ӻ = 1 и ( L ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ,   ґ = 1 ѫ ( ӻ = 1 и ( D ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ , 1 ґ = 1 ѫ ( ӻ = 1 и ( 1 T ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ )
Proof. 
For и = 1 ,  we get
P F S f t P W G (   ζ ρ 11 ,     ζ ρ 21 ,   ,     ζ ρ ѫ 1 ) = ґ = 1 ѫ   ζ ρ ґ 1 ɧ ґ ґ = 1 ѫ ɧ ґ = ( ґ = 1 ѫ ( L ґ 1 ) ɧ ґ ґ = 1 ѫ ɧ ґ ,   ґ = 1 ѫ ( D ґ 1 ) ɧ ґ ґ = 1 ѫ ɧ ґ   , 1 ґ = 1 ѫ ( ( 1 T ґ 1 ) ɧ ґ ґ = 1 ѫ ɧ ґ ) ) = ( ґ = 1 ѫ ( ӻ = 1 1 ( L ґ ӻ ) ӻ ӻ = 1 1 ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ,   ґ = 1 ѫ ( ӻ = 1 1 ( D ґ ӻ ) ӻ ӻ = 1 1 ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ , 1 ґ = 1 ѫ ( ӻ = 1 1 ( 1 T ґ ӻ ) ӻ ӻ = 1 1 ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ )
and for ѫ = 1 ,
P F S f t P W G (   ζ ρ 11 ,     ζ ρ 21 ,   ,     ζ ρ 1 n ) = ӻ = 1 и   ζ ρ 1 ӻ ӻ ӻ = 1 и ӻ = ( j = 1 n ( L 1 j ) ӻ ӻ = 1 и ӻ ,   j = 1 n ( D 1 j ) ӻ ӻ = 1 и ӻ , 1 ӻ = 1 и ( ( 1 T 1 ӻ ) ӻ ӻ = 1 и ӻ ) ) = ( ґ = 1 1 ( ӻ = 1 и ( L ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 1 ɧ ґ ,   ґ = 1 1 ( ӻ = 1 и ( D ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 1 ɧ ґ , 1 ґ = 1 1 ( ӻ = 1 и ( 1 T ґ ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 1 ɧ ґ )
Hence, Equation (2) holds for и = 1  and ѫ = 1 .  Assume that Equation (2) holds for ѫ = α 1 + 1 , и = α 2 , ѫ = α 1 , and и = α 2 + 1 , we get
P F S f t P W G (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) = ґ = 1 α 1 + 1 ( ӻ = 1 α 2   ζ ρ ґ ӻ ӻ ӻ = 1 α 2 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ = ( ґ = 1 α 1 + 1 ( ӻ = 1 α 2 ( L ґ ӻ ) ӻ ӻ = 1 α 2 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ,   ґ = 1 α 1 + 1 ( ӻ = 1 α 2 ( D ґ ӻ ) ӻ ӻ = 1 α 2 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ , 1 ґ = 1 α 1 + 1 ( ӻ = 1 α 2 ( 1 T ґ ӻ ) ӻ ӻ = 1 α 2 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ )
and
ґ = 1 α 1 ( ӻ = 1 α 2 + 1   ζ ρ ґ ӻ ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 ɧ ґ = ( ґ = 1 α 1 ( ӻ = 1 α 2 + 1 ( L ґ ӻ ) ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 ɧ ґ ,   ґ = 1 α 1 ( ӻ = 1 α 2 + 1 ( D ґ ӻ ) ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 ɧ ґ , 1 ґ = 1 α 1 ( ӻ = 1 α 2 + 1 ( 1 T ґ ӻ ) ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 ɧ ґ )
Now,
ґ = 1 α 1 + 1 ( ӻ = 1 α 2 + 1   ζ ρ ґ ӻ ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ
= ґ = 1 α 1 + 1 ( ӻ = 1 α 2   ζ ρ ґ ӻ ӻ ӻ = 1 α 2 + 1 ӻ   ζ ρ ( α 2 + 1 ) ӻ α 2 + 1 ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ
= ( ґ = 1 α 1 + 1 ( ӻ = 1 α 2 (   ζ ρ ґ ӻ ӻ ӻ = 1 α 2 + 1 ӻ ) ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ) ґ = 1 α 1 + 1 (   ζ ρ ( α 2 + 1 ) ӻ α 2 + 1 ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ
= ( ґ = 1 α 1 + 1 ( ӻ = 1 α 2 ( L ґ ӻ ) ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ґ = 1 α 1 + 1 ( ( L α 2 + 1 ӻ ) ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ,   ґ = 1 α 1 + 1 ( ӻ = 1 α 2 ( D ґ ӻ ) α 2 + 1 ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ   ґ = 1 α 1 + 1 ( ( D α 2 + 1 ӻ ) α 2 + 1 ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ , 1 ґ = 1 α 1 + 1 ( ӻ = 1 α 2 ( 1 T ґ ӻ ) α 2 + 1 ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ґ = 1 α 2 + 1 ( ( 1 T α 2 + 1 ӻ ) α 2 + 1 ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ )
= ( ґ = 1 α 1 + 1 ( ӻ = 1 α 2 + 1 ( L ґ ӻ ) ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ ,   ґ = 1 α 1 + 1 ( ӻ = 1 α 2 + 1 ( D ґ ӻ ) ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ , 1 ґ = 1 α 1 + 1 ( ӻ = 1 α 2 + 1 ( 1 T ґ ӻ ) ӻ ӻ = 1 α 2 + 1 ӻ ) ɧ ґ ґ = 1 α 1 + 1 ɧ ґ )
Hence, Equation (2) holds for ѫ = α 1 + 1  and и = α 2 + 1 .  So, the result holds for all positive integers of ѫ ,   и 1 , by mathematical induction. □

5.1. Properties of Picture Fuzzy Soft Prioritized Weighted Geometric Aggregation Operators

The characteristics of P F S f t P W G  aggregation operators are covered in this subsection.
  • Idempotency: If   ζ ρ ґ ӻ = ζ ρ = ( L ,   D ,   T )  for all ґ ,   ӻ , then
    P F S f t P W G (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ и ѫ ) = ζ ρ .
  • Boundedness: If   ζ ρ ґ ӻ = ( min ґ min ӻ { L ґ ӻ } ,   min ґ min ӻ { D ґ ӻ } ,   max ґ max ӻ { T ґ ӻ } )  and   ζ + ρ ґ ӻ = ( max ґ max ӻ { L ґ ӻ } ,   max ґ max ӻ { D ґ ӻ } ,   min ґ min ӻ { T ґ ӻ } ) , then   ζ ρ ґ ӻ P F S f t P W G (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n )   ζ + ρ ґ ӻ .
  • Monotonicity: Let   ζ ^ ρ ґ ӻ = ( L ^ ґ ӻ ,   D ^ ґ ӻ ,   T ^ ґ ӻ )  be any other family of P F S f t N s , such that     ζ ρ ґ ӻ ζ ^ ρ ґ ӻ  for all ґ ,   ӻ , then P F S f t P W G (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) P F S f t P W G (   ζ ^ ρ 11 ,     ζ ^ ρ 12 ,   ,     ζ ^ ρ m n ) .
Proof. 
The proof is similar to the proof in Section 4.2. □

5.2. Picture Fuzzy Soft Prioritized Ordered Weighted Geometric ( P F S f t P O W G )  Aggregation Operator

The notions of P F S f t P O W G  aggregation operators are defined here, and their characteristics are covered in this subsection.
Definition 15. 
Let    ζ ρ ґ ӻ = ( L ґ ӻ ,   D ґ ӻ ,   T ґ ӻ )  denote the family of  S f t N s   ( ґ = 1 ,   2 ,   ,   и ;   ӻ = 1 ,   2 ,   ,   ѫ ) . Then, picture fuzzy soft prioritized ordered weighted geometric aggregation operator is defined by
P F S f t P O W G (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) = ґ = 1 ѫ ( ӻ = 1 и ζ ρ d ( ґ ) 𝓽 ( ӻ ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ
where 1 = 1 ;   ɧ 1 = 1 ; ӻ = t = 1 ӻ 1 S c ( ζ ρ ґ 𝓽 ( t ) ) ,   w h e r e   ӻ = 2 ,   3 ,   ,   и ; and ɧ ґ = o = 1 ґ 1 S c ( ζ ρ d ( o ) ) ( ґ = 2 ,   3 ,   ,   ѫ ) ,  where S c (   ζ ρ ґ ӻ )  represents the SF of P F S f t N s . Additionally, d  and 𝓽  are the permutations of ( 1 ,   2 , ,   3 , , ѫ )   a n d   ( 1 ,   2 ,   3 ,   ,   и ) , such that ρ d ( ґ ) ӻ   ρ d ( ґ 1 ) ӻ  and ρ ґ 𝓽 ( ӻ )   ρ ґ 𝓽 ( ӻ 1 )  for ґ = 2 ,   3 ,   ,   ѫ   and   ӻ = 2 ,   3 ,   ,   и .
Theorem 7. 
For a family of   P F S f t N s ,    ζ ρ ґ ӻ = ( L ґ ӻ ,   D ґ ӻ ,   T ґ ӻ ) , the aggregated result for  P F S f t P O W G  operator is again a  P F S f t N , given by
P F S f t P O W G (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) = ( ґ = 1 ѫ ( ӻ = 1 и ( L d ( ґ ) 𝓽 ( ӻ ) ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ ,   ґ = 1 ѫ ( ӻ = 1 и ( D d ( ґ ) 𝓽 ( ӻ ) ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ , 1 ґ = 1 ѫ ( ӻ = 1 и ( 1 T d ( ґ ) 𝓽 ( ӻ ) ) ӻ ӻ = 1 и ӻ ) ɧ ґ ґ = 1 ѫ ɧ ґ )
Proof. 
The proof is similar to the proof of Theorem 4. □

5.3. Properties of Picture Fuzzy Soft Prioritized Ordered Weighted Geometric Aggregation Operators

Similar to the P F S f t P W G  aggregation operators, the P F S f t P O W G  aggregation operator also satisfies some properties given by
  • Idempotency: If   ζ ρ ґ ӻ = ζ ρ = ( L ,   D ,   T )  for all ґ ,   ӻ , then
    P F S f t P O W G (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ и ѫ ) = ζ ρ .
  • Boundedness: If   ζ ρ ґ ӻ = ( min ґ min ӻ { L ґ ӻ } ,   min ґ min ӻ { D ґ ӻ } ,   max ґ max ӻ { T ґ ӻ } )  and   ζ + ρ ґ ӻ = ( max ґ max ӻ { L ґ ӻ } ,   max ґ max ӻ { D ґ ӻ } ,   min ґ min ӻ { T ґ ӻ } ) , then   ζ ρ ґ ӻ P F S f t P O W G (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n )   ζ + ρ ґ ӻ .
  • Monotonicity: Let   ζ ^ ρ ґ ӻ = ( L ^ ґ ӻ ,   D ^ ґ ӻ ,   T ^ ґ ӻ )  be any other family of P F S f t N s , such that     ζ ρ ґ ӻ ζ ^ ρ ґ ӻ  for all ґ ,   ӻ , then P F S f t P O W G (   ζ ρ 11 ,     ζ ρ 12 ,   ,     ζ ρ m n ) P F S f t P O W G (   ζ ^ ρ 11 ,     ζ ^ ρ 12 ,   ,     ζ ^ ρ m n ) .

6. Algorithm for Proposed Prioritized Aggregation Operators

In this part of the article, we will introduce a stepwise algorithm for the proposed work.
Let V = { V 1 ,   V 2 ,   V 3 ,   ,   V 𝓱 }  denote the set of different alternatives. Additionally, suppose that ρ = { ρ 1 ,   ρ 2 ,   ρ 3 ,   ,   ρ n }  denote the set of parameters, and Υ = { Υ 1 ,   Υ 2 ,   Υ 3 ,   ,   Υ m }  denote the set of experts. Suppose experts provide their assessment of alternatives V c ( c = 1 ,   2 ,   3 ,   ,   𝓱 )  corresponding to each parameter ρ ӻ   ( ӻ = 1 ,   2 ,   3 ,   ,   и )  in the form of P F S f t N s     ζ ρ ґ ӻ = ( L ґ ӻ ,   D ґ ӻ ,   T ґ ӻ ) .  Now, the stepwise algorithm is given as follows
Step 1: 
Collect the information about each alternative provided by the decision analyst in the form of P F S f t N s  corresponding to each parameter.
Step 2: 
Normalize the information given in step 1 by using the formula given below
W ґ ӻ = {   ζ ρ ґ ӻ ԟ   ;   F o r   c o s t   t y p e   p a r a m e t e r   (   ζ ρ ґ ӻ ) c   ;   F o r   b e n e f i t   t y p e   p a r a m e t e r
where (   ζ ρ ґ ӻ ) c  is the complement of   ζ ρ ґ ӻ = ( L ґ ӻ ,   D ґ ӻ ,   T ґ ӻ ) .
Step 3: 
Calculate ӻ   ( ӻ = 1 ,   2 ,   3 ,   ,   и )  and ɧ ґ   ( ґ = 1 ,   2 ,   3 ,   ,   ѫ )  by using 1 = 1 ;   ɧ 1 = 1 ; ӻ = t = 1 ӻ 1 S c ( ζ ρ ґ t ) ,   w h e r e   ӻ = 2 ,   3 ,   ,   и ; and ɧ ґ = o = 1 ґ 1 S c ( ζ ρ o ) ( ґ = 2 ,   3 ,   ,   ѫ ) ,  where S c (   ζ ρ ґ ӻ )  represents the SF of P F S f t N s .
Step 4: 
Aggregate P F S f t N s  for each alternative V c ( c = 1 ,   2 ,   3 ,   ,   𝓱 )  into a collective preference value W c  by using P F S f t P W A ,   P F S f t P O W A ,   P F S f t P W G , or P F S f t P O W G  aggregation operators.
Step 5: 
By using the definition of the score function, find out the score values for each alternative W c .
Step 6: 
Rank all alternatives and choose the best one.

6.1. Numerical Example

The medical field has become complicated due to the complexities of diseases. Furthermore, the decision analyst takes difficulty in making their decision about the diagnosis of some diseases. So, there is a need to ensure some valuable techniques that can handle the issues of decision analysts working in the medical field. As fuzzy set theory has a wide range of applications in medical fields, it assists—to some extent—the decision-makers working in this field. So, devoted to this idea, in this section, we will provide a numerical example of a medical diagnosis that shows that our work can be used in the medical field more effectively.

6.2. Medical Diagnosis

Example 1: 
Suppose a team of five senior doctors— D 1 ,   D 2 ,   D 3 ,   D 4 ,   a n d   D 5 —will provide their assessment of four different patients based on the parameter set given as   ρ = { ρ 1 = c h e s t   p a i n ,   ρ 2 = v o m i t i n g ,   ρ 3 = f e v e r ,   ρ 4 = c o u g h ,   ρ 5 = f a t i g u e } . Suppose doctors give their assessment in the form of P F S f t N s  corresponding to each parameter. Now we can use a stepwise algorithm to solve the problem.
By using P F S f t P W A  aggregation operators.
Step 1: 
Doctors provide their evaluation information in the form of P F S f t N s , according to each parameter given in Table 1, Table 2, Table 3 and Table 4.
Step 2: 
There is no need for normalization because all parameters are of the same type.
Step 3: 
Calculate ӻ   ( ӻ = 1 ,   2 ,   3 ,   ,   и )  and ɧ ґ   ( ґ = 1 ,   2 ,   3 ,   ,   ѫ )  by using 1 = 1 ;   ɧ 1 = 1 ; ӻ = t = 1 ӻ 1 S c ( ζ ρ ґ t ) ,   w h e r e   ӻ = 2 ,   3 ,   ,   и ; and ɧ ґ = o = 1 ґ 1 S c ( ζ ρ o ) ( ґ = 2 ,   3 ,   ,   ѫ ) ,  where S c (   ζ ρ ґ ӻ )  represents the SF of P F S f t N s .
ӻ ( 1 ) = [ 1 0.44 0.41 0.49 0.53 1 0.49 0.40 0.59 0.55 1 0.465 0.485 0.49 0.49 1 0.43 0.42 0.54 0.54 1 0.455 0.515 0.49 0.49 ] ,   ӻ ( 2 ) = [ 1 0.41 0.485 0.53 0.49 1 0.40 0.405 0.55 0.59 1 0.485 0.63 0.49 0.49 1 0.42 0.435 0.495 0.54 1 0.515 0.58 0.53 0.49 ]
ӻ ( 3 ) = [ 1 0.44 0.465 0.505 0.45 1 0.49 0.41 0.445 0.445 1 0.49 0.405 0.49 0.535 1 0.51 0.415 0.475 0.38 1 0.36 0.455 0.465 0.50 ] ,   ӻ ( 4 ) = [ 1 0.44 0.49 0.51 0.405 1 0.36 0.465 0.465 0.415 1 0.47 0.49 0.41 0.38 1 0.355 0.51 0.40 0.50 1 0.49 0.465 0.485 0.425 ]
and
ɧ ґ 1 = [ 1 0.44 0.2156 0.1002 0.0431 ] ,   ɧ ґ 2 = [ 1 0.41 0.164 0.0795 0.0334 ]
ɧ ґ 3 = [ 1 0.44 0.2156 0.1056 0.0538 ] ,   ɧ ґ 4 = [ 1 0.44 0.1584 0.0744 0.0264 ]
Step 4: 
Now we use the P F S f t P W A  aggregation operator to find the aggregated values for each patient, given as
W 1 = ( 0.1740 ,   0.2235 ,   0.2100 ) ,   W 2 = ( 0.1709 ,   0.2227 ,   0.2188 ) ,
W 3 = ( 0.1513 ,   0.2521 ,   0.2378 ) ,   W 4 = ( 0.1660 ,   0.2538 ,   0.2514 )
Step 5: 
Calculate the score value for each alternative by using the definition of the score function.
Now
S c ( W 1 ) = 0.482 ,   S c ( W 2 ) = 0.4760 ,   S c ( W 3 ) = 0.4567 ,   S c ( W 4 ) = 0.4573
Step 6: 
Thus, the ranking is S c ( W 1 ) > S c ( W 2 ) > S c ( W 4 ) > S c ( W 3 ) .
Therefore, from the analyses of the experts, we can note that patient V 1  has more serious illnesses than other patients.
By using P F S f t P W G  aggregation operators
Step 1: 
Doctors provide their evaluation information in the form of P F S f t N s , according to each parameter given in Table 1, Table 2, Table 3 and Table 4.
Step 2: 
There is no need for normalization because all parameters are of the same type.
Step 3: 
Same as above.
Step 4: 
Now we use the P F S f t P W G  aggregation operator to find the aggregated values for each patient, given as
W 1 = ( 0.1624 ,   0.2235 ,   0.2229 ) ,   W 2 = ( 0.1571 ,   0.2227 ,   0.233 ) ,
W 2 = ( 0.1460 ,   0.2521 ,   0.2528 ) ,   W 4 = ( 0.11594 ,   0.2538 ,   0.2689 )
Step 5: 
Calculate the score value for each alternative by using the definition of the score function.
Now,
S c ( W 1 ) = 0.4697 ,   S c ( W 2 ) = 0.4620 ,   S c ( W 3 ) = 0.4446 ,   S c ( W 4 ) = 0.4235
Step 6: 
Thus, the ranking is S c ( W 1 ) > S c ( W 2 ) > S c ( W 3 ) > S c ( W 4 ) .
Therefore, from the analyses of the experts, we can note that patient V 1  has more serious illnesses than other patients.

7. Comparative Analysis

In this part of the article, we will discuss the comparative analysis of the introduced work by comparing our work with some existing notions to establish the reliability and superiority of the introduced work. We will compare our work with the Yu method [7], Khan et al. method [11], Riaz et al. method [18], and Arora and Garg method [31]. The overall discussion is given below.
Example 2: 
Suppose we have a set of three alternatives = { 1 ,   2 ,   3 }  and five parameters   ρ = { ρ 1 ,   ρ 2 ,   ρ 3 ,   ρ 4 ,   ρ 5 } . Suppose a team of five experts ε 1 ,   ε 2 ,   ε 3 ,   ε 4   a n d   ε 5 —is invited to give their assessment of each alternative, and they provide their evaluation corresponding to their parameters in the form of a picture fuzzy soft number, as given in Table 5, Table 6 and Table 7.
From the above analyses, we can note that
  • When decision-makers provide their assessment in the form of picture fuzzy soft numbers, in which we see that three types of aspects like MG, AG, and NMG are given, then the Yu method [7], Khan et al. method [11], Riaz method [18], and Arora and Garg method [31] fail to handle these types of situations, because all of the above-given methods cannot discuss three types of aspects in their structures. Meanwhile, the proposed aggregation operators can handle this situation. So, our work is superior.
  • When we discuss the parameterization tool that makes the soft set theory more valuable and fruitful than the fuzzy set theory, note that the Yu method [7], Khan et al. method [11], and Riaz method [18] cannot consider the parameterizations tool, while our proposed work can. Due to this reason, our work is more effective.
  • Additionally, note that although Arora and Garg’s method [31] can deal with parameterization tools, this structure consists of intuitionistic fuzzy soft prioritized average and geometric aggregation operators that can consider two types of aspects—i.e., MG and NMG—in their structure, while data given in Table 5, Table 6 and Table 7 consist of three types of aspects—i.e., MG, AG, and NMG. Hence, in this regard, all data given in Table 5, Table 6 and Table 7 cannot be handled by the Arora and Garg method [31]. Meanwhile, our initiated work can handle all issues faced by the existing literature. So, our introduced work is more efficient. The overall results for data given in Table 5, Table 6 and Table 7 are given in Table 8.
Correspondingly, a characteristic analysis of the introduced work along with existing literature has been given in Table 9.
Moreover, the abbreviation used throughout the article is given in Table 10.

8. Conclusions

Although medical diagnoses have become more complex in recent days, recent techniques and tools are available to tackle this issue. FS theory has played its role in this regard, and many developments have been made to cover this field. Picture fuzzy soft set is a decent and valuable tool to discuss the three grades to model human opinion in the form of MG, AG, and NMD. Additionally, aggregation operators are familiar structures in FST to convert the overall information into a single value that can further help in many decision-making scenarios. So, due to the strong structure of P F S f t S  and characteristics of aggregation operators, here, in this article, we have first proposed basic operational laws for picture fuzzy soft numbers. Moreover, based on these developed operations, we have introduced the P F S f t   prioritized average and geometric aggregation operators. Furthermore, we have used this defined approach to medical diagnoses to show the effective use of this developed technique. The use of elaborated work in medical diagnoses shows that this technique has a fruitful influence in the medical field and plays a vital role. It also helps the experts working in the medical field to make their decisions accurately. In this regard, medical diagnoses become easier and more reliable. Moreover, the cooperative analysis shows the effectiveness and superiority of the initiated work.
The proposed aggregation operators are also limited notions because they use the condition that s u m   ( M G ,   A G ,   N M G ) [ 0 ,   1 ] . However, when decision-makers come up with 0.3 as MG, 0.6 as AG, and 0.4 as NMG, then note that s u m   ( 0.3 ,   0.6 ,   0.4 ) [ 0 ,   1 ] . So, the main condition for picture fuzzy soft data is violated, and we can say that these notions are also limited.
In future work, we can propose some other aggregation operators based on developed operations as given in [34]. This work can be extended to bipolar complex fuzzy sets for generalized similarity measures, as given in [35], and for Aczel-Alsina aggregation operators, as given in [36]. Additionally, some new methods, like TOPSIS, can be defined based on the developed approach, as given in [37]. Furthermore, we can also use the developed notions for bipolar soft sets [38]. Moreover, we can extend these notions to complex fuzzy set theory, as given in [39]. Likewise, we can extend these notions to rough set theory [40], interval-valued picture fuzzy set theory [41], and N-soft set theory [42]. Some new developments based on developed aggregation operators can be made, as given in [43]. Moreover, we can extend this work to a spherical fuzzy environment and develop a new approach, as given in [44,45].

Author Contributions

Conceptualization, J.A. and T.M.; methodology, T.M.; software, J.A.; validation, J.A. and T.M.; formal analysis, T.M.; investigation, J.A.; resources, T.M.; data curation, J.A.; writing—original draft preparation, J.A.; writing—review and editing, J.A.; visualization, T.M.; supervision, T.M.; project administration, T.M.; funding acquisition, T.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The data used in this manuscript are hypothetical, and anyone can use them without prior permission from the authors by just citing this article.

Conflicts of Interest

The authors declare that they have no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Steimann, F. Fuzzy set theory in medicine. Art. Intell. Med. 1997, 11, 1–7. [Google Scholar]
  3. Adlassnig, K.-P. Fuzzy Set Theory in Medical Diagnosis. IEEE Trans. Syst. Man Cybern. 1986, 16, 260–265. [Google Scholar] [CrossRef]
  4. Choi, H.M.; Mun, G.S.; Ahn, J.Y. A medical diagnosis based on interval-valued fuzzy sets. Biomed. Eng. Appl. Basis Commun. 2012, 24, 349–354. [Google Scholar] [CrossRef]
  5. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  6. De, S.K.; Biswas, R.; Roy, A.R. An application of intuitionistic fuzzy sets in medical diagnosis. Fuzzy Sets Syst. 2001, 117, 209–213. [Google Scholar] [CrossRef]
  7. Yu, D. Group decision making based on generalized intuitionistic fuzzy prioritized geometric operator. Int. J. Intell. Syst. 2012, 27, 635–661. [Google Scholar] [CrossRef]
  8. Luo, M.; Zhao, R. A distance measure between intuitionistic fuzzy sets and its application in medical diagnosis. Artif. Intell. Med. 2018, 89, 34–39. [Google Scholar] [CrossRef]
  9. Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), Edmonton, AB, Canada, 24–28 June 2013. [Google Scholar]
  10. Xiao, F.; Ding, W. Divergence measure of Pythagorean fuzzy sets and its application in medical diagnosis. Appl. Soft Comput. 2019, 79, 254–267. [Google Scholar] [CrossRef]
  11. Khan, M.S.A.; Abdullah, S.; Ali, A.; Amin, F. Pythagorean fuzzy prioritized aggregation operators and their application to multi-attribute group decision making. Granul. Comput. 2019, 4, 249–263. [Google Scholar] [CrossRef]
  12. Ejegwa, P.A. Improved composite relation for pythagorean fuzzy sets and its application to medical diagnosis. Granul. Comput. 2020, 5, 277–286. [Google Scholar] [CrossRef]
  13. Lin, M.; Huang, C.; Chen, R.; Fujita, H.; Wang, X. Directional correlation coefficient measures for Pythagorean fuzzy sets: Their applications to medical diagnosis and cluster analysis. Complex Intell. Syst. 2021, 7, 1025–1043. [Google Scholar] [CrossRef]
  14. Molla, M.U.; Giri, B.C.; Biswas, P. Extended PROMETHEE method with Pythagorean fuzzy sets for medical diagnosis problems. Soft Comput. 2021, 25, 4503–4512. [Google Scholar] [CrossRef]
  15. Yager, R.R. Generalized Orthopair Fuzzy Sets. IEEE Trans. Fuzzy Syst. 2016, 25, 1222–1230. [Google Scholar] [CrossRef]
  16. Liu, P.; Mahmood, T.; Ali, Z. Complex q-Rung Orthopair Fuzzy Variation Co-efficient Similarity Measures and their Approach in Medical Diagnosis and Pattern Recognition. Sci. Iran. 2022, 29, 894–914. [Google Scholar] [CrossRef]
  17. Jan, N.; Zedam, L.; Mahmood, T.; Rak, E.; Ali, Z. Generalized dice similarity measures for q-rung orthopair fuzzy sets with applications. Complex Intell. Syst. 2020, 6, 545–558. [Google Scholar] [CrossRef]
  18. Riaz, M.; Pamucar, D.; Farid, H.M.A.; Hashmi, M.R.; Raza, M. q-Rung Orthopair Fuzzy Prioritized Aggregation Operators and Their Application Towards Green Supplier Chain Management. Symmetry 2020, 12, 976. [Google Scholar] [CrossRef]
  19. Cuong, B.C.; Kreinovich, V. Picture fuzzy sets. J. Comput. Sci. Cybern. 2014, 30, 409–420. [Google Scholar]
  20. Dutta, P. Medical Diagnosis Based on Distance Measures Between Picture Fuzzy Sets. Int. J. Fuzzy Syst. Appl. 2018, 7, 15–36. [Google Scholar] [CrossRef]
  21. Khan, M.J.; Kumam, P.; Deebani, W.; Kumam, W.; Shah, Z. Bi-parametric distance and similarity measures of picture fuzzy sets and their applications in medical diagnosis. Egypt. Inform. J. 2021, 22, 201–212. [Google Scholar] [CrossRef]
  22. Dutta, P. Medical diagnosis via distance measures on picture fuzzy sets. Adv. Model. Anal. A 2017, 54, 657–672. [Google Scholar]
  23. Qiyas, M.; Abdullah, S.; Ashraf, S.; Abdullah, L. Linguistic Picture Fuzzy Dombi Aggregation Operators and Their Application in Multiple Attribute Group Decision Making Problem. Mathematics 2019, 7, 764. [Google Scholar] [CrossRef] [Green Version]
  24. Molodtsov, D. Soft set theory-first result. Comput. Math. Appl. 1999, 27, 19–31. [Google Scholar] [CrossRef] [Green Version]
  25. Ali, M.I.; Shabir, M.; Naz, M. Algebraic structures of soft sets associated with new operations. Comput. Math. Appl. 2011, 61, 2647–2654. [Google Scholar] [CrossRef] [Green Version]
  26. Maji, P.K.; Roy, A.R.; Biswas, R. Fuzzy soft sets. J. Fuzzy Math. 2001, 9, 589–602. [Google Scholar]
  27. Maji, P.K.; Roy, A.R.; Biswas, R. On intuitionistic fuzzy soft sets. J. Fuzzy Math. 2004, 12, 669–684. [Google Scholar]
  28. Peng, X.D.; Yang, Y.; Song, J.P.; Jiang, Y. Pythagorean fuzzy soft set and its application. Comput. Eng. 2015, 41, 224–229. [Google Scholar]
  29. Hussain, A.; Ali, M.I.; Mahmood, T. and Munir, M. q-rung orthopair fuzzy soft average aggregation operators and their ap-plication in multicriteria decision-making. Int. J. Intell. Syst. 2020, 35, 571–599. [Google Scholar] [CrossRef]
  30. Akram, M.; Nawaz, S. Fuzzy soft graphs with applications. J. Intell. Fuzzy Syst. 2016, 30, 3619–3632. [Google Scholar] [CrossRef]
  31. Arora, R.; Garg, H. Prioritized averaging/geometric aggregation operators under the intuitionistic fuzzy soft set environment. Sci. Iran. 2018, 25, 466–482. [Google Scholar] [CrossRef] [Green Version]
  32. Hayat, K.; Ali, M.I.; Alcantud, J.C.R.; Cao, B.-Y.; Tariq, K.U. Best concept selection in design process: An application of generalized intuitionistic fuzzy soft sets. J. Intell. Fuzzy Syst. 2018, 35, 5707–5720. [Google Scholar] [CrossRef]
  33. Yang, Y.; Liang, C.; Ji, S.; Liu, T. Adjustable Soft Discernability Matrix Based On Picture Fuzzy Soft Sets And Its Application In Decision Making. J. Intell. Fuzzy Syst. 2015, 29, 1711–1722. [Google Scholar] [CrossRef]
  34. Ullah, K. Picture Fuzzy Maclaurin Symmetric Mean Operators and Their Applications in Solving Multiattribute Decision-Making Problems. Math. Probl. Eng. 2021, 2021, 1098631. [Google Scholar] [CrossRef]
  35. Mahmood, T.; Rehman, U.U. A Novel Approach towards Bipolar Complex Fuzzy Sets and Their Applications in Gener-alized Similarity Measures. Int. J. Intell. Syst. 2022, 37, 535–567. [Google Scholar] [CrossRef]
  36. Mahmood, T.; Rehman, U.U.; Ali, Z. Analysis and application of Aczel-Alsina aggregation operators based on bipolar complex fuzzy information in multiple attribute decision making. Inf. Sci. 2023, 619, 817–833. [Google Scholar] [CrossRef]
  37. Garg, H.; Arora, R. TOPSIS method based on correlation coefficient for solving decision-making problems with intuitionistic fuzzy soft set information. AIMS Math. 2020, 5, 2944–2966. [Google Scholar] [CrossRef]
  38. Mahmood, T. A Novel Approach towards Bipolar Soft Sets and Their Applications. J. Math. 2020, 2020, 4690808. [Google Scholar] [CrossRef]
  39. Akram, M.; Bashir, A.; Garg, H. Decision-making model under complex picture fuzzy Hamacher aggregation operators. Comput. Appl. Math. 2020, 39, 226. [Google Scholar] [CrossRef]
  40. Donbosco, J.S.M.; Ganesan, D. The Energy of rough neutrosophic matrix and its application to MCDM problem for selecting the best building construction site. Decis. Mak. Appl. Manag. Eng. 2022, 5, 30–45. [Google Scholar] [CrossRef]
  41. Ashraf, A.; Ullah, K.; Hussain, A.; Bari, M. Interval-Valued Picture Fuzzy Maclaurin Symmetric Mean Operator with application in Multiple Attribute Decision-Making. Rep. Mech. Eng. 2022, 3, 301–317. [Google Scholar] [CrossRef]
  42. Das, A.K.; Granados, C. FP-intuitionistic multi fuzzy N-soft set and its induced FP-Hesitant N soft set in decision-making. Decis. Mak. Appl. Manag. Eng. 2022, 5, 67–89. [Google Scholar] [CrossRef]
  43. Riaz, M.; Farid, H.M.A. Picture fuzzy aggregation approach with application to third-party logistic provider selection process. Rep. Mech. Eng. 2022, 3, 318–327. [Google Scholar] [CrossRef]
  44. Mahmood, T.; Ullah, K.; Khan, Q.; Jan, N. An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets. Neural Comput. Appl. 2019, 31, 7041–7053. [Google Scholar] [CrossRef]
  45. Zheng, L.; Mahmood, T.; Ahmmad, J.; Rehman, U.U.; Zeng, S. Spherical Fuzzy Soft Rough Average Aggregation Oper-ators and Their Applications to Multi-Criteria Decision Making. IEEE Access 2022, 10, 27832–27852. [Google Scholar] [CrossRef]
Table 1. P F S f t  data for patient V 1 .
Table 1. P F S f t  data for patient V 1 .
  ρ 1   ρ 2   ρ 3   ρ 4   ρ 5
  D 1   ( 0.13 ,   0.23 ,   0.25 )   ( 0.11 ,   0.28 ,   0.29 )   ( 0.17 ,   0.16 ,   0.19 )   ( 0.25 ,   0.17 ,   0.19 )   ( 0.13 ,   0.17 ,   0.16 )
  D 2   ( 0.16 ,   0.17 ,   0.18 )   ( 0.1 ,   0.2 ,   0.3 )   ( 0.29 ,   0.27 ,   0.11 )   ( 0.23 ,   0.18 ,   0.13 )   ( 0.14 ,   0.34 ,   0.33 )
  D 3   ( 0.21 ,   0.22 ,   0.28 )   ( 0.3 ,   0.31 ,   0.33 )   ( 0.13 ,   0.14 ,   0.15 )   ( 0.15 ,   0.19 ,   0.17 )   ( 0.36 ,   0.41 ,   0.1 )
  D 4   ( 0.19 ,   0.34 ,   0.33 )   ( 0.25 ,   0.26 ,   0.41 )   ( 0.24 ,   0.17 ,   0.16 )   ( 0.18 ,   0.17 ,   0.19 )   ( 0.18 ,   0.19 ,   0.31 )
  D 5   ( 0.12 ,   0.27 ,   0.21 )   ( 0.22 ,   0.18 ,   0.19 )   ( 0.12 ,   0.13 ,   0.14 )   ( 0.28 ,   0.21 ,   0.22 )   ( 0.32 ,   0.15 ,   0.16 )
Table 2. P F S f t  data for patient V 2 .
Table 2. P F S f t  data for patient V 2 .
  ρ 1   ρ 2   ρ 3   ρ 4   ρ 5
  D 1   ( 0.11 ,   0.28 ,   0.29 )   ( 0.13 ,   0.17 ,   0.16 )   ( 0.25 ,   0.17 ,   0.19 )   ( 0.17 ,   0.16 ,   0.19 )   ( 0.13 ,   0.23 ,   0.25 )
  D 2   ( 0.1 ,   0.2 ,   0.3 )   ( 0.14 ,   0.34 ,   0.33 )   ( 0.23 ,   0.18 ,   0.13 )   ( 0.29 ,   0.27 ,   0.11 )   ( 0.16 ,   0.17 ,   0.18 )
  D 3   ( 0.3 ,   0.31 ,   0.33 )   ( 0.36 ,   0.41 ,   0.1 )   ( 0.15 ,   0.19 ,   0.17 )   ( 0.13 ,   0.14 ,   0.15 )   ( 0.21 ,   0.22 ,   0.28 )
  D 4   ( 0.25 ,   0.26 ,   0.41 )   ( 0.18 ,   0.19 ,   0.31 )   ( 0.18 ,   0.17 ,   0.19 )   ( 0.24 ,   0.17 ,   0.16 )   ( 0.19 ,   0.34 ,   0.33 )
  D 5   ( 0.22 ,   0.18 ,   0.19 )   ( 0.32 ,   0.15 ,   0.16 )   ( 0.28 ,   0.21 ,   0.22 )   ( 0.12 ,   0.13 ,   0.14 )   ( 0.12 ,   0.27 ,   0.21 )
Table 3. P F S f t  data for patient V 3 .
Table 3. P F S f t  data for patient V 3 .
  ρ 1   ρ 2   ρ 3   ρ 4   ρ 5
  D 1   ( 0.12 ,   0.33 ,   0.24 )   ( 0.12 ,   0.31 ,   0.19 )   ( 0.15 ,   0.12 ,   0.14 )   ( 0.14 ,   0.15 ,   0.24 )   ( 0.13 ,   0.25 ,   0.41 )
  D 2   ( 0.20 ,   0.21 ,   0.22 )   ( 0.12 ,   0.12 ,   0.30 )   ( 0.14 ,   0.24 ,   0.25 )   ( 0.12 ,   0.33 ,   0.23 )   ( 0.22 ,   0.23 ,   0.24 )
  D 3   ( 0.21 ,   0.24 ,   0.23 )   ( 0.16 ,   0.34 ,   0.35 )   ( 0.17 ,   0.28 ,   0.19 )   ( 0.19 ,   0.18 ,   0.12 )   ( 0.12 ,   0.35 ,   0.41 )
  D 4   ( 0.27 ,   0.21 ,   0.25 )   ( 0.22 ,   0.21 ,   0.39 )   ( 0.16 ,   0.22 ,   0.21 )   ( 0.19 ,   0.23 ,   0.43 )   ( 0.15 ,   0.13 ,   0.14 )
  D 5   ( 0.11 ,   0.42 ,   0.39 )   ( 0.10 ,   0.49 ,   0.19 )   ( 0.10 ,   0.29 ,   0.17 )   ( 0.32 ,   0.21 ,   0.32 )   ( 0.21 ,   0.25 ,   0.27 )
Table 4. P F S f t  data for patient V 4 .
Table 4. P F S f t  data for patient V 4 .
  ρ 1   ρ 2   ρ 3   ρ 4   ρ 5
  D 1   ( 0.12 ,   0.33 ,   0.24 )   ( 0.16 ,   0.17 ,   0.18 )   ( 0.23 ,   0.19 ,   0.21 )   ( 0.16 ,   0.34 ,   0.35 )   ( 0.19 ,   0.17 ,   0.16 )
  D 2   ( 0.13 ,   0.25 ,   0.41 )   ( 0.21 ,   0.22 ,   0.28 )   ( 0.12 ,   0.31 ,   0.19 )   ( 0.22 ,   0.21 ,   0.39 )   ( 0.15 ,   0.19 ,   0.17 )
  D 3   ( 0.21 ,   0.25 ,   0.27 )   ( 0.21 ,   0.24 ,   0.23 )   ( 0.12 ,   0.12 ,   0.30 )   ( 0.19 ,   0.23 ,   0.43 )   ( 0.18 ,   0.17 ,   0.19 )
  D 4   ( 0.12 ,   0.35 ,   0.41 )   ( 0.27 ,   0.21 ,   0.25 )   ( 0.1 ,   0.2 , 0.3 )   ( 0.32 ,   0.21 ,   0.32 )   ( 0.27 ,   0.21 ,   0.25 )
  D 5   ( 0.22 ,   0.23 ,   0.24 )   ( 0.10 ,   0.29 ,   0.17 )   ( 0.3 ,   0.31 ,   0.33 )   ( 0.14 ,   0.19 ,   0.29 )   ( 0.11 ,   0.42 ,   0.39 )
Table 5. P F S f t  data for alternative 1 .
Table 5. P F S f t  data for alternative 1 .
  ρ 1   ρ 2   ρ 3   ρ 4   ρ 5
  ε 1   ( 0.10 ,   0.13 ,   0.15 )   ( 0.21 ,   0.18 ,   0.19 )   ( 0.17 ,   0.16 ,   0.19 )   ( 0.15 ,   0.27 ,   0.9 )   ( 0.23 ,   0.27 ,   0.26 )
  ε 2   ( 0.26 ,   0.27 ,   0.28 )   ( 0.19 ,   0.21 ,   0.31 )   ( 0.19 ,   0.17 ,   0.22 )   ( 0.13 ,   0.28 ,   0.23 )   ( 0.24 ,   0.33 ,   0.37 )
  ε 3   ( 0.11 ,   0.12 ,   0.18 )   ( 0.2 ,   0.21 ,   0.13 )   ( 0.23 ,   0.24 ,   0.25 )   ( 0.25 ,   0.29 ,   0.27 )   ( 0.26 ,   0.40 ,   0.12 )
  ε 4   ( 0.29 ,   0.30 ,   0.31 )   ( 0.15 ,   0.16 ,   0.11 )   ( 0.14 ,   0.27 ,   0.26 )   ( 0.28 ,   0.27 ,   0.29 )   ( 0.28 ,   0.29 ,   0.31 )
  ε 5   ( 0.22 ,   0.17 ,   0.11 )   ( 0.12 ,   0.28 ,   0.29 )   ( 0.27 ,   0.26 ,   0.25 )   ( 0.18 ,   0.11 ,   0.12 )   ( 0.13 ,   0.25 ,   0.26 )
Table 6. P F S f t  data for alternative 2 .
Table 6. P F S f t  data for alternative 2 .
  ρ 1   ρ 2   ρ 3   ρ 4   ρ 5
  ε 1   ( 0.19 ,   0.21 ,   0.21 )   ( 0.17 ,   0.22 ,   0.26 )   ( 0.18 ,   0.19 ,   0.11 )   ( 0.25 ,   0.14 ,   0.13 )   ( 0.12 ,   0.13 ,   0.14 )
  ε 2   ( 0.18 ,   0.13 ,   0.16 )   ( 0.11 ,   0.21 ,   0.23 )   ( 0.22 ,   0.23 ,   0.14 )   ( 0.22 ,   0.11 ,   0.11 )   ( 0.15 ,   0.36 ,   0.35 )
  ε 3   ( 0.26 ,   0.26 ,   0.21 )   ( 0.31 ,   0.32 ,   0.31 )   ( 0.15 ,   0.16 ,   0.17 )   ( 0.12 ,   0.13 ,   0.14 )   ( 0.32 ,   0.43 ,   0.14 )
  ε 4   ( 0.14 ,   0.30 ,   0.32 )   ( 0.21 ,   0.23 ,   0.44 )   ( 0.28 ,   0.19 ,   0.19 )   ( 0.15 ,   0.16 ,   0.17 )   ( 0.15 ,   0.16 ,   0.37 )
  ε 5   ( 0.13 ,   0.29 ,   0.25 )   ( 0.25 ,   0.16 ,   0.17 )   ( 0.18 ,   0.17 ,   0.16 )   ( 0.28 ,   0.29 ,   0.21 )   ( 0.38 ,   0.19 ,   0.10 )
Table 7. P F S f t  data for alternative 3 .
Table 7. P F S f t  data for alternative 3 .
  ρ 1   ρ 2   ρ 3   ρ 4   ρ 5
  ε 1   ( 0.10 ,   0.29 ,   0.28 )   ( 0.13 ,   0.24 ,   0.25 )   ( 0.10 ,   0.11 ,   0.12 )   ( 0.25 ,   0.14 ,   0.13 )   ( 0.13 ,   0.15 ,   0.19 )
  ε 2   ( 0.15 ,   0.16 ,   0.17 )   ( 0.10 ,   0.21 ,   0.32 )   ( 0.25 ,   0.24 ,   0.13 )   ( 0.20 ,   0.11 ,   0.12 )   ( 0.24 ,   0.34 ,   0.30 )
  ε 3   ( 0.22 ,   0.23 ,   0.24 )   ( 0.33 ,   0.32 ,   0.31 )   ( 0.16 ,   0.17 ,   0.18 )   ( 0.11 ,   0.12 ,   0.13 )   ( 0.26 ,   0.47 ,   0.15 )
  ε 4   ( 0.19 ,   0.30 ,   0.31 )   ( 0.26 ,   0.25 ,   0.44 )   ( 0.21 ,   0.10 ,   0.19 )   ( 0.16 ,   0.15 ,   0.14 )   ( 0.18 ,   0.11 ,   0.33 )
  ε 5   ( 0.16 ,   0.27 ,   0.28 )   ( 0.29 ,   0.18 ,   0.17 )   ( 0.19 ,   0.18 ,   0.17 )   ( 0.21 ,   0.28 ,   0.27 )   ( 0.36 ,   0.14 ,   0.11 )
Table 8. Overall results for above-given Table 5, Table 6 and Table 7.
Table 8. Overall results for above-given Table 5, Table 6 and Table 7.
MethodsScore ValuesRanking
Yu Method [7]No resultNo result
Kahn et al. Method [11]No resultNo result
Riaz et al. method [18]No resultNo result
Arora and Garg Method [31]No resultNo result
  P F S f t P W A  aggregation operators (Proposed) S c ( 1 ) = 0.4843 ,  
S c ( 2 ) = 0.5049 ,    
S c ( 3 ) = 0.4820 ,  
  2 > 1 > 3
  P F S f t P W G  aggregation operators (Proposed) S c ( 1 ) = 0.4719 ,  
S c ( 2 ) = 0.4929 ,    
S c ( 3 ) = 0.4671 ,  
  2 > 1 > 3
Table 9. Characteristic analysis of introduced work and existing literature.
Table 9. Characteristic analysis of introduced work and existing literature.
Methods Parameterization Toll
Yu Method [7]NO
Kahn et al. Method [11]NO
Riaz et al. method [18]NO
Arora and Garg Method [31]Yes
  P F S f t P W A  aggregation operators (Proposed) Yes
  P F S f t P W G  aggregation operators (Proposed) Yes
Table 10. Useful abbreviations used throughout the article.
Table 10. Useful abbreviations used throughout the article.
Full Name Abbreviations
Picture fuzzy soft set   P F S f t S
Picture fuzzy soft Prioritized weighted average aggregation operators   P F S f t P W A
Picture fuzzy soft Prioritized weighted geometric aggregation operators   P F S f t P W G
Multi-attribute group decision making MAGDM
Fuzzy Set FS
Fuzzy set theory FST
Soft set   S f t S
Intuitionistic fuzzy soft set   I F S f t S
Pythagorean fuzzy soft set   P y F S f t S
q-rung orthopair fuzzy soft set   q R O F S f t S
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ahmmad, J.; Mahmood, T. Picture Fuzzy Soft Prioritized Aggregation Operators and Their Applications in Medical Diagnosis. Symmetry 2023, 15, 861. https://doi.org/10.3390/sym15040861

AMA Style

Ahmmad J, Mahmood T. Picture Fuzzy Soft Prioritized Aggregation Operators and Their Applications in Medical Diagnosis. Symmetry. 2023; 15(4):861. https://doi.org/10.3390/sym15040861

Chicago/Turabian Style

Ahmmad, Jabbar, and Tahir Mahmood. 2023. "Picture Fuzzy Soft Prioritized Aggregation Operators and Their Applications in Medical Diagnosis" Symmetry 15, no. 4: 861. https://doi.org/10.3390/sym15040861

APA Style

Ahmmad, J., & Mahmood, T. (2023). Picture Fuzzy Soft Prioritized Aggregation Operators and Their Applications in Medical Diagnosis. Symmetry, 15(4), 861. https://doi.org/10.3390/sym15040861

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop