1.
Introduction
Crisp set theory and logic are key factors in the foundation of science and engineering. A crisp set describes the belongingness of an element in a digital manner, i.e., an element either belongs to a set or not. However, in many real-life problems, partial belongingness becomes necessary to describe uncertainty. In most of real-life problems, we have to deal with the situations where crisp set theory fails. For example, if a decision maker (DM) requires to seek a best teacher, sharp student, beautiful girl, young researcher, etc., the selection of such individual is vague. Since the criterion of best, sharp, beautiful, and young vary person to person. To deal with such problems, Zadeh [1] extended crisp set to fuzzy set and laid foundation of fuzzy set theory. A fuzzy set assigns partial grades which lies in unit closed interval [0,1] known as membership degree (MDs) to express the partial belongingness of an element to a set under a specific characteristics. A fuzzy set is strong set-theoretic model to express vague information. Fuzzy set got the attention of the researchers and this is broadly used in many fields like computational intelligence, information fusion, pattern recognition, engineering, medical diagnosis, artificial intelligence, machine learning, neural networks, and MCDM problems.
Atanassov [2] extended fuzzy set to the notion of intuitionistic fuzzy set (IFS). An IFS is very useful and efficient model which assigns MDs and non-membership degrees (NMDs) to each element in the universe of discourse with the constraint that sum of these grades lies between 0 and 1. Yager [3] introduced Pythagorean fuzzy set (PFS) with the constraint that sum of squares of MDs and NMDs is less or equal to 1. PFS is useful to deal with the uncertain situation where IFS fails to hold. For example, if the sum of MD and NMD is greater than 1 but the sum of their squares is less or equal to 1. This clearly shows that every PFS is an IFS but converse does not hold. Peng and Yang [4] presented some important results for PFSs. Peng et al. [5] proposed Pythagorean fuzzy information measures and their applications in pattern recognition, clustering analysis, and medical diagnosis. Peng and Selvachandran [6] introduced further interesting properties of PFSs. Yager [7] further introduced a strong model named as q-rung orthopair fuzzy set (q-ROFS) which is extension of both PFS and IFS.
Peng and Liu [8] introduced information measures for q-rung orthopair fuzzy sets. Molodtsov [9] introduced the concept of soft set (SS) which is a parameterized collection of subsets of a classical set. Maji et al. [10] extended IFS to intuitionistic fuzzy soft set (IFSS). Peng et al. [11], and Naeem et al. [12] introduced the idea of Pythagorean fuzzy soft sets (PFSSs) as a hybrid model of PFS and SS. Guleria and Bajaj [13] introduced matrix form of PFSSs and proposed a decision-making algorithm and its application.
Smarandache [14,15] introduced the idea of neutrosophic set (NS) with three functions, truthness (truth membership) T, indeterminacy I, and falsity (false membership) F. Wang et. al. [16] introduced single-valued neutrosophic set (SVNS) with the constraints that three components, truth membership, indeterminacy, and falsity must lies in the unit closed interval [0,1]. Cuong [17] introduced the concept of picture fuzzy set with three index, a membership grade, hesitancy, and a non-membership grade with the constraint that the sum of these grades is less or equal to 1. Gundogdu and Kahraman [18] further introduced the concept of spherical fuzzy set (SFS). These models have the ability to deal with uncertainties in the real-life problems with the interesting features that if one model fails to hold the other will manage the uncertain situation. A SFS is of great importance as it has the ability to express vague and uncertain information with the condition that the sum of squares of three index, a membership grade, hesitancy, and a non-membership grade, is less than or equal to 1. Ahmmad et al. [19] developed new average aggregation operators based on SFSs and their applications in MCDM.
Gundogdu and Kahraman [20,21,22] introduced several properties and arithmetic operations of spherical fuzzy sets, TOPSIS method for optimal site selection of electric vehicle charging station by using spherical fuzzy, and hospital performance assessment using interval-valued spherical fuzzy analytic hierarchy process. Gundogdu et al. [23] presented the analysis of usability test parameters affecting the mobile application designs by using spherical fuzzy sets. Shishavan et al. [24] proposed novel similarity measures in spherical fuzzy environment and their applications. Rafiq et al. [25] established new cosine similarity measures of spherical fuzzy sets and their applications in decision-making. Deli and Cagman [26] introduced spherical fuzzy numbers and spherical triangular fuzzy numbers and MCDM applications.
Garg and Arora [27] proposed extended TOPSIS method based on correlation coefficient for MCDM with IFSS information. Ashraf and Abdullah [28] also independently proposed the idea of spherical fuzzy set. Mahmood et al. [29] introduced some elementary operations on SFSs. Sitara et al. [30] decision-making analysis based on q-rung picture fuzzy graph structures. Akram et al. [31] proposed a hybrid decision-making framework under complex spherical fuzzy prioritized weighted aggregation operators. Recently, Akram et al. [32] introduced Extensions of Dombi aggregation operators with MCDM applications. Riaz and Hashmi [33] introduced a new extension of fuzzy sets named as linear Diophantine fuzzy set (LDFS). Kamaci [34] presented linear Diophantine fuzzy algebraic structures and their application to coding theory. Ayub et al. [35] introduced linear Diophantine fuzzy relations and their algebraic structures with decision making application. Shaheen et al. [36] analyzed risk analysis with generalized hesitant fuzzy rough sets (GHFRS).
Zhang [37] introduced bipolar fuzzy set (BFS) as an extension of FS. This set is used to deal with the data which is bipolar in nature that describes information and with its counter property. Lee [38] introduced bipolar-valued fuzzy sets and their elementary operations. Chen et al. [39] introduced m-polar fuzzy sets (m-PFS) as an extension of bipolar fuzzy sets. An m-PFS deals with multipolarity by assigning m degrees to each element of a crisp set. Recently, some hybrid structures of m-PFSs have been introduced for modeling uncertainties in multi-criteria decision-making (MCDM) problems. Naeem et al. [40] introduced the notion of Pythagorean m-polar fuzzy set (P-m-PFS) as a hybrid model of PFS and m-PFS. Riaz et al. [41] proposed Pythagorean m-polar fuzzy soft set (P-m-PFSS) as a hybrid model of PFS, m-PFS, and SS.
Correlation is a property that evaluates the mutual or reciprocal relation between two objects in connection to each other, while similarity measurement tests the proximity of two objects. In engineering and statistics, correlation have significant applications. Statistics have used probability approaches successfully to deal with many real space problems that rely on random data analysis. Similarly, the same probability theory has also tackled several mathematical issues in the scientific fields. These techniques, though, have certain inconveniences, as these procedures are dependent on a random choice of samples with a certain degree of confidence. If we gather data on a vast scale, it involves massive fluidity, which makes it impossible to refine idealism. Highlighting these challenges is how to achieve idealistic performance. A big question? It is very difficult to address this query. The first thing to note is that confusion still takes a position in every real situation, regardless of the technicality, medical or administrative problem. Correlation in statistics is one of our most essential topics of different subjects like business, finance, engineering, management, etc. The dilemma, though, is that this kind of correlation can only address the crisp data and we have resolved several real issues without considering complexity. Many ambiguous structures have been added to deal with uncertainty since the birth of the fuzzy set theory. Many extensions of fuzzy sets have been developed to express vague information until now. Consequently, correlation measures must be introduced in almost all extensions of fuzzy sets. Some correlation measures for IFSs was proposed by Ejegwa et. al. [42], Xu et. al. [43], Gerstenkorn and Manko [44], and Szmidt and Kacprzyk [45]. Later, Garg [46] suggested correlation measures in PFS environment. Liu et. al. [47] and Thao [48] observed the restrictions of the earlier defined correlations and proposed some new directional correlations for PFS environment. Correlation measures studied by Mahmood and Ali [49] to define an extended TOPSIS method based on PFS environment. Zulqarnain et al. [50] defined correlated TOPSIS for mask selection procedure. Joshi [51] defined some weighted correlations for MCDM.
1.In many real-life problems, we have to deal with the hybrid situations where multi-polarity of each of three index (membership, non-membership and neutral-membership degree) of the alternatives are required but with the help of existing models we can't handle this situations. To deal with this type of problems, we introduce the hybrid structure of m-polar fuzzy set and spherical fuzzy set named as m-polar spherical fuzzy set (m-PSFS). We introduce the idea of m-polar spherical fuzzy numbers (m-PSFNs). These concepts are more efficient to express vague and uncertain information in a realistic manner.
2.We introduce some basic operational laws of m-PSFSs and m-PSFNs. Based on these operational laws, we analyze certain properties of m-PSFSs and m-PSFNs.
3.We define the score function and certainty functions for comparison of mPSFNs and for finding the ranking of feasible alternatives.
4.We introduce new correlation measures and weighted correlation measures for m-PSFSs.
5.We present a MCDM method based on these correlation measures for medical diagnosis and pattern recognition.
This article is arranged as follows. In Section 2, we discuss basic concepts of m-PFS and SFS. In Section 3, the notion of m-PSFS is introduced which is a robust fusion of m-PFS and SFS. Some basic operations on m-PSFSs are introduced to analyze key properties of m-PSFSs. We also defined several novel features of m-PSFSs. In Section 4, the correlation measures and weighted correlation measures for m-PSFSs are proposed. The proposed correlation measures have their value in the interval [−1,1]. In Section 5, we give applications of proposed correlation measures for m-PSFSs to pattern recognition and medical diagnosis. Lastly, the conclusion od current research work is summarized in Section 6.
2.
Preliminaries
In this section, we review some preliminaries like spherical fuzzy set and m-polar fuzzy set that are necessary to understand many novel concepts in this manuscript.
Definition 2.1. Let X be the universe (set of objects or alternatives). A spherical fuzzy set (SFS) T on X having three index of membership degrees μ, indeterminacy π, and non-membership degree ν, which lies in the unit closed interval [0,1] for each object ς∈X, can be expressed as
satisfying the restriction
∀ς∈X. For the fixed ς, the triplet (μ,π,ν) is called spherical fuzzy number.
Definition 2.2. For any arbitrary cardinal number m, an m-polar fuzzy set (m-PFS) on X is characterized by the mapping Υ:X→[0,1]m. An m-PFS can be expressed as
where 0≤μi(ς)≤1, for all i=1,⋯,m.
3.
m-Polar spherical fuzzy set
In this section, first we introduce the notion of m-PSFS which is a robust fusion of m-PFS and SFS. Then we define some fundamental operations on m-PSFSs and their related key properties. Several novel features of m-PSFSs are also investigated.
Definition 3.1. An m-PSFSs S defined on X is characterized by the mappings μ(j):X→[0,1] (known as membership function), π(j):X→[0,1] (known as hesitant function) and ν(j)):X→[0,1] (known as non-membership function), respectively with the restriction that sum of their squared values should not exceed unity, i.e.,
for j = 1, 2, 3, ..., m.
Mathematically, An m-PSFS can be written as
and refusal degree is R=√1−(μ(j)(ς))2−(π(j)(ς))2−(ν(j)(ς))2, for j = 1, 2, 3, ..., m
For a fixed ς, an m-polar spherical fuzzy number (m-PSFN) can be written as
If the cardinality of X is k, then the tabular representation of m-PSFS is given by Table 1:
and m-polar spherical fuzzy set(m-PSFS) can be represented in matrix form as
The collection of all m-PSFSs on X is denoted by m−PSFS(X).
Definition 3.2. An m-PSFS is said to be an empty or null m-PSFS if
μ(j)(ς)=0, π(j)(ς)=0 and ν(j)(ς)=1 for all j = 1, 2, 3, ..m. It is denoted as ˜Φ and scripted as
Its matrix representation is
Definition 3.3. An m-PSFS is said to be absolute m-PSFS, if
μ(j)(ς)=1, π(j)(ς)=0 and ν(j)(ς)=0 for all j = 1, 2, 3, ..m. It is denoted as ˜X and scripted as
Its matrix representation is
Definition 3.4. Let S1 and S2 be two m-PSFSs. Then S1 is subset of S2 written as S1⊆S2 if μ(j)1(ς)⪯μ(j)2(ς),π(j)1(ς)⪯π(j)2(ς) and ν(j)1(ς)⪰ν(j)2(ς) for all ς∈X and for j=1,2,3,⋯,m.
Two sets S1 and S2 are said to be equal if S1⊆S2 and S2⊆S1.
Definition 3.5. The complement of m-PSFS
is defined as
It is interesting to note that information given by hesitancy part of m-PSFS is uncertain. It does not give exact information as given by membership and non-membership grades. Thus the h-complement of m-PSFS is denoted as C∗ and defined as
Notice that (Sc)c=S, ˜Φc=˜X and ˜Xc=˜Φ.
Definition 3.6. The union of two m-PSFSs S1 and S2 defined over the same universal set X is defined as
Definition 3.7. The intersection of two m-PSFSs S1 and S2 defined over the same universal set X can be defined as
Definition 3.8. The difference of two m-PSFSs S1 and S2 defined over the same universal set X is defined as
Definition 3.9. let S1 and S2 are m-PSFSs over X. Then some new operations are as follows.
1.S1⊕S2={⟨ς,(((μ(j)1(ς))2+(μ(j)2(ς))2−(μ(j)1(ς))2(μ(j)2(ς))2))1/2,((1−(μ(j)2(ς))2)(π(j)1(ς))2+(1−(μ(j)1(ς))2)(π(j)2(ς))2−(π(j)1(ς))2(π(j)2(ς))2)1/2,ν(j)1(ς)ν(j)2(ς))⟩mj=1:ς∈X}
2.S1⊗S2={⟨ς,(μ(j)1(ς)μ(j)2(ς),((1−(ν(j)2(ς))2)(π(j)1(ς))2+(1−(ν(j)1(ς))2)(π(j)2(ς))2−(π(j)1(ς))2(π(j)2(ς))2)1/2,((ν(j)1(ς))2+(ν(j)2(ς))2−(ν(j)1(ς))2(ν(j)2(ς))2)1/2)⟩mj=1:ς∈X}
3.λS={⟨ς,((1−(1−(μ(j)(ς))2)λ)1/2,((1−μ(j)(ς))2)λ−(1−(μ(j)(ς))2−(π(j)(ς))2)λ)1/2,(ν(j)(ς))λ)⟩mj=1:ς∈X},λ>0
4.Sλ={⟨ς,((μ(j)(ς))λ,((1−(ν(j)(ς))2)λ−(1−(ν(j)(ς))2−(π(j)(ς))2)λ)1/2,(1−(1−(ν(j)(ς))2)λ)1/2)⟩mj=1:ς∈X},λ>0
Some novel features of m-polar spherical fuzzy set
Theorem 3.10. Let S=⟨(μ(j)s,π(j)s,ν(j)s)⟩mj=1, S1=⟨(μ(j)1,π(j)1,ν(j)1)⟩mj=1 S2=⟨(μ(j)2,π(j)2,ν(j)2)⟩mj=1
and T=⟨(μ(j)T,π(j)T,ν(j)T)⟩mj=1 be m-PSFNs. Then
1.If S⊆S1 and S⊆S2 then S⊆S1∩S2.
2.If S1⊆S and S2⊆S then S1∪S2⊆S.
3.If S1⊆S and S2⊆T then S1∪S2⊆S∪T.
4.If S1⊆S and S2⊆T then S1∩S2⊆S∩T.
Proof. In the following, we shall prove (1) and (3) and (2) and (4) can be proved similar.
(1) If S⊆S1 and S⊆S2, then by definition
Suppose
then
S1∩S2=⟨(min{μ(j)1,μ(j)2},min{π(j)1,π(j)2},max{ν(j)1,ν(j)2})⟩mj=1=⟨(μ(j)1,π(j)1,ν(j)2)⟩mj=1
Clearly from equations (3.1) and (3.2) μ(j)S⪯μ(j)1,π(j)S⪯π(j)1 and ν(j)S⪰ν(j)2. This Shows that S⊆S1∩S2.
The rest of 7 cases may be discussed similarly.
(3). If S1⊆S and S2⊆T, then by definition
Suppose
and
then
S1∪S2=⟨(max{μ(j)1,μ(j)2},min{π(j)1,π(j)2},min{ν(j)1,ν(j)2})⟩mj=1=⟨(μ(j)2,π(j)1,ν(j)1)⟩mj=1
S∪T=⟨(max{μ(j)S,μ(j)T},min{π(j)S,π(j)T},min{ν(j)S,ν(j)T})⟩mj=1=⟨(μ(j)T,π(j)S,ν(j)S)⟩mj=1
Clearly from equations (3.3) and (3.4)
This shows that S1∪S2⊆S∪T.
The rest of 7 cases may be discussed similarly.
Theorem 3.11. Let S1=⟨(μ(j)1,π(j)1,ν(j)1)⟩mj=1 and S2=⟨(μ(j)2,π(j)2,ν(j)2)⟩mj=1 be two m-PSFNs and λ>0, then
1.S1⊆S2⇔(S2)c∗⊆(S1)c∗
2.S1=S2⇔(S2)c∗=(S1)c∗
3.S1=S2⇔(S2)c=(S1)c
4.S1⊆S2⇔λ(S1)⊆λ(S2)
5.S1=S2⇔λ(S1)=λ(S2)
Proof. The proof is obvious.
Theorem 3.12. Let S=⟨(μ(j),π(j),ν(j))⟩mj=1 and λ>0, then following results hold
1.(Sλ)c=λ(Sc)
2.(λ(Sc))c=(S)λ
3.(λS)c=(Sc)λ
Proof. (1) By definition,
(2) By definition,
(3) By definition,
Theorem 3.13. Let S1=⟨(μ(j)1,π(j)1,ν(j)1)⟩mj=1, S2=⟨(μ(j)2,π(j)2,ν(j)2)⟩mj=1 and λ>0, then
1.λ(S1∪S2)=λS1∪λS2
2.(S1∪S2)λ=Sλ1∪Sλ2
Proof. Here, we shall prove (1) and (2) can be proved analogously.
Suppose the first possibility
(1) λS1∪λS2=λ⟨(μ(j)1,π(j)1,ν(j)1)⟩mj=1∪ λ⟨(μ(j)2,π(j)2,ν(j)2)⟩mj=1
=⟨(√1−(1−(μ(j)1)2)λ,√(1−(μ(j)1)2)λ−(1−(μ(j)1)2−(π(j)1)2)λ,(ν(j)1)λ)⟩mj=1 ∪⟨(√1−(1−(μ(j)2)2)λ,√(1−(μ(j)2)2)λ−(1−(μ(j)2)2−(π(j)2)2)λ,(ν(j)2)λ)⟩mj=1
=⟨max{√1−(1−(μ(j)1)2)λ,√1−(1−(μ(j)2)2)λ},min{√(1−(μ(j)1)2)λ−(1−(μ(j)1)2−(π(j)1)2)λ,√(1−(μ(j)2)2)λ−(1−(μ(j)2)2−(π(j)2)2)λ},min{(ν(j)2)λ,(ν(j)2)λ}⟩mj=1
=⟨√1−(1−max{(μ(j)1)2,(μ(j)2)2)}λ,√(1−min{(μ(j)1)2),(μ(j)2)2}−(1−min{(μ(j)1)2),(μ(j)2)2)}−min{(π(j)1)2),(π(j)2)2)})λ,min{(ν(j)2)λ,(ν(j)2)λ}⟩mj=1
= λ⟨max{μ1,μ2},min{π1,π2},min{ν1,ν2}⟩
= λ(S1∪S2)
The rest of 7 possibilities may be discussed similarly.
Theorem 3.14. Let S1=⟨(μ(j)1,π(j)1,ν(j)1)⟩mj=1, S2=⟨(μ(j)2,π(j)2,ν(j)2)⟩mj=1 and λ>0, then
1. λ(S1⊕S2)=(((S1⊕S2)c)λ)c
2. λ(S1⊗S2)=(((S1⊗S2)c)λ)c
3. λ(S1⊕S2)=λ(S1)⊕λ(S2)
4. (S1⊗S2)λ=Sλ1⊗Sλ2
5. λ(S1)⊗λ(S2)=(((S1)c)λ⊕((S2)c)λ)c
Proof. (1) (((S1⊕S2)c)λ)c=(((⟨((μ(j)1)2+(μ(j)2)2−(μ(j)1)2(μ(j)2)2)1/2,(1−(μ(j)2)2)(π(j)1)2+(1−(μ(j)1)2)(π(j)2)2−(π(j)1)2(π(j)2)2)1/2,(ν(j)1)(ν(j)2)⟩mj=1)c)λ)c=(⟨((ν(j)1)(ν(j)2),((1−(μ(j)2)2)(π(j)1)2+(1−(μ(j)1)2)(π(j)2)2−(π(j)1)2(π(j)2)2)1/2,((μ(j)1)2+(μ(j)2)2−(μ(j)1)2(μ(j)2)2)1/2⟩mj=1)λ)c=(⟨(ν(j)1)λ(ν(j)2)λ,((1−((μ(j)1)2+(μ(j)2)2−(μ(j)1)2(μ(j)2)2))λ−((1−((μ(j)1)2+(μ(j)2)2−(μ(j)1)2(μ(j)2)2))−(1−(μ(j)2)2)(π(j)1)2+(1−(μ(j)1)2)(π(j)2)2−(π(j)1)2(π(j)2)2)))1/2,(1−(1−((μ(j)1)2+(μ(j)2)2−(μ(j)1)2(μ(j)2)2))λ)1/2⟩mj=1)c=⟨(1−(1−((μ(j)1)2+(μ(j)2)2−(μ(j)1)2(μ(j)2)2))λ)1/2,((1−((μ(j)1)2+(μ(j)2)2−(μ(j)1)2(μ(j)2)2))λ−((1−((μ(j)1)2+(μ(j)2)2−(μ(j)1)2(μ(j)2)2))−(1−(μ(j)2)2)(π(j)1)2+(1−(μ(j)1)2)(π(j)2)2−(π(j)1)2(π(j)2)2)))1/2,(ν(j)1)λ(ν(j)2)λ⟩mj=1=λ⟨((μ(j)1)2+(μ(j)2)2−(μ(j)1)2(μ(j)2)2)1/2,(1−(μ(j)2)2)(π(j)1)2+(1−(μ(j)1)2)(π(j)2)2−(π(j)1)2(π(j)2)2)1/2,(ν(j)1)(ν(j)2)⟩mj=1=λ(S1⊕S2)
Thus (2) can be proved analogously.
(3) By definition
λ(S1)=⟨(√1−(1−(μ(j)1)2)λ,√(1−(μ(j)1)2)λ−(1−(μ(j)1)2−(π(j)1)2)λ,(ν(j)1)λ)⟩mj=1
and
λ(S2)=⟨(√1−(1−(μ(j)2)2)λ,√(1−(μ(j)2)2)λ−(1−(μ(j)2)2−(π(j)2)2)λ,(ν(j)2)λ)⟩mj=1.
λ(S1)⊕λ(S2)=((1−(1−(μ(j)1)2)λ)+(1−(1−(μ(j)2)2)λ)−(1−(1−(μ(j)1)2)λ)(1−(1−(μ(j)2)2)λ))1/2,((1−(1−(μ(j)2)2)λ)((1−(μ(j)1)2)λ−(1−(μ(j)1)2−(π(j)1)2)λ)+(1−(1−(μ(j)1)2)λ)((1−(μ(j)2)2)λ−(1−(μ(j)2)2−(π(j)2)2)λ)−(1−(1−(μ(j)2)2)λ)((1−(μ(j)1)2)λ−(1−(μ(j)1)2−(π(j)1)2)λ)(1−(1−(μ(j)1)2)λ)((1−(μ(j)2)2)λ−(1−(μ(j)2)2−(π(j)2)2)λ))1/2,(ν(j)1)λ(ν(j)2)λ⟩mj=1=(2−(1−(μ(j)1)2)λ−(1−(μ(j)2)2)λ−1+(1−(μ(j)1)2)λ+(1−(μ(j)2)2)λ−(1−(μ(j)1)2)λ(1−(μ(j)2)2)λ)1/2,((1−(μ(j)2)2)λ(1−(μ(j)1)2)λ−(1−(μ(j)2)2)λ(1−(μ(j)1)2−(π(j)1)2)λ+(1−(μ(j)1)2)λ(1−(μ(j)2)2)λ−(1−(μ(j)1)2)λ(1−(μ(j)2)2−(π(j)2)2)λ−(1−(μ(j)1)2)λ(1−(μ(j)2)2)λ+(1−(μ(j)1)2)λ(1−(μ(j)2)2−(π(j)2)2)λ+(1−(μ(j)2)2)λ(1−(μ(j)1)2−(π(j)1)2)λ−(1−(μ(j)1)2−(π(j)1)2)λ(1−(μ(j)2)2−(π(j)2)2)λ)1/2,(ν(j)1)λ(ν(j)2)λ⟩mj=1=⟨(1−(1−((μ(j)1)2+(μ(j)2)2−(μ(j)1)2(μ(j)2)2))λ)1/2,((1−((μ(j)1)2+(μ(j)2)2−(μ(j)1)2(μ(j)2)2))λ−((1−((μ(j)1)2+(μ(j)2)2−(μ(j)1)2(μ(j)2)2))−(1−(μ(j)2)2)(π(j)1)2+(1−(μ(j)1)2)(π(j)2)2−(π(j)1)2(π(j)2)2)))1/2,(ν(j)1)λ(ν(j)2)λ⟩mj=1=λ⟨((μ(j)1)2+(μ(j)2)2−(μ(j)1)2(μ(j)2)2)1/2,(1−(μ(j)2)2)(π(j)1)2+(1−(μ(j)1)2)(π(j)2)2−(π(j)1)2(π(j)2)2)1/2,(ν(j)1)(ν(j)2)⟩mj=1=λ(S1⊕S2)
Thus (4) can be proved analogously.
(5) (((S1)c)λ⊕((S2)c)λ)c=((⟨(ν(j)1,π(j)1,μ(j)1)⟩mj=1)λ⊕(⟨(ν(j)1,π(j)1,μ(j)1)⟩mj=1)λ)c=(⟨((ν(j)1)λ,((1−(μ(j)1)2)λ−(1−(μ(j)1)2−π(j)1)2)λ)1/2,(1−(1−(μ(j)1)2)λ)1/2)⊕((ν(j)2)λ,((1−(μ(j)2)2)λ−(1−(μ(j)2)2−π(j)2)2)λ)1/2,(1−(1−(μ(j)2)2)λ)1/2)⟩mj=1)c=(⟨(((ν(j)1)2+(ν(j)2)2−(ν(j)1)2(ν(j)2)2)λ)1/2,((1−(ν(j)2)2)λ)((1−(μ(j)1)2)λ−(1−(μ(j)1)2−(π(j)1)2)λ)+(1−(ν(j)1)2)λ)((1−(μ(j)2)2)λ−(1−(μ(j)2)2−(π(j)2)2)λ−((1−(μ(j)1)2)λ−(1−(μ(j)1)2−(π(j)1)2)λ((1−(μ(j)2)2)λ−(1−(μ(j)2)2−(π(j)2)2)λ))1/2,(1−(1−(μ(j)1)2)λ)1/2(1−(1−(μ(j)2)2)λ)1/2⟩mj=1)c=(⟨(((ν(j)1)2+(ν(j)2)2−(ν(j)1)2(ν(j)2)2)λ)1/2,(1−(ν(j)2)2)λ)(1−(μ(j)1)2)λ−(1−(ν(j)2)2)λ)(1−(μ(j)1)2−(π(j)1)2)λ)+(1−(ν(j)1)2)λ)(1−(μ(j)2)2)λ−(1−(ν(j)1)2)λ)(1−(μ(j)2)2−(π(j)2)2)λ)−(1−(ν(j)1)2)λ)(1−(μ(j)2)2)λ)+(1−(μ(j)1)2)λ)(1−(μ(j)2)2−(π(j)2)2)λ+(1−(μ(j)2)2)λ)(1−(μ(j)1)2−(π(j)1)2)λ+(1−(μ(j)1)2−(π(j)1)2)λ(1−(μ(j)2)2−(π(j)2)2)λ,(1−(1−(μ(j)2)2)λ)−(1−(μ(j)1)2)λ)+(1−(μ(j)1)2)λ)(1−(μ(j)2)2)λ))⟩mj=1)c=⟨(1−(1−(μ(j)2)2)λ)−(1−(μ(j)1)2)λ)+(1−(μ(j)1)2)λ)(1−(μ(j)2)2)λ)),(1−(ν(j)2)2)λ)(1−(μ(j)1)2)λ−(1−(ν(j)2)2)λ)(1−(μ(j)1)2−(π(j)1)2)λ)+(1−(ν(j)1)2)λ)(1−(μ(j)2)2)λ−(1−(ν(j)1)2)λ)(1−(μ(j)2)2−(π(j)2)2)λ)−(1−(ν(j)1)2)λ)(1−(μ(j)2)2)λ)+(1−(μ(j)1)2)λ)(1−(μ(j)2)2−(π(j)2)2)λ+(1−(μ(j)2)2)λ)(1−(μ(j)1)2−(π(j)1)2)λ+(1−(μ(j)1)2−(π(j)1)2)λ(1−(μ(j)2)2−(π(j)2)2)λ,(((ν(j)1)2+(ν(j)2)2−(ν(j)1)2(ν(j)2)2)λ)1/2⟩mj=1=⟨(1−(1−(μ(j)1)2)λ)1/2,((1−(μ(j)1)2)λ−(1−(μ(j)1)2−π(j)1)2)λ)1/2,(ν(j)1)λ⟩mj=1⊗⟨(1−(1−(μ(j)2)2)λ)1/2,((1−(μ(j)2)2)λ−(1−(μ(j)2)2−π(j)2)2)λ)1/2,(ν(j)2)λ⟩mj=1=λ(S1)⊗λ(S1)
Theorem 3.15. let S1=⟨(μ(j)1,π(j)1,ν(j)1)⟩mj=1, S2=⟨(μ(j)2,π(j)2,ν(j)2)⟩mj=1 and S3=⟨(μ(j)3,π(j)3,ν(j)3)⟩mj=1, then
1.(S1∪S2)∩S2=S2
2. (S1∩S2)∪S2=S2
3. S1∪S2∪S3=S1∪S3∪S2
4. S1∩S2∩S3=S1∩S3∩S2
Proof. The proof is obvious.
Theorem 3.16. Let S1=⟨(μ(j)1,π(j)1,ν(j)1)⟩mj=1, S2=⟨(μ(j)2,π(j)2,ν(j)2)⟩mj=1 and S3=⟨(μ(j)3,π(j)3,ν(j)3)⟩mj=1, then
1.(S1∪S2)⊕S3=(S1⊕S3)∪(S2⊕S3)
2. (S1∩S2)⊕S3=(S1⊕S3)∩(S2⊕S3)
3. (S1∪S2)⊗S3=(S1⊗S3)∪(S2⊗S3)
4. (S1∩S2)⊗S3=(S1⊗S3)∩(S2⊗S3)
Proof. Suppose the first possibility
(1)
The rest of possibilities may be considered accordingly.
(3)
(S1⊗S3)∪(S2⊗S3)=(⟨(μ(j)1)(μ(j)3),(1−(ν(j)3)2)(π(j)1)2+(1−(ν(j)1)2)(π(j)3)2−(π(j)1)2(π(j)3)2)1/2,((ν(j)1)2+(ν(j)3)2−(ν(j)1)2(ν(j)3)2)1/2⟩mj=1)∪(⟨(μ(j)2)(μ(j)3),(1−(ν(j)3)2)(π(j)2)2+(1−(ν(j)2)2)(π(j)3)2−(π(j)2)2(π(j)3)2)1/2,((ν(j)2)2+(ν(j)3)2−(ν(j)2)2(ν(j)3)2)1/2⟩mj=1)=⟨max{(μ(j)1)(μ(j)3),(μ(j)2)(μ(j)3)},min{(1−(ν(j)3)2)(π(j)1)2+(1−(ν(j)1)2)(π(j)3)2−(π(j)1)2(π(j)3)2)1/2,(1−(ν(j)3)2)(π(j)2)2+(1−(ν(j)2)2)(π(j)3)2−(π(j)2)2(π(j)3)2)1/2,},min{((ν(j)1)2+(ν(j)3)2−(ν(j)1)2(ν(j)3)2)1/2,((ν(j)2)2+(ν(j)3)2−(ν(j)2)2(ν(j)3)2)1/2}⟩mj=1=⟨(μ(j)2)(μ(j)3),(1−(ν(j)3)2)(π(j)1)2+(1−(ν(j)1)2)(π(j)3)2−(π(j)1)2(π(j)3)2)1/2,((ν(j)1)2+(ν(j)3)2−(ν(j)1)2(ν(j)3)2)1/2⟩mj=1=⟨max{μ(j)1,μ(j)2},min{π(j)1,π(j)2},min{ν(j)1,ν(j)2}⟩mj=1⊗⟨(μ(j)3,π(j)3,ν(j)3)⟩mj=1=(S1∪S2)⊗S3
The rest of possibilities may be considered accordingly.
4.
Correlation coefficient for m-PSFSs
The correlation coefficient is a statistical analysis of how strong an association exists between two variables' variations. The scope of values is -1.0 to 1.0. There was an error in the correlation calculation if the computed number was greater than 1.0 or less than -1.0. A negative correlation of -1.0 indicates a complete negative correlation, while a positive correlation of 1.0 indicates a complete positive correlation. A correlation of 0.0 means that the changes of the two variables have no linear relationship. In this section, we define correlation coefficient in m-PSFSs. We analyze their usefulness and address some of their characteristics.
Definition 4.1. Let S={⟨ς,(μ(j)(ς),π(j)(ς),ν(j)(ς))⟩mj=1:ς∈X} be a m-PSFS over a universal set X. Then the average or mean of S is defined as
If we take X = {ς1,ς2,ς3,ς4,ς5} and 3PSFSs as
then the average or mean of S is given by
, where
Definition 4.2. Let
and
be m-PSFSs over X. Then covariance of SA and SB can be defined as
Where,
for j = 1, 2, 3, ..., m.
Definition 4.3. Let SA be a m-PSFS on X as mentioned in definition 4.2. Then Variance of SA can be defined as
Where,
for j = 1, 2, 3, ..., m.
Proposition 4.4. The covariance and variance for m-PSFSs of SA and SB follow the following properties.
(a) I(j)μ(SA→SA)=V(j)μ(SA), I(j)π(SA→SA)=V(j)π(SA), I(j)ν(SA→SA)=V(j)ν(SA)
(b) I(j)μ(SA→SB )=I(j)μ(SB→SA), I(j)π(SA→SB )=I(j)π(SB→SA), I(j)ν(SA→SB )=I(j)ν(SB→SA)
(c) ∣I(j)μ(SA→SB )∣≤√V(j)μ(SA)V(j)μ(SB), ∣I(j)π(SA→SB )∣≤√V(j)π(SA)V(j)π(SB),
∣I(j)ν(SA→SB )∣≤√V(j)ν(SA)V(j)ν(SB).
Proof. (a) and (b) are simple to prove.
(c) We will use Cauchy-Schwarz inequality to prove our result. Cauchy-Schwarz inequality states that
for ul,vl∈R Consider
The other two are simple to prove.
Definition 4.5. Let SA and SB be m-PSFSs over X as mentioned in Definition 4.2. Then correlation coefficient of SA and SB can be defined by
Where,
for j = 1, 2, 3, ..., m.
It is very critical to note that if, for some j(=1,2,3,...,m), μ(j)A (ςi)= constant for all i = 1, 2, 3, ..., n, then ¯μ(j)A = constant and hence I(j)μ(SA=0 and V(j)μ(SA)=0 and hence I(j)μ(SA→SB )=0 and V(j)μ(SA)=0. Therefore, the correlation ρ(j)μ(SA,SB) can not be defined. Similarly if π(j)A (ςi)= constant for all i = 1, 2, 3, ..., n, then ¯π(j)A = constant and hence I(j)π(SA=0 and V(j)π(SA)=0 and hence I(j)π(SA→SB )=0 and V(j)π(SA)=0. Therefore, the correlation ρ(j)π(SA,SB) can not be defined. And similarly if ν(j)A (ςi)= constant for all i = 1, 2, 3, ..., n, then ¯ν(j)A = constant and hence I(j)ν(SA=0 and V(j)ν(SA)=0 and hence I(j)ν(SA→SB )=0 and V(j)ν(SA)=0. Therefore, the correlation ρ(j)ν(SA,SB) can not be defined. In either case, ρ(SA,SB) is meaningless. Therefore, our m-PSF information should be diverse in nature.
Example 4.6. Let Table 2
and Table 3
be 3-PSFSs defined over X. Then ¯SA=((0.42,0.38,0.42),(0.39,0.44,0.30),(0.43,0.47,0.13)),
Hence,
Theorem 4.7. For the m-PSFSs SA and SB, we have
(a) The correlation ρ is symmetrical, that is, ρ(SA,SB)=ρ(SB,SA)
(b) The correlation ρ lies between −1 and 1, that is, −1≤ρ(SA,SB)≤1
(c) ρ(SA,SB)=1 if A=B
(d) ρ(SA,SB)=1 if A=(α)B, α>0.
Proof. (a) It is easy to prove.
(b) From the proposition 4.4, we have ∣I(j)μ(SA→SB )∣≤√V(j)μ(SA)V(j)μ(SB)
Similarly, −1≤ρ(j)π(SA,SB)≤1 and −1≤ρ(j)ν(SA,SB)≤1 and hence −1≤ρ(SA,SB)≤1.
(c) If A = B then μ(j)A (ςi)=μ(j)B (ςi), π(j)A (ςi)=π(j)B (ςi) and ν(j)A (ςi)=ν(j)B (ςi), then
ρ(j)μ(SA,SB)=∑ki=1(μ(j)A (ςi)−¯μ(j)A )(μ(j)B (ςi)−¯μ(j)B )√∑ki=1(μ(j)A (ςi)−¯μ(j)A )2∑ki=1(μ(j)B (ςi)−¯μ(j)B )2=∑ki=1(μ(j)A (ςi)−¯μ(j)A )(μ(j)A (ςi)−¯μ(j)A )√∑ki=1(μ(j)A (ςi)−¯μ(j)A )2∑ki=1(μ(j)A (ςi)−¯μ(j)A )2=1 Similarly
ρ(j)π(SA,SB)=1 and ρ(j)ν(SA,SB)=1 and hence ρ(SA,SB)=1.
(d) If A = (α)B then μ(j)A (ςi)=(α)μ(j)B (ςi), π(j)A (ςi)=(α)π(j)B (ςi) and ν(j)A (ςi)=(α)ν(j)B (ςi), then
Similarly ρ(j)π(SA,SB)=1 and ρ(j)ν(SA,SB)=1 and hence ρ(SA,SB)=1.
Definition 4.8. Let SA and SB be m-PSFSs over X as mentioned in definition 4.2. Then correlation coefficient of SA and SB can also be defined as
Where,
and
Theorem 4.9. For the m-PSFSs SA and SB, we have
(a) The correlation ˜ϱ is symmetrical, that is, ˜ϱ(SA,SB)=˜ϱ(SB,SA)
(b) The correlation ˜ϱ lies between −1 and 1, that is, −1≤˜ϱ(SA,SB)≤1
(c) ˜ϱ(SA,SB)=1 if A=B
(d) ˜ϱ(SA,SB)=1 if A=(α)B, α>0.
Proof. (a) It is easy to prove.
(b) From the proposition 4.4, we have ∣I(j)μ(SA→SB )∣≤√V(j)μ(SA)V(j)μ(SB)
Similarly, −1≤˜ϱ(j)π(SA,SB)≤1 and −1≤˜ϱ(j)ν(SA,SB)≤1 and hence −1≤˜ϱ(SA,SB)≤1.
(c) If A = B then μ(j)A (ςi)=μ(j)B (ςi), π(j)A (ςi)=π(j)B (ςi) and ν(j)A (ςi)=ν(j)B (ςi), then
˜ϱ(j)μ(SA,SB)=∑ki=1(μ(j)A (ςi)−¯μ(j)A )(μ(j)B (ςi)−¯μ(j)B )max{∑ki=1(μ(j)A (ςi)−¯μ(j)A )2,∑ki=1(μ(j)B (ςi)−¯μ(j)B )2}=∑ki=1(μ(j)A (ςi)−¯μ(j)A )(μ(j)A (ςi)−¯μ(j)A )max{∑ki=1(μ(j)A (ςi)−¯μ(j)A )2,∑ki=1(μ(j)A (ςi)−¯μ(j)A )2}=1 Similarly
˜ϱ(j)π(SA,SB)=1 and ˜ϱ(j)ν(SA,SB)=1 and hence ˜ϱ(SA,SB)=1.
(d) If A = (α)B then μ(j)A (ςi)=(α)μ(j)B (ςi), π(j)A (ςi)=(α)π(j)B (ςi) and ν(j)A (ςi)=(α)ν(j)B (ςi), then
Similarly ˜ϱ(j)π(SA,SB)=1 and ˜ϱ(j)ν(SA,SB)=1 and hence ˜ϱ(SA,SB)=1.
Two main aspects of most real-world issues should be addressed: complexity and weights. Uncertainty is a major factor that can influence our decisions and analyses when dealing with such issues. Furthermore, weights have an effect on the majority of unknown mathematical models. We describe weighted Correlation coefficients (WCCs) to deal with such issues.
Definition 4.10. Let SA and SB be m-PSFSs defined over X as mentioned in definition 4.2. The alternatives are effected by ς1,ς2,⋯,ςn are affected by the weights ω1,ω2,⋯,ωn with the condition ∑ni=1ωi=1 and 0≤ωi≤1. Then weighted covariance of SA and SB can be defined as
Where,
for j = 1, 2, 3, ..., m.
Definition 4.11. Let SA be a m-PSFS on X as mentioned in definition 4.2. Then weighted variance of SA can be defined as
Where,
for j = 1, 2, 3, ..., m.
Proposition 4.12. The covariance and variance for m-PSFSs of SA and SB follow the following properties.
(a) ωI(j)μ(SA→SA)=ωV(j)μ(SA), ωI(j)π(SA→SA)=ωV(j)π(SA), ωI(j)ν(SA→SA)=ωV(j)ν(SA)
(b) ωI(j)μ(SA→SB )=ωI(j)μ(SB→SA), ωI(j)π(SA→SB )=ωI(j)π(SB→SA), ωI(j)ν(SA→SB )=ωI(j)ν(SB→SA)
(c) ∣ωI(j)μ(SA→SB )∣≤√ωV(j)μ(SA)ωV(j)μ(SB), ∣ωI(j)π(SA→SB )∣≤√ωV(j)π(SA)ωV(j)π(SB),
∣ωI(j)ν(ωSA→SB )∣≤√ωV(j)ν(SA)ωV(j)ν(SB).
Proof. (a) and (b) are simple to prove.
(c) We will use Cauchy-Schwarz inequality to prove our result. Cauchy-Schwarz inequality states that
for ul,vl∈R Consider
The other two are simple to prove.
Definition 4.13. Let SA and SB be m-PSFSs over X as mentioned in definition 4.2. Then weighted correlation coefficient of SA and SB can be defined by
Where,
for j = 1, 2, 3, ..., m.
Theorem 4.14. For the m-PSFSs SA and SB, we have
(a) The weighted correlation ωρ is symmetrical, that is, ωρ(SA,SB)=ωρ(SB,SA)
(b) The weighted correlation ωρ lies between −1 and 1, that is, −1≤ωρ(SA,SB)≤1
(c) ωρ(SA,SB)=1 if A=B
(d) ωρ(SA,SB)=1 if A=(α)B, α>0.
Proof. (a) It is easy to prove.
(b) From the proposition 4.12, we have ∣ωI(j)μ(SA→SB )∣≤√ωV(j)μ(SA)ωV(j)μ(SB)
Similarly, −1≤ωρ(j)π(SA,SB)≤1 and −1≤ωρ(j)ν(SA,SB)≤1 and hence −1≤ωρ(SA,SB)≤1.
(c) If A = B then μ(j)A (ςi)=μ(j)B (ςi), π(j)A (ςi)=π(j)B (ςi) and ν(j)A (ςi)=ν(j)B (ςi), then
ωρ(j)μ(SA,SB)=∑ki=1 ωi(μ(j)A (ςi)−¯μ(j)A )(μ(j)B (ςi)−¯μ(j)B )√∑ki=1 ωi(μ(j)A (ςi)−¯μ(j)A )2∑ki=1 ωi(μ(j)B (ςi)−¯μ(j)B )2=∑ki=1 ωi(μ(j)A (ςi)−¯μ(j)A )(μ(j)A (ςi)−¯μ(j)A )√∑ki=1 ωi(μ(j)A (ςi)−¯μ(j)A )2∑ki=1 ωi(μ(j)A (ςi)−¯μ(j)A )2=1 Similarly
ωρ(j)π(SA,SB)=1 and ωρ(j)ν(SA,SB)=1 and hence ωρ(SA,SB)=1.
(d) If A = (α)B then μ(j)A (ςi)=(α)μ(j)B (ςi), π(j)A (ςi)=(α)π(j)B (ςi) and ν(j)A (ςi)=(α)ν(j)B (ςi), then
Similarly ωρ(j)π(SA,SB)=1 and ωρ(j)ν(SA,SB)=1 and hence ωρ(SA,SB)=1.
Definition 4.15. Let SA and SB be m-PSFSs over X as mentioned in definition 4.2. Then weighted correlation coefficient of SA and SB can also be defined as
Where,
and
Theorem 4.16. For the m-PSFSs SA and SB, we have
(a) The correlation ω˜ϱ is symmetrical, that is, ω˜ϱ(SA,SB)=ω˜ϱ(SB,SA)
(b) The correlation ˜ϱ lies between −1 and 1, that is, −1≤ω˜ϱ(SA,SB)≤1
(c) ω˜ϱ(SA,SB)=1 if A=B
(d) ω˜ϱ(SA,SB)=1 if A=(α)B, α>0.
Proof. (a) It is easy to prove.
(b) From the proposition 4.4, we have ∣ωI(j)μ(SA→SB )∣≤√ωV(j)μ(SA)ωV(j)μ(SB)
Similarly, −1≤ω˜ϱ(j)π(SA,SB)≤1 and −1≤ω˜ϱ(j)ν(SA,SB)≤1 and hence −1≤ω˜ϱ(SA,SB)≤1.
(c) If A = B then μ(j)A (ςi)=μ(j)B (ςi), π(j)A (ςi)=π(j)B (ςi) and ν(j)A (ςi)=ν(j)B (ςi), then
Similarly ω˜ϱ(j)π(SA,SB)=1 and ω˜ϱ(j)ν(SA,SB)=1 and hence ω˜ϱ(SA,SB)=1.
(d) If A = (α)B then μ(j)A (ςi)=(α)μ(j)B (ςi), π(j)A (ςi)=(α)π(j)B (ςi) and ν(j)A (ςi)=(α)ν(j)B (ςi), then
Similarly ω˜ϱ(j)π(SA,SB)=1 and ω˜ϱ(j)ν(SA,SB)=1 and hence ω˜ϱ(SA,SB)=1.
The weights (1n,1n,⋯,1n) is changeless in correlation. So, once such weights occur, we can just ignore them and proceed unweightedly. In other words, the weighted alternatives can be considered uneven. We may observe that
and
5.
Applications of proposed correlation measures
In statistics and engineering the correlation plays a major role. The cumulative relation between two variables can be analysed using the level of stability of the two variables by means of correlation analysis. Correlation actions are prevalent indicators and appropriate methodologies to MCDM problems. Several intellectuals have used correlations in different uncertain conditions to solve these problems quickly and productively. The correlations defined in this article will be used in this section to precisely recognize patterns and medical diagnosis.
Pattern recognition is automatic identification of collection and aggregation in statistics. It is usually classified based on the type of learning experience for producing the value of output. Pattern recognition methods usually help to identify all the independent variables moderately and to make "most likely" the insights to match, taking their statistical variance into consideration. Pattern recognition is usually divided into the classifications of learning process of creating new value of the output.
5.1. Application to pattern recognition
Now we develop Algorithm 1 for pattern recognition with the help of proposed correlation based on m-PSF information.
Example 5.1. Pattern recognition is one of the most important and fundamental concern in robotics, machine learning and security management. We consider a perticular problem of pattern recognition, namely, facial recognition. Facial recognition is a mechanism through which an individual's identification can be confirmed by his face. In photos, videos and even in real time, facial recognition systems can be used to identify people. One of the main category of biometric safety is facial identification. Suppose a machine, which is already feeded with three patterns P(1),P(2) and P(3) of three different persons in the form of m-PSFSs, has to detect a face of an unknown person. (We are considering only three persons in this example because our aim is to give a mathematical model only. However, a certain machine can be feeded with hundreds and thousands of the patterns of different persons at a time). The three patterns are expressed in in terms of 3-PSFS in Table 4, Table 5, Table 6, respectively.
and
The machine first detects the face of an unknown person, analyzes it and converts it into a m-PSF model, say P, which is given in Table 7 as follows.
It, then, finds the correlations of the unknown pattern from the known ones and decides that which pattern is closest to the unknown pattern. This whole facial recognition process can be performed through the following Algorithm 1, that is, the machine can be feeded with the proposed algorithm in order to detect the person.
The correlation coefficients of P from P(1),P(2),P(3) (using the formula (4.1) and (4.2) respectively) are given by
However, if the alternatives ς1,ς2,ς3 pursue some weights ω=(0.24,0.36,0.40), then we find the respective weighted correlation coefficients (using the formula (4.3) and (4.4) respectively) as follows.
The correlation flow of P from the known patterns P(1), P(2) and P(3) under the proposed correlations are given in the following table.
All of the above results show that the pattern P finds the greatest correlation from P(3). Therefore, the facial recognition machine detects the person P as P(3), and then the examiners has to decide the physical existence of the unknown person.
5.2. Medical diagnosis
Now we develop Algorithm 2 for medical diagnosis with the help of proposed correlation for m-PSF information.
Example 5.2. In this example, we use the Algorithm 2 to analyze the actual disease of a patient. Suppose a patient has to be diagnosed in a healthcare center and healthcare experts diagnosis the patient with the following symptoms as follows:
and the possible diseases as follows:
The assessment matrices for β(1), β(2), β(3) and β(4) are expressed in Table 9, Table 10, Table 11, Table 12, respectively.
and Assume the expert opinion for the patient and his symptoms is evaluated in terms 3PSFS as given in Table 13.
In order to check the actual disease of patient, we find the correlation coefficients of β from β(1), β(2) using formula (4.1) and (4.2) respectively as follows.
However, if the patients ς1,ς2,ς3,ς4 are assigned some weights ω=(0.19,0.22,0.26,0.33) from the healthcare team, then we find the respective weighted correlation coefficients using the formula (4.3) and (4.4) respectively as follows.
The correlation flow of P from β(1), β(2) and β(3) under the suggested correlation measures are given in the Table 14. From these results, we find that the patient P shows the greatest correlation with β(2). So, the patient is suffering from typhoid and the necessary measures are to be taken in this regard.
6.
Conclusions
MCDM has been studied by a large number of scholars and researchers. The methods designed for this purpose are generally influenced by the judgment operational framework used. The most of its key issues are attached to vague, imprecise, and multi-polar data that can't be adequately explained by fuzzy set alone. An m-polar fuzzy set (m-PFS) has the ability to deal with vagueness by multi-polarity and the spherical fuzzy set (SFS) deal with uncertainty by using three independent grades (membership degree, neutral-membership degree, and non-membership degree).
In order to deal with real-life vague circumstances when decision makers require a new mathematical model to deal with multi-polarity as well as three independent spherical index, we introduced a new hybrid model named as m-polar spherical fuzzy set (m-PSFS) as a robust fusion of SFS and m-PFS. The existing models namely m-PFS and SFS are the special cases of suggested hybrid m-PSFS. To ensure the algebraic structures of this robust extension, we developed fundamental operations on m-PSFSs and investigated their related results. A suitable numbers of illustrations are presented to explain suggested notions and results. We introduced the correlation measures and weighted correlation measures for m-PSFSs. Certain properties of covariances and the correlation measures are proposed to analyze that suggested concepts are novel extension of crisp correlation measures. The main advantage of proposed correlation measures is that these notions deal with vagueness and uncertainty in the real-life problems efficiently with the help of m-PSF information. We discussed applications of m-PSFSs and their correlation measures in pattern recognition and medical diagnosis. To discuss the superiority and efficiency of proposed correlation measures, we give a comparison analysis of proposed concepts with some existing concepts.
Conflict of interest
The authors declare no conflict of interest.
Acknowledgement
The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University, Abha 61413, Saudi Arabia for funding this work through research groups program under grant number R.G. P-2/29/42.