Next Article in Journal
On a Surface Associated with Pascal’s Triangle
Next Article in Special Issue
Prime Cordial Labeling of Generalized Petersen Graph under Some Graph Operations
Previous Article in Journal
Mixtures of Semi-Parametric Generalised Linear Models
Previous Article in Special Issue
Experimental Analysis of a Fuzzy Scheme against a Robust Controller for a Proton Exchange Membrane Fuel Cell System
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Similarity Measures Based on T-Spherical Fuzzy Information with Applications to Pattern Recognition and Decision Making

1
Department of Mathematics, Riphah Institute of Computing & Applied Sciences (RICAS), Riphah International University (Lahore Campus), Lahore 54000, Pakistan
2
Department of Applied Mathematics, Chung Yuan Christian University, Chung-Li, Taoyuan 32023, Taiwan
3
Department of Computer Sciences, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
4
Department of Logistics, Military Academy, University of Defense in Belgrade, 11000 Belgrade, Serbia
*
Author to whom correspondence should be addressed.
Symmetry 2022, 14(2), 410; https://doi.org/10.3390/sym14020410
Submission received: 26 January 2022 / Revised: 8 February 2022 / Accepted: 16 February 2022 / Published: 18 February 2022
(This article belongs to the Special Issue Research on Fuzzy Logic and Mathematics with Applications)

Abstract

:
T-spherical fuzzy set (TSFS) is a fuzzy layout aiming to provide a larger room for the processing of uncertain information-based data where four aspects of unpredictable information are studied. The frame of picture fuzzy sets (PFSs) and intuitionistic fuzzy sets (IFSs) provide limited room for processing such kinds of information. On a scale of zero to one, similarity measures (SMs) are a tool for evaluating the degrees of resemblance between various items or phenomena. The goal of this paper is to investigate the shortcomings of picture fuzzy (PF) SMs in order to introduce a new SM in a T-spherical fuzzy (TSF) environment. The newly improved SM has a larger ground for accommodating the uncertain information with three degrees and is also responsible for the reduction of information loss. The proposed SM’s validity is demonstrated mathematically and by examples. To examine the application of the suggested SM two real-life issues are discussed, including the concerns of medical diagnosis and pattern recognition. A comparison of the suggested SMs with current SMs is also made to assess the proposed work’s reliability. Since symmetric triangular fuzzy numbers are quite useful in database acquisition, we will consider the proposed SM for symmetric T-spherical triangular fuzzy numbers in the near future.

1. Introduction

Zadeh [1] conceived the concept of fuzzy sets (FSs) in 1965. In FSs, a function of memberships on a scale of { 0 , 1 } was used to show the degree of membership (DM) of an element in a set with the degree of non-membership (DNM) calculated by subtracting DM from 1, i.e., D N M = 1 D M . Later, Atanassov [2] refined the concept from FSs to intuitionistic fuzzy sets (IFSs) which define DM and DNM separately, but have their full scope in the range of { 0 ,   1 } , i.e., D M + D N M [ 0 ,   1 ] . Atanassov’s model of IFSs also has significant limitations, as the sum of DM and DNM might sometimes surpass the range of { 0 ,   1 } . As a result, Yager [3] developed Pythagorean FSs (PyFSs) by expanding the space of IFSs with a flexible constraint, i.e., D M 2 + D N M 2 [ 0 ,   1 ] . Yager [4] also introduced the concept of q-Rung Orthopair FSs (q-ROFSs). In q-ROFSs, the sum of qth power of DM and qth power of DNM is equal to or less than 1, i.e., D M q + D N M q [ 0 ,   1 ] .
Although Atanassov’s IFSs model revealed Zadeh’s notion of FSs, there exist some scenarios where there are more than two options including the degree of abstinence (DA) and degree of refusal (DR). In this case, IFSs failed to comment on these uncertainties. By considering all these shortcomings of IFSs, Cuong [5] devised picture FSs (PFSs) which have three membership functions represented by DM, DA, and DNM with a restriction that their total should lie in the range of { 0 ,   1 } , i.e., D M + D A + D N M [ 0 ,   1 ] . The term ( 1 ( D M + D A + D N M ) ) was referred to as the DR of an element of a PFS. Some recent studies on PFSs can be found in [6,7]. PFSs broadened the scope of FSs and IFSs, but there are still constraints, and we cannot assign DM, DA, and DNM independently. Mahmood et al. [8] proposed the idea of spherical fuzzy sets (SFSs) as a modification of PFSs by enhancing the range of PFSs by realizing the structures of FSs, IFSs, and PFSs. Similarly, the sum of DM, DA, and DNM may be more than the unit interval in the structure of SFSs, and their squares must fall within the unit interval which is defined as D M 2 + D A 2 + D N M 2 [ 0 ,   1 ] . SFSs have a wider range than PFSs due to their new restriction. However, even squaring is not enough as the squared sum of DM, DA, and DNM exceeds the unit interval, i.e.,   D M 2 + D A 2 + D N M 2 > 1 . To deal with this kind of situation, Mahmood et al. [8] also presented a modification of SFSs which was known as T-spherical FSs (TSFSs). TSFSs have the condition that D M n + D A n + D N M n [ 0 ,   1 ] where n + . We see that TSFSs are a more generic version of IFSs, PFSs, and SFSs. Some recent work on SFSs and TSFSs can be found in [9,10,11].
Similarity measures (SMs) are used to assess the degree of similarity between different items or phenomena on a scale of zero to one. SMs had been discussed on FSs since Zadeh [1] introduced FSs. For example, Chen et al. [12] proposed the comparison of SMs of fuzzy values in which they use fuzzy values to compare the attributes of several SMs. Yang et al. [13] considered similarity measures between fuzzy numbers and then applied them to database acquisition. Since Atanassov [2] proposed IFSs as a generalization of FSs, despite the introduction of many SMs for FSs, they were unable to solve problems when placed in an IFS environment. As a result, Dengfeng and Chuntian [14] proposed new SMs on IFSs that can cope with the problems given in the environment of IFSs. Liang and Shi [15] presented a new SM on IFSs based on the fact that the previously defined SMs are not useful in some situations. Li et al. [16] evaluated and summarized known SMs between IFSs and intuitionistic vague sets (IVSs). The benefits of each SM are explored as well as the circumstances in which they may or may not operate as intended. For IFSs induced by the Jaccard index, Hwang et al. [17] developed a novel SM. They demonstrate that the recommended SMs are more logical than the alternatives using numerical examples. By expanding the space of IFSs with a flexible constraint, Yager [3] established PyFSs. To cope with the data given in the PyFSs environment, SMs for PyFSs were also introduced. Wei and Wei [18] presented 10 SMs between PyFSs based on the cosine function with applications to medical diagnosis. Zeng et al. [19] proposed distance and SMs of PyFSs and used them in multiple criteria group decision making. Peng and Garg [20] proposed multiparametric SMs between PyFSs and they were put to the test by applying them to pattern recognition problems. Based on the Hausdorff metric, Hussain and Yang [21] presented distances and SMs of PyFSs and then gave a fuzzy TOPSIS. Concerning SMs for q-ROFSs, PFSs, and SFSs, Wang et al. [22] gave the SMs of q-ROFSs based on cosine functions.
Wei [23] considered SMs for PFSs and then used them to recognize construction materials and mineral fields. SMs for SFS based cosine function were proposed by Mahmood et al. [24] with applications in pattern recognition and medical diagnosis. Rafiq et al. [25] proposed the cosine SM of SFSs and offered a number of numerical decision-making applications to test the proposed SM’s correctness. After Mahmood et al. [8] presented the concept of TSFSs, which is the extension of FSs, IFSs, PFSs, and SFSs, Ullah et al. [26] proposed SMs for TSFSs with pattern recognition applications. Ye [27] proposed SMs based on the modified distance of neutrosophic Z-number sets and a multi-attribute decision-making technique. For pattern recognition and medical diagnostics, Mahmood et al. [28] suggested hybrid vector similarity metrics based on complex hesitant fuzzy sets. Power aggregation techniques and SMs based on improved intuitionistic hesitant fuzzy sets were suggested by Mahmood et al. [29], as well as their applicability to multiple attribute decision making. Chinram et al. [30] suggested and used a series of novel cosine SMs based on hesitant complex fuzzy sets. Mahmood et al. [31] introduced Jaccard and dice SMs and their applications based on complicated dual hesitant fuzzy sets that are one-of-a-kind.
Although Ullah et al. [26] had proposed SMs for TSFSs, we shall establish a new SM for TSFSs in this paper so that it can be a generalized form of PFSs as done in the previously proposed SMs by Luo and Zhang [32]. We begin by reviewing previously defined SMs for PFSs and observe their limitations when it comes to their applicability. The main reason to develop a new SM was the fact that TSFSs provide a flexible and larger range for data representation under uncertain circumstances. To check the effectiveness of the proposed SMs we provide an example of a pattern recognition system with its application for decision-making. It can also be determined which example is more suitable and effective by having a comparative study of both examples with the previously defined SMs. The followings are the major contributions of this paper:
  • To view/observe the limitations of the previous SMs because of their applicability.
  • To propose a new SM with flexibility in the environment of TSFSs.
  • To check the validity of the proposed SM using some results.
  • To apply the proposed SM in pattern recognition and decision making.
  • To compare the proposed work with previous works by a comparative analysis where the efficacy of the suggested SM is discussed.
The rest of the paper is organized as follows. In Section 2, we go over some key TSFS concepts. A new SM for TSFSs is proposed in Section 3. In Section 4, the suggested SM is used to recognize patterns in a pattern recognition system as well as to make decisions. In Section 5, we come to a conclusion.

2. Preliminaries

Some SFSs and TSFSs definitions are outlined in this section. Throughout the work, X denotes a universal set.
Definition 1
[8]. A SFS  S on  X is written as:
S = { μ ( ҳ ) ,   η ( ҳ ) ,   v ( ҳ ) : 0 μ 2 ( ҳ ) + η 2 ( ҳ ) + v 2 ( ҳ ) 1 }
such that  μ , η , and  v ranging from  0 to  1 denote the DM, DA, and DNM of  ҳ X , respectively, and  r ( ҳ ) = 1 sum ( μ 2 , η 2 ,   v 2 ) , with  sum ( μ 2 , η 2 ,   v 2 ) = μ 2 + η 2 +   v 2 , is the DR of  ҳ in  S ,   where   ( μ ,   η ,   v ) is considered as a spherical fuzzy number (SFN) for  S .
Definition 2
[8]. A TSFS   S   o n   X is written as:
S = { μ ( ҳ ) ,   η ( ҳ ) ,   v ( ҳ ) : 0 μ n ( ҳ ) + η n ( ҳ ) + v n ( ҳ ) 1 }
such that  μ , η , and  v ranging from  0 to  1 denote the DM, DA, and DNM of  ҳ X , respectively, for  n + , and  r ( ҳ ) = 1 sum ( μ n , η n ,   v n ) n is the DR of  ҳ in  S . ( μ ,   η ,   v ) is considered as a T-spherical fuzzy number (TSFN).
Now, some notions of SMs are comparatively examined. The definitions described in this section provided a base for this work.
Definition 3
[2]. For two IFNs  Á = ( μ Á ,   v Á ) and  B = ( μ B ,   v B ) , an SM is written as:
Ś ( Á ,   B ) = 1 m ї = 1 m μ Á ҳ ї μ B ҳ ї + v Á ҳ ї v B ҳ ї μ Á ҳ ї 2 +   v Á 2 ( ҳ ї ) μ B ҳ ї 2 +   v B ҳ ї 2
Definition 4
[5]. For two PFNs  Á = ( μ Á ,   η Á ,   v Á ) and  B = ( μ B ,   η B ,   v B ) , an SM is written as:
Ś   ( Á ,   B ) = 1 3 ( 2 μ Á μ B + 2 η Á η B + 2 v Á v B + ( 1 η Á v Á ) ( 1 η B v B ) + ( 1 μ Á v Á ) ( 1 μ B v B ) + ( 1 μ Á η Á ) ( 1 μ B η B ) )
Definition 5.
Let  Á = ( μ Á ,   η Á ,   v Á ) and  B = ( μ B ,   η B ,   v B ) be two TSFNs. Then
  • Á B iff μ Á μ B ,   η Á η B ,   v Á v B
  • Á = B iff Á B and B Á
Comparison rules are always crucial in FS theory, especially when it comes to decision-making and other challenges. The comparison criteria enable us to discriminate between two FNs or, in some situations, to assess the strength of a pair connection, i.e., how tightly two variables are linked.
Definition 6
[26]. A SM between two TSFNs  Á = ( μ Á ,   η Á ,   v Á ) and  B = ( μ B ,   η B ,   v B ) is a mapping  Ś ( Á ,   B ) :   TSFNs × TSFNs [ 0 ,   1 ] satisfying the axioms:
( S 1 )   Ś ( Á ,   B ) [ 0 ,   1 ] ;
( S 2 )   Ś ( Á ,   B ) = Ś ( B ,   Á ) ;
( S 3 )   Ś ( Á ,   B ) = 1 iff Á = B ;
( S 4 )  Let  Ҫ  be any TSFN(X), if  Á B Ҫ , then  Ś ( Á , Ҫ ) Ś ( Á , B )  and  Ś ( Á , Ҫ ) Ś ( B , Ҫ ) .

3. A New Similarity Measure between T-Spherical Fuzzy Sets

The proposed SM for TSFSs takes DM, DA, and DNM into account in which the DM is represented by μ , the DA is represented by η , and the DNM is represented by v . Furthermore, the RD is represented by r in this section. Let Á   = ( μ Á ,   η Á ,   v Á ) be a T spherical fuzzy number (TSFN) where μ Á ,   η Á ,   v Á   ϵ   [ 0 ,   1 ]   with   μ Á n + η Á n + v Á n 1 .
Proposition 1.
Let  Á = ( μ Á ,   η Á ,   v Á ) and  B = ( μ B ,   η B ,   v B ) be two TSFNs. Then, a mapping  Ś ( Á ,   B ) :   TSFNs × TSFNs [ 0 ,   1 ] is defined as
Ś   ( Á ,   B ) = 1 3 ( 2 μ Á n μ B n + 2 η Á n η B n + 2 v Á n v B n + ( 1 η Á n v Á n ) ( 1 η B n v B n ) + ( 1 μ Á n v Á n ) ( 1 μ B n v B n ) + ( 1 μ Á n η Á n ) ( 1 μ B n η B n ) )
is a SM for the TSFNs  Á and  B .
Remark 1
. In Proposition 1, let  Á = ( μ Á ,   η Á ,   v Á ) and  B = ( μ B ,   η B ,   v B ) be TSFNs. For the TSFN Á , μ Á can be equal to an arbitrary value in  [ μ Á ,   μ Á +   ρ Á ] , η Á can be equal to an arbitrary value in  [ η Á ,   η Á +   ρ Á ] , and  v Á can be equal to an arbitrary value in  [ v Á ,   v Á +   ρ Á ] , where  r Á = 1 μ Á n   η Á n   v Á n n . Similarly, μ B can be equal to an arbitrary value in  [ μ B ,   μ B +   ρ B ] , η B can be equal to an arbitrary value in  [ η B ,   η B +   ρ B ] , and  v B can be equal to an arbitrary value in  [ v B ,   v B +   ρ B ] , where  r B = 1 μ B n   η B n   v B n n . Hence in Equation (1), μ Á n μ B n , η Á n η B n and  v Á n v B n represent the operations on the left endpoint of the interval of  μ Á   ,   μ B and  η Á   ,   η B and  v Á   ,   v B , respectively. Furthermore,  ( 1 μ Á n v Á n ) ( 1 μ B n v B n )   , ( 1 μ Á n η Á n ) ( 1 μ B n η B n ) and  ( 1 η Á n v Á n ) ( 1 η B n v B n ) represent the operations on the right endpoint of the interval of  μ Á   ,   μ B and  η Á   ,   η B and  v Á   ,   v B , respectively.
Proof of Proposition 1.
Let Á = { ( μ Á ,   η Á ,   v Á ) } , B = { ( μ B ,   η B ,   v B ) } , and Ҫ = { ( μ Ҫ ,   η Ҫ ,   v Ҫ ) } be three TSFNs.
( S 1 )   0     ҳ   ҳ + 2 , for each ҳ , [ 0 , + ) . We have
0     2 μ Á n μ B n + 2 η Á n η B n + 2 v Á n v B n + ( 1 η Á n v Á n ) ( 1 η B n v B n ) + ( 1 μ Á n v Á n ) ( 1 μ B n v B n ) + ( 1 μ Á n η Á n ) ( 1 μ B n η B n )   2 . μ Á n + μ B n 2 + 2 .   η Á n + η B n 2 + 2 .   v Á n + v B n 2 + ( 1 η Á n v Á n ) + ( 1 η B n v B n ) 2 + ( 1 μ Á n v Á n ) + ( 1 μ B n v B n ) 2 + ( 1 μ Á n η Á n ) ( 1 μ B n η B n ) 2 = 3
Thus, we obtain
0     1 3 2 μ Á n μ B n + 2 η Á n η B n + 2 v Á n v B n + ( 1 η Á n v Á n ) ( 1 η B n v B n ) + ( 1 μ Á n v Á n ) ( 1 μ B n v B n ) + ( 1 μ Á n η Á n ) ( 1 μ B n η B n )     1
From the above analysis, we get 0 Ś ( Á ,   B ) 1 .
( S 2 )   Ś ( Á ,   B ) = Ś ( B ,   Á ) is obvious.
( S 3 )   ҳ achieves ҳ + 2 if ҳ = . Then,
Ś ( Á ,   B ) = 1 .   2 μ Á n μ B n + 2 η Á n η B n + 2 v Á n v B n + ( 1 η Á n v Á n ) ( 1 η B n v B n ) + ( 1 μ Á n v Á n ) ( 1 μ B n v B n ) + ( 1 μ Á n η Á n ) ( 1 μ B n η B n ) = 3   μ Á n = μ B n   ,   η Á n = η B n   ,   v Á n = v B n ( 1 η Á n v Á n ) = ( 1 η B n v B n ) ( 1 μ Á n v Á n ) = ( 1 μ B n v B n ) ( 1 μ Á n η Á n ) = ( 1 μ B n η B n ) Á = B
From the above analysis, we get Ś ( Á ,   B ) = 1 iff Á = B .
( S 4 ) Let Á ,   B ,   Ҫ be three TSFNs that fulfills the criteria   Á B Ҫ . Therefore, we have 0     μ Á     μ B   μ Ҫ     1 , 0     η Á     η B     η Ҫ     1 , and 0     v Ҫ     v B     v Á     1 . According to Equation (1), we obtain the SMs as follows:
Ś ( B ,   Ҫ ) = 1 3 ( 2 μ B n μ Ҫ n + 2 η B n η Ҫ n + 2 v B n v Ҫ n + ( 1 η B n v B n ) ( 1 η Ҫ n v Ҫ n ) + ( 1 μ B n v Ҫ n ) ( 1 μ Ҫ n v Ҫ n ) + ( 1 μ B n η B n ) ( 1 μ Ҫ n η Ҫ n ) ) Ś ( Á ,   Ҫ ) = 1 3 ( 2 μ Á n μ Ҫ n + 2 η Á n η Ҫ n + 2 v Á n v Ҫ n + ( 1 η Á n v Á n ) ( 1 η Ҫ n v Ҫ n ) + ( 1 μ Á n v Á n ) ( 1 μ Ҫ n v Ҫ n ) + ( 1 μ Á n η Á n ) ( 1 μ Ҫ n η Ҫ n ) ) Ś ( Á ,   B ) = 1 3 ( 2 μ Á n μ B n + 2 η Á n η B n + 2 v Á n v B n + ( 1 η Á n v Á n ) ( 1 η B n v B n ) + ( 1 μ Á n v Á n ) ( 1 μ B n v B n ) + ( 1 μ Á n η Á n ) ( 1 μ B n η B n ) )
For ã ,   Ь ,   ç ,   [ 0 ,   1 ] , ã   +   Ь   +   ç     1 , ҳ , ,   ż     [ 0 ,   1 ] , ҳ + +   ż     [ 0 ,   1 ] , then
f ( ҳ , ,   ż ) = 2 ã ҳ + 2 Ь + 2 ç ż + ( 1 ż ) ( 1 Ь ç ) + ( 1 ҳ ż ) ( 1 ã ç ) + ( 1 ҳ ) ( 1 ã Ь )
We can obtain
f ҳ = ã ҳ 1 ã ç 2 1 ҳ ż 1 ã Ь 2 1 ҳ f ҳ = ã 2 ҳ 1 ã ç 2 1 ҳ ż + ã 2 ҳ 1 ã Ь 2 1 ҳ f ҳ = ã ( 1 ż ) ҳ ( 1 ç ) 2 ҳ ( 1 ҳ ż ) ( ã ( 1 ҳ ż ) + ҳ ( 1 ã ç ) ) + ã ( 1 ) ҳ ( 1 Ь ) 2 ҳ ( 1 ҳ ) ( ã ( 1 ҳ ) + ҳ ( 1 ã Ь ) ) | f ҳ | = Ь ż = ç = ( ã ҳ ) ( 1 ç ) 2 ҳ ( 1 ҳ ç ) ( ã ( 1 ҳ ç ) + ҳ ( 1 ã ç ) ) + ( ã ҳ ) ( 1 Ь ) 2 ҳ ( 1 ҳ Ь ) ( ã ( 1 ҳ Ь ) + ҳ ( 1 ã Ь ) ) f = Ь 1 Ь ç 2 1 ż 1 ã Ь 2 1 ҳ f = Ь 2 1 Ь ç 2 1 ż + Ь 2 1 ã Ь 2 1 ҳ f = Ь ( 1 ż ) ( 1 ç ) 2 ( 1 ż ) ( Ь ( 1 ż ) + ( 1 Ь ç ) ) + Ь ( 1 ҳ ) ( 1 ã ) 2 ( 1 ҳ ) ( Ь ( 1 ҳ ) + ( 1 ã Ь ) ) | f | ҳ = ã ż = ç = ( Ь ) ( 1 ç ) 2 ( 1 ç ) ( Ь ( 1 ç ) + ( 1 Ь ç ) ) + ( Ь ) ( 1 ã ) 2 ( 1 Ь ) ( Ь ( 1 ã ) + ( 1 ã Ь ) )
and
f ż = ç ż 1 Ь ç 2 1 ż 1 ã ç 2 1 ҳ ż f ż = ç 2 ż 1 Ь ç 2 1 ż + ç 2 ż 1 ã ç 2 1 ҳ ż f ż = ç ( 1 ) ż ( 1 Ь ) 2 ż ( 1 ż ) ( ç ( 1 ż ) + ż ( 1 Ь ç ) ) + ç ( 1 ҳ ) ż ( 1 ã ) 2 ż ( 1 ҳ ż ) ( ç ( 1 ҳ ż ) + ż ( 1 ã ç ) ) | f ż | ҳ = ã = Ь = ( ç ż ) ( 1 Ь ) 2 ż ( 1 Ь ż ) ( ç ( 1 ż Ь ) + ż ( 1 Ь ç ) ) + ( ç ż ) ( 1 ã ) 2 ż ( 1 ż ã ) ( ç ( 1 ż ã ) + ż ( 1 ã ç ) )
For ã     ҳ     1 , we have f / ҳ     0 , which shows that f is a reducing function of ҳ , when = Ь , ż   =   ç , ҳ     ã . For 0     ҳ     ã , we have f / ҳ     0 , which means that f is a growing function of ҳ , when =   Ь , ż   =   ç , ҳ <   ã .
Similarly, we may get f / 0 for Ь   1 . It indicates that f is a reducing function of when ҳ = ã , ż = ç , Ь . We have f / 0 for 0 < Ь and it indicates that f is an increasing function of when ҳ = ã , ż = ç , < Ь . Since f / ż 0 for ç ż 1 , it indicates that f is a reducing function of ż when ҳ = ã , = Ь , ż ç . We have f / ż 0 for 0 ż < ç which indicates that f is a growing function of ż when ҳ = ã , = Ь , ż < ç .
Let ã = μ Á , Ь = η Á , ç = v Á , with two TSFNs ( μ B ,   η B ,   v B ) and ( μ Ҫ ,   η Ҫ ,   v Ҫ ) , satisfying:
ã = μ Á μ B μ Ҫ Ь = η Á η B η Ҫ ç = v Ҫ v B v Á
we can obtain
f ( μ Ҫ ,   Ь ,   ç ) f ( μ B ,   Ь ,   ç ) f ( ã ,   Ь ,   ç ) f ( ã ,   η Ҫ ,   ç ) f ( ã ,   η B ,   ç ) f ( ã ,   Ь ,   ç ) f ( ã ,   Ь ,   v Ҫ ) f ( ã ,   Ь ,   v B ) f ( ã ,   Ь ,   ç )
and then
f   ( μ Ҫ ,   η Ҫ ,   v Ҫ ) f ( μ B ,   η B ,   v B )
i.e.,
2 μ B n μ Ҫ n + 2 η B n η Ҫ n + 2 v B n v Ҫ n + ( 1 η B n v B n ) ( 1 η Ҫ n v Ҫ n ) + ( 1 μ B n v Ҫ n ) ( 1 μ Ҫ n v Ҫ n ) + ( 1 μ B n η B n ) ( 1 μ Ҫ n η Ҫ n ) 2 μ Á n μ B n + 2 η Á n η B n + 2 v Á n v B n + ( 1 η Á n v Á n ) ( 1 η B n v B n ) + ( 1 μ Á n v Á n ) ( 1 μ B n v B n ) + ( 1 μ Á n η Á n ) ( 1 μ B n η B n )
Thus, Ś ( Á ,   Ҫ ) Ś ( Á ,   B ) according to the above analysis.
Similarly, if we suppose ã = μ Ҫ , Ь = η Ҫ , ç = v Ҫ , and the two TSFNs ( μ Á ,   η Á ,   v Á )   and   ( μ B ,   η B ,   v B ) satisfy:
ã = μ Á μ B μ Ҫ Ь = η Á η B η Ҫ ç = v Ҫ v B v Á
we can obtain
f ( μ Á ,   Ь ,   ç )   f ( μ B ,   Ь ,   ç ) f ( ã ,   Ь ,   ç ) f ( ã ,   η Á ,   ç ) f ( ã ,   η B ,   ç ) f ( ã ,   Ь ,   ç ) f ( ã ,   Ь ,   v Á ) f ( ã ,   Ь ,   v B )   f ( ã ,   Ь ,   ç )
and then
f ( μ Á ,   η Á ,   v Á ) f ( μ B ,   η B ,   v B )
i.e.,
2 μ Á n μ Ҫ n + 2 η Á n η Ҫ n + 2 v Á n v Ҫ n + ( 1 η Á n v Á n ) ( 1 η Ҫ n v Ҫ n ) + ( 1 μ Á n v Á n ) ( 1 μ Ҫ n v Ҫ n ) + ( 1 μ Á n η Á n ) ( 1 μ Ҫ n η Ҫ n ) 2 μ B n μ Ҫ n + 2 η B n η Ҫ n + 2 v B n v Ҫ n + ( 1 η B n v B n ) ( 1 η Ҫ n v Ҫ n ) + ( 1 μ B n v Ҫ n ) ( 1 μ Ҫ n v Ҫ n ) + ( 1 μ B n η B n ) ( 1 μ Ҫ n η Ҫ n ) .
Thus, Ś ( Á ,   Ҫ ) Ś ( B ,   Ҫ ) based on the preceding analysis. The SM Ś ( Á ,   B ) with Equation (1) satisfies Definition 6.
Theorem 3.
Let  Á = { ( μ Á ҳ ї ,   η Á ҳ ї ,   v Á ҳ ї ) | ҳ ї X } , B = { ( μ B ҳ ї ,   η B ҳ ї ,   v B ҳ ї ) | ҳ ї X } be two TSFSs on  X = { ҳ 1 ,   ҳ 2 ,   , ҳ n } . The mapping  Ś ( Á ,   B ) :   TSFS ( X ) × TSFS ( X ) [ 0 ,   1 ] is defined as follows:
Ś   ( Á ,   B ) = 1 3 n ї = 1 n ( 2 μ Á ҳ ї n μ B ҳ ї n + 2 η Á ҳ ї n η B ҳ ї n + 2 v Á ҳ ї n v B ҳ ї n + ( 1 η Á ҳ ї n v Á ҳ ї n ) ( 1 η B ҳ ї n v B ҳ ї n ) + ( 1 μ Á ҳ ї n v Á ҳ ї n ) ( 1 μ B ҳ ї n v B ҳ ї n ) + ( 1 μ Á ҳ ї n η Á ҳ ї n ) ( 1 μ B ҳ ї n η B ҳ ї n ) ) .
Then, Ś ( Á ,   B ) is a SM for the TSFSs Á and B .
Proof of Theorem 3.
Let Á = { ( μ Á ҳ ї ,   η Á ҳ ї ,   v Á ҳ ї ) | ҳ ї X } , B = { ( μ B ҳ ї ,   η B ҳ ї ,   v B ҳ ї ) | ҳ ї X } and Ҫ = { ( μ Ҫ ҳ ї ,   η Ҫ ҳ ї ,   v Ҫ ҳ ї ) | ҳ ї X } be the three TSFSs on X = { ҳ 1 ,   ҳ 2 ,   , ҳ n } .
( S 1 )   0 ҳ ҳ + 2 , for each ҳ ,   [ 0 , + ) . We have
0     2 μ Á ҳ ї n μ B ҳ ї n + 2 η Á ҳ ї n η B ҳ ї n + 2 v Á ҳ ї n v B ҳ ї n + ( 1 η Á ҳ ї n v Á ҳ ї n ) ( 1 η B ҳ ї n v B ҳ ї n ) + ( 1 μ Á ҳ ї n v Á ҳ ї n ) ( 1 μ B ҳ ї n v B ҳ ї n ) + ( 1 μ Á ҳ ї n η Á ҳ ї n ) ( 1 μ B ҳ ї n η B ҳ ї n )   2 . μ Á ҳ ї n + μ B ҳ ї n 2 + 2 .   η Á ҳ ї n + η B ҳ ї n 2 + 2 .   v Á ҳ ї n + v B ҳ ї n 2 + ( 1 μ Á ҳ ї n v Á ҳ ї n ) + ( 1 μ B ҳ ї n v B ҳ ї n ) 2 + ( 1 μ Á ҳ ї n v Á ҳ ї n ) + ( 1 μ B ҳ ї n v B ҳ ї n ) 2 + ( 1 μ Á ҳ ї n η Á ҳ ї n ) + ( 1 μ B ҳ ї n η B ҳ ї n ) 2 = 3
Thus, we can obtain
0 1 3 n ї = 1 n ( 2 μ Á ҳ ї n μ B ҳ ї n + 2 η Á ҳ ї n η B ҳ ї n + 2 v Á ҳ ї n v B ҳ ї n + ( 1 η Á ҳ ї n v Á ҳ ї n ) ( 1 η B ҳ ї n v B ҳ ї n ) + ( 1 μ Á ҳ ї n v Á ҳ ї n ) ( 1 μ B ҳ ї n v B ҳ ї n ) + ( 1 μ Á ҳ ї n η Á ҳ ї n ) ( 1 μ B ҳ ї n η B ҳ ї n ) ) 1 .
From the above analysis, we get 0 Ś ( Á ,   B ) 1 .
( S 2 )   Ś ( Á ,   B ) = Ś ( B ,   Á ) is obvious.
( S 3 )   ҳ achieves ҳ + 2 if ҳ = . Then
Ś ( Á ,   B ) = 1     2 μ Á ҳ ї n μ B ҳ ї n + 2 η Á ҳ ї n η B ҳ ї n + 2 v Á ҳ ї n v B ҳ ї n + ( 1 η Á ҳ ї n v Á ҳ ї n ) ( 1 η B ҳ ї n v B ҳ ї n ) + ( 1 μ Á ҳ ї n v Á ҳ ї n ) ( 1 μ B ҳ ї n v B ҳ ї n ) + ( 1 μ Á ҳ ї n η Á ҳ ї n ) ( 1 μ B ҳ ї n η B ҳ ї n ) = 3     μ Á ҳ ї = μ B ҳ ї   ,   η Á ҳ ї = η B ҳ ї   ,   v Á ҳ ї = v B ҳ ї ( 1 η Á ҳ ї v Á ҳ ї ) = ( 1 η B ҳ ї v B ҳ ї ) ( 1 μ Á ҳ ї v Á ҳ ї ) = ( 1 μ B ҳ ї v B ҳ ї ) ( 1 μ Á ҳ ї η Á ҳ ї ) = ( 1 μ B ҳ ї η B ҳ ї ) Á = B .
Therefore, Ś ( Á ,   B ) = 1  iff  Á = B .
Ś   ( Á ,   B ) = 1 3 n ї = 1 n ( 2 μ Á ҳ ї n μ B ҳ ї n + 2 η Á ҳ ї n η B ҳ ї n + 2 v Á ҳ ї n v B ҳ ї n + ( 1 η Á ҳ ї n v Á ҳ ї n ) ( 1 η B ҳ ї n v B ҳ ї n ) + ( 1 μ Á ҳ ї n v Á ҳ ї n ) ( 1 μ B ҳ ї n v B ҳ ї n ) + ( 1 μ Á ҳ ї n η Á ҳ ї n ) ( 1 μ B ҳ ї n η B ҳ ї n ) ) Ś   ( B ,   Ҫ ) = 1 3 n ї = 1 n ( 2 μ B ҳ ї n μ Ҫ ҳ ї n + 2 η B ҳ ї n η Ҫ ҳ ї n + 2 v B ҳ ї n v Ҫ ҳ ї n + ( 1 η B ҳ ї n v B ҳ ї n ) ( 1 η Ҫ ҳ ї n v Ҫ ҳ ї n ) + ( 1 μ B ҳ ї n v B ҳ ї n ) ( 1 μ Ҫ ҳ ї n v Ҫ ҳ ї n ) + ( 1 μ B ҳ ї n η B ҳ ї n ) ( 1 μ Ҫ ҳ ї n η Ҫ ҳ ї n ) ) Ś   ( Á ,   Ҫ ) = 1 3 n ї = 1 n ( 2 μ Á ҳ ї n μ Ҫ ҳ ї n + 2 η Á ҳ ї n η Ҫ ҳ ї n + 2 v Á ҳ ї n v Ҫ ҳ ї n + ( 1 η Á ҳ ї n v Á ҳ ї n ) ( 1 η Ҫ ҳ ї n v Ҫ ҳ ї n ) + ( 1 μ Á ҳ ї n v Á ҳ ї n ) ( 1 μ Ҫ ҳ ї n v Ҫ ҳ ї n ) + ( 1 μ Á ҳ ї n η Á ҳ ї n ) ( 1 μ Ҫ ҳ ї n η Ҫ ҳ ї n ) ) .
This proof is similar to Proposition 1. We can get Ś ( Á ,   Ҫ ) Ś ( Á ,   B ) , Ś ( Á ,   Ҫ ) Ś ( B ,   Ҫ ) according to the above analysis, and thus, SM Ś ( Á ,   B ) with Equation (2) fulfills the criteria of Definition 6. □

4. Consequences of the Proposed Work

In the previous Section 3, we proposed a new SM for TSFNs Á = ( μ Á ,   η Á ,   v Á ) and B = ( μ B ,   η B ,   v B ) , and also another SM for TSFSs Á = { ( μ Á ҳ ї ,   η Á ҳ ї ,   v Á ҳ ї ) | ҳ ї X } , and B = { ( μ B ҳ ї ,   η B ҳ ї ,   v B ҳ ї ) | ҳ ї X } on X = { ҳ 1 ,   ҳ 2 ,   , ҳ n } . Since the proposed SMs for TSFNs and TSFSs can be the generalizations of some SMs, we will present some consequences of the proposed SMs under some special cases in this section.
Recall that the proposed SM of Equation (1) for TSFNs Á = ( μ Á ,   η Á ,   v Á ) and B = ( μ B ,   η B ,   v B )   is as follows:
Ś ( Á ,   B ) = 1 3 ( 2 μ Á n μ B n + 2 η Á n η B n + 2 v Á n v B n + ( 1 η Á n v Á n ) ( 1 η B n v B n ) + ( 1 μ Á n v Á n ) ( 1 μ B n v B n ) + ( 1 μ Á n η Á n ) ( 1 μ B n η B n ) )
  • If we replace n = 2 in the proposed SM, then SM for SFSs is obtained and given as:
Ś   ( Á ,   B ) = 1 3 ( 2 μ Á 2 μ B 2 + 2 η Á 2 η B 2 + 2 v Á 2 v B 2 + ( 1 η Á 2 v Á 2 ) ( 1 η B 2 v B 2 ) + ( 1 μ Á 2 v Á 2 ) ( 1 μ B 2 v B 2 ) + ( 1 μ Á 2 η Á 2 ) ( 1 μ B 2 η B 2 ) ) .
  • If we replace n = 1 in the proposed SM, then the SM for PFSs is obtained and given as:
Ś   ( Á ,   B ) = 1 3 ( 2 μ Á μ B + 2 η Á η B + 2 v Á v B + ( 1 η Á v Á ) ( 1 η B v B ) + ( 1 μ Á v Á ) ( 1 μ B v B ) + ( 1 μ Á η Á ) ( 1 μ B η B ) ) .
  • If we neglect the DA in the proposed SM, then the SM for q-ROFSs is obtained and given as:
Ś   ( Á ,   B ) = 1 3 ( 2 μ Á n μ B n + 2 v Á n v B n + ( 1 v Á n ) ( 1 v B n ) + ( 1 μ Á n v Á n ) ( 1 μ B n v B n ) + ( 1 μ Á n ) ( 1 μ B n ) ) .
  • If we replace n = 2 and neglect the DA in the proposed SM, then the SM for PyFSs is obtained and given as:
Ś   ( Á ,   B ) = 1 3 ( 2 μ Á 2 μ B 2 + 2 v Á 2 v B 2 + ( 1 v Á 2 ) ( 1 v B 2 ) + ( 1 μ Á 2 v Á 2 ) ( 1 μ B 2 v B 2 ) + ( 1 μ Á 2 ) ( 1 μ B 2 ) ) .
  • If we replace n = 1 and neglect the DA in the proposed SM, then the SM for IFSs is obtained and given as:
Ś   ( Á ,   B ) = 1 3 ( 2 μ Á μ B + 2 v Á v B + ( 1 v Á ) ( 1 v B ) + ( 1 μ Á v Á ) ( 1 μ B v B ) + ( 1 μ Á ) ( 1 μ B ) ) .
Based on the preceding findings, we conclude that the proposed SMs can obtain some new SMs for IFSs, PyFSs, PFSs, and SFSs. The major goal of the SMs presented in this work is that they can solve problems when the data is provided in the TSF environment.

5. Applications and Algorithm

In this section, we create an algorithm for pattern recognition based on the proposed SMs to find out which pattern is the best to use. We also discuss the application of the proposed SMs in decision-making to sketch out which alternative is the finest for making a decision.

5.1. Algorithm for Pattern Recognition

Let X = { ҳ 1 , ҳ 2 , , ҳ n } , and let us have m patterns P j = { ( μ Pj ( ҳ ї ) ,   η Pj ( ҳ ї ) , v Pj ( ҳ ї ) ) | ҳ ї X } ,   j = 1 , 2 , 3 , , m , and a test sample P = { ( μ p ( ҳ ї ) ,   η p ( ҳ ї ) , v p ( ҳ ї ) ) | ҳ ї X } . To check which pattern of P j , j = 1 , 2 , 3 , , m will mostly match the pattern P , we give the following recognition steps:
Step 1. We calculate the SMs Ś ( P j ,   P ) ,   j = 1 , 2 , 3 , , m between P j and P .
Step 2. We have to choose the maximum one Ś ( P j 0 ,   P )   from Ś ( P j ,   P ) , j = 1 , 2 , 3 , , m , i.e., Ś ( P j 0 ,   P ) = max 1 j m { Ś ( P j ,   P ) } . Then, the sample P is classified to the pattern P j 0 by the maximum principle of SMs.
Example 1.
We use the proposed SMs to solve the building material recognition challenge in Ullah et al. [26]. Consider TSFNs  P ї ( ї = 1 , 2 , 3 , 4 )  which represent four types of construction materials. Let us consider  X = { ҳ ї : ї = 1 , 2 , 3 , , 7 }  to be the attributes. We have another unknown material P . Using the proposed SMs for TSFNs and TSFSs , we use four materials to determine the class of an unknown material denoted by  P ї ( ї = 1 , 2 , 3 , 4 ) . Now we have to evaluate class  P ї to P .
Step 1. All the data are in the form of TSFNs given in Table 1. Assume that given values are TSFNs for n = 4 ; in Table 1, this indicates that when data is presented in the TSF environment, neither IFSs nor PFSs tools can resolve this issue.
Step 2. In this step, we apply Equation (1) on the information given in Table 1. The results using the SM for TSFNs are given in Table 2.
Step 3. Analyzing Table 2, we conclude that
( P 4 ,   P ) < ( P 1 ,   P ) < ( P 3 ,   P ) < ( P 2 ,   P )
As a result, the material P 2 is nearest to P because the SM of ( P 2 ,   P ) is greater than all the other pairs. Consequently, it is concluded that the unidentified material P corresponds to the P 2 category of material. The results of Table 2 are also portrayed in Figure 1 where it shows that the unknown pattern P is closed to P 2 . The results also show that the unknown pattern P is still sufficiently close to the pattern P 3 as well.

5.2. Comparative Study

In this section, we make comparisons of the results using the proposed SM for TSFSs with the results using the SM for TSFSs proposed by Ullah et al. [26] and Wu et al. [33]. Table 3 summarizes the findings. We find that the results using the proposed SM for TSFSs are the same as the results using the SM for TSFSs proposed by Wu et al. [33]. Here, we also show the limited nature of IFSs and PFSs. A brief comparison of the current paper’s aggregated results with those of other previous papers is provided in Table 3.

5.3. Applications for Decision Making

Now we will discuss how the proposed SM can be used to make decisions. The bigger the SM, according to the SM principle, the more correct the decision.
Example 2.
We use the proposed SM to solve the decision-making challenge proposed in Ullah et al. [34]. Islamabad, Pakistan’s capital, is regarded as one of the most beautiful cities in the world. There are various parks and picnic areas in Islamabad where a large number of people visit on a daily basis. The Metropolitan Corporation of Islamabad (MCI) is in charge of the city government. To maintain its appeal, the MCI decided to restore all of the parks and picnic areas. MCI will need to recruit some private contractors to do so. MCI chose four private firms for further consideration after some preliminary screening. Á 1 : Arish Associates, Á 2 : Nauman Estate and Builders, Á 3 : Areva Engineering, Construction and Interiors, and Á 4 : The Wow Architects, are among the four firms. MCI’s specialists devised five point criteria for selecting the best corporation or company. Ҫ 1 : Cost, Ҫ 2 : Previous performance, Ҫ 3 : Time constraint, Ҫ 4 : Quality assurance, and Ҫ 5 : Labor quantity, are the five criteria. The decision-making panel has given all the information in TSFNs which is given in Table 3. The followings are the designated steps for the decision-making algorithm:
Step 1. Decision-makers’ views are expressed in the form of TSFNs, as indicated in Table 4.
Step 2. The SM of each TSFN given in Table 4 are evaluated with Ҫ ( 1 , 0 , 0 ) based on Equation (1). Table 5 summarizes the findings.
Step 3. Analyzing Table 5, we obtain
Á 2 < Á 1 < Á 3 < Á 4 .
Therefore, Á 4 is the best choice. The results of Table 5 are also shown in Figure 2 which indicates that, after applying the proposed SM, Á 4 should be the best choice.
The findings of the proposed SM for TSFSs are then compared to the results of the SMs for TSFSs proposed by Ullah et al. [34]. Table 6 summarizes the findings. We find that both methods give the same decision.

6. Conclusions

In this paper, a new SM was presented for TSFSs which is based on DM, DA, and DNM. We had shown that the proposed SM for TSFSs satisfies the axiom of SM. It was also observed that the proposed SM provides a flexible and larger range for data representation under uncertain circumstances in which it can be a generalized SM for IFSs, PyFSs, PFSs, or SFSs. By using numerical examples, it was shown that the presented SM is more efficient and can provide accurate results as the information under consideration was based on TSFNs where more than two aspects of uncertain information were discussed. In addition, we applied the proposed SM in pattern recognition and decision-making to observe its effectiveness. The comparative studies on pattern recognition and decision making indicate that the proposed SM is valid and can be used in some real-life problems, especially in decision making, pattern recognition, and clustering. In general, symmetric triangular fuzzy numbers can be well used in database acquisition and so our further work shall first consider the proposed SM for symmetric T-spherical triangular fuzzy numbers. In our future works, we will also extend the proposed SM for interval valued TSFSs and complex TSFSs. We shall further develop new distances for TSFSs and give more entropy measures for TSFSs and then apply them in clustering and medical diagnosis problems under TSFSs environment.

Author Contributions

Conceptualization, M.N.A., H.K. and K.U.; methodology, M.N.A., M.-S.Y. and D.P.; validation, M.N.A., M.-S.Y. and K.U.; formal analysis, K.U. and D.P.; investigation, M.-S.Y., H.K. and D.P.; resources, M.N.A. and H.K.; data curation, M.N.A. and K.U.; writing—original draft preparation, M.N.A. and H.K.; writing—review and editing, M.-S.Y. and K.U.; visualization, H.K. and M.-S.Y.; supervision, M.-S.Y. and D.P. All authors have read and agreed to the published version of the manuscript.

Funding

The Ministry of Science and Technology of Taiwan under Grant MOST-110-2118-M-033-003-. Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2022R192), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Atanassov, K.T. Intuitionistic fuzzy set. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  3. Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the 2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), Edmonton, AB, Canada, 24–28 June 2013; pp. 57–61. [Google Scholar]
  4. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2016, 25, 1222–1230. [Google Scholar] [CrossRef]
  5. Cuong, B.C.; Kreinovich, V. Picture fuzzy sets-a new concept for computational intelligence problems. In Proceedings of the 2013 Third World Congress on Information and Communication Technologies (WICT 2013), Hanoi, Vietnam, 15–18 December 2013; pp. 1–6. [Google Scholar]
  6. Ullah, K. Picture fuzzy maclaurin symmetric mean operators and their applications in solving multiattribute decision-making problems. Math. Probl. Eng. 2021, 2021, e1098631. [Google Scholar] [CrossRef]
  7. Liu, P.; Munir, M.; Mahmood, T.; Ullah, K. Some similarity measures for interval-valued picture fuzzy sets and their applications in decision making. Information 2019, 10, 369. [Google Scholar] [CrossRef] [Green Version]
  8. 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]
  9. Akram, M.; Ullah, K.; Pamucar, D. Performance evaluation of solar energy cells using the interval-valued T-spherical fuzzy Bonferroni mean operators. Energies 2022, 15, 292. [Google Scholar] [CrossRef]
  10. Ullah, K.; Mahmood, T.; Garg, H. Evaluation of the performance of search and rescue robots using T-spherical fuzzy Hamacher aggregation operators. Int. J. Fuzzy Syst. 2020, 22, 570–582. [Google Scholar] [CrossRef]
  11. Ali, Z.; Mahmood, T.; Yang, M.S. Complex T-spherical fuzzy aggregation operators with application to multi-attribute decision making. Symmetry 2020, 12, 1311. [Google Scholar] [CrossRef]
  12. Chen, S.-M.; Yeh, M.-S.; Hsiao, P.-Y. A comparison of similarity measures of fuzzy values. Fuzzy Sets Syst. 1995, 72, 79–89. [Google Scholar] [CrossRef]
  13. Yang, M.S.; Hung, W.L.; Chang-Chien, S.J. On a similarity measure between LR-type fuzzy numbers and its application to database acquisition. Int. J. Intell. Syst. 2005, 20, 1001–1016. [Google Scholar] [CrossRef]
  14. Dengfeng, L.; Chuntian, C. New Similarity measures of intuitionistic fuzzy sets and application to pattern recognitions. Pattern Recognit. Lett. 2002, 23, 221–225. [Google Scholar] [CrossRef]
  15. Liang, Z.; Shi, P. Similarity measures on intuitionistic fuzzy sets. Pattern Recognit. Lett. 2003, 24, 2687–2693. [Google Scholar] [CrossRef]
  16. Li, Y.; Olson, D.L.; Qin, Z. Similarity measures between intuitionistic fuzzy (vague) sets: A comparative analysis. Pattern Recognit. Lett. 2007, 28, 278–285. [Google Scholar] [CrossRef]
  17. Hwang, C.-M.; Yang, M.-S.; Hung, W.-L. New similarity measures of intuitionistic fuzzy sets based on the Jaccard index with its application to clustering. Int. J. Intell. Syst. 2018, 33, 1672–1688. [Google Scholar] [CrossRef]
  18. Wei, G.; Wei, Y. Similarity measures of pythagorean fuzzy sets based on the cosine function and their applications. Int. J. Intell. Syst. 2018, 33, 634–652. [Google Scholar] [CrossRef]
  19. Zeng, W.; Li, D.; Yin, Q. Distance and similarity measures of pythagorean fuzzy sets and their applications to multiple criteria group decision making. Int. J. Intell. Syst. 2018, 33, 2236–2254. [Google Scholar] [CrossRef]
  20. Peng, X.; Garg, H. Multiparametric similarity measures on pythagorean fuzzy sets with applications to pattern recognition. Appl. Intell. 2019, 49, 4058–4096. [Google Scholar] [CrossRef]
  21. Hussian, Z.; Yang, M.-S. Distance and similaritymeasures of pythagorean fuzzy sets based on the Hausdorff metric with application to fuzzy TOPSIS. Int. J. Intell. Syst. 2019, 34, 2633–2654. [Google Scholar] [CrossRef]
  22. Wang, P.; Wang, J.; Wei, G.; Wei, C. Similarity measures of q-rung orthopair fuzzy sets based on cosine function and their applications. Mathematics 2019, 7, 340. [Google Scholar] [CrossRef] [Green Version]
  23. Wei, G. Some similarity measures for picture fuzzy sets and their applications. Iran. J. Fuzzy Syst. 2018, 15, 77–89. [Google Scholar]
  24. Mahmood, T.; Ilyas, M.; Ali, Z.; Gumaei, A. Spherical fuzzy sets-based cosine similarity and information measures for pattern recognition and medical diagnosis. IEEE Access 2021, 9, 25835–25842. [Google Scholar] [CrossRef]
  25. Rafiq, M.; Ashraf, S.; Abdullah, S.; Mahmood, T.; Muhammad, S. The cosine similarity measures of spherical fuzzy sets and their applications in decision making. J. Intell. Fuzzy Syst. 2019, 36, 6059–6073. [Google Scholar] [CrossRef]
  26. Ullah, K.; Mahmood, T.; Jan, N. Similarity measures for T-spherical fuzzy sets with applications in pattern recognition. Symmetry 2018, 10, 193. [Google Scholar] [CrossRef] [Green Version]
  27. Ye, J. Similarity measures based on the generalized distance of neutrosophic z-number sets and their multi-attribute decision making method. Soft Comput. 2021, 25, 13975–13985. [Google Scholar] [CrossRef]
  28. Mahmood, T.; Ur Rehman, U.; Ali, Z.; Mahmood, T. Hybrid vector similarity measures based on complex hesitant fuzzy sets and their applications to pattern recognition and medical diagnosis. J. Intell. Fuzzy Syst. 2021, 40, 625–646. [Google Scholar] [CrossRef]
  29. Mahmood, T.; Ali, W.; Ali, Z.; Chinram, R. Power aggregation operators and similarity measures based on improved intuitionistic hesitant fuzzy sets and their applications to multiple attribute decision making. Comput. Modeling Eng. Sci. 2021, 126, 1165–1187. [Google Scholar] [CrossRef]
  30. Chinram, R.; Mahmood, T.; Ur Rehman, U.; Ali, Z.; Iampan, A. Some novel cosine similarity measures based on complex hesitant fuzzy sets and their applications. J. Math. 2021, 2021, 6690728. [Google Scholar] [CrossRef]
  31. Mahmood, T.; Ur Rehman, U.; Ali, Z.; Chinram, R. Jaccard and dice similarity measures based on novel complex dual hesitant fuzzy sets and their applications. Math. Probl. Eng. 2020, 2020, 5920432. [Google Scholar] [CrossRef]
  32. Luo, M.; Zhang, Y. A New similarity measure between picture fuzzy sets and its application. Eng. Appl. Artif. Intell. 2020, 96, 103956. [Google Scholar] [CrossRef]
  33. Wu, M.-Q.; Chen, T.-Y.; Fan, J.-P. Similarity measures of T-spherical fuzzy sets based on the cosine function and their applications in pattern recognition. IEEE Access 2020, 8, 98181–98192. [Google Scholar] [CrossRef]
  34. Ullah, K.; Garg, H.; Mahmood, T.; Jan, N.; Ali, Z. Correlation coefficients for T-spherical fuzzy sets and their applications in clustering and multi-attribute decision making. Soft Comput. 2020, 24, 1647–1659. [Google Scholar] [CrossRef]
Figure 1. Results of SM of unknown pattern with known pattern.
Figure 1. Results of SM of unknown pattern with known pattern.
Symmetry 14 00410 g001
Figure 2. Results of SM for decision making.
Figure 2. Results of SM for decision making.
Symmetry 14 00410 g002
Table 1. Data on building material.
Table 1. Data on building material.
P 1 P 2 P 3 P 4 P
ҳ 1 0.56 0.47 0.22 0.810.30.370.430.430.550.570.510.390.340.560.78
ҳ 2 0.11 0.11 0.11 0.590.660.660.910.340.680.560.760.310.470.380.84
ҳ 3 0.35 0.45 0.61 0.420.560.710.810.410.350.270.590.720.550.440.65
ҳ 4 0.33 0.54 0.31 0.590.450.90.440.550.770.460.460.450.760.460.85
ҳ 5 0.35 0.2 0.64 0.160.330.420.550.440.770.570.660.910.130.350.57
ҳ 6 0.47 0.37 0.68 0.680.460.880.470.660.750.410.730.410.240.540.45
ҳ 7 0.78 0.55 0.03 0.490.540.390.580.340.230.210.430.130.820.460.69
Table 2. Similarity Measure of P ї with P .
Table 2. Similarity Measure of P ї with P .
SM ( P 1 ,   P ) ( P 2 ,   P ) ( P 3 ,   P ) ( P 4 ,   P )
Values0.88720370.90142450.90102720.8464994
Table 3. Comparative Study.
Table 3. Comparative Study.
SM EnvironmentResults
The proposed SM for TSFSs TSFSs ( P 4 , P ) < ( P 1 , P ) < ( P 3 , P ) < ( P 2 , P )
The SM for TSFSs by Ullah et al. [25] TSFSs ( P 4 , P ) < ( P 3 , P ) < ( P 1 , P ) < ( P 2 , P )
The SM for TSFSs by Wu et al. [32] TSFSs ( P 4 , P ) < ( P 1 , P ) < ( P 3 , P ) < ( P 2 , P )
Table 4. Data on decision making.
Table 4. Data on decision making.
Ҫ 1 Ҫ 2 Ҫ 3 Ҫ 4 Ҫ 5
Á 1 0.1 0.7 0.4 0.50.80.90.80.80.80.60.70.80.30.50.7
Á 2 0.2 0.7 0.6 0.60.70.80.30.70.70.10.70.90.40.60.8
Á 3 0.5 0.6 0.6 0.50.60.70.50.70.10.90.60.20.50.60.9
Á 4 0.5 0.6 0.8 0.80.70.40.80.70.30.60.60.10.80.40.4
Ҫ 100100100100100
Table 5. SM of Á ї with Ҫ .
Table 5. SM of Á ї with Ҫ .
SM ( Á 1 ,   Ҫ ) ( Á 2 ,   Ҫ ) ( Á 3 ,   Ҫ ) ( Á 4 ,   Ҫ )
Values0.51105070.37071170.59889220.7403513
Table 6. Comparative Study.
Table 6. Comparative Study.
SMEnvironmentResults
The proposed SM for TSFSsTSFSs Á 2 < Á 1 < Á 3 < Á 4
The SM for TSFSs by Ullah et al. [29] TSFSs Á 2 < Á 1 < Á 3 < Á 4
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Abid, M.N.; Yang, M.-S.; Karamti, H.; Ullah, K.; Pamucar, D. Similarity Measures Based on T-Spherical Fuzzy Information with Applications to Pattern Recognition and Decision Making. Symmetry 2022, 14, 410. https://doi.org/10.3390/sym14020410

AMA Style

Abid MN, Yang M-S, Karamti H, Ullah K, Pamucar D. Similarity Measures Based on T-Spherical Fuzzy Information with Applications to Pattern Recognition and Decision Making. Symmetry. 2022; 14(2):410. https://doi.org/10.3390/sym14020410

Chicago/Turabian Style

Abid, Muhammad Nabeel, Miin-Shen Yang, Hanen Karamti, Kifayat Ullah, and Dragan Pamucar. 2022. "Similarity Measures Based on T-Spherical Fuzzy Information with Applications to Pattern Recognition and Decision Making" Symmetry 14, no. 2: 410. https://doi.org/10.3390/sym14020410

APA Style

Abid, M. N., Yang, M. -S., Karamti, H., Ullah, K., & Pamucar, D. (2022). Similarity Measures Based on T-Spherical Fuzzy Information with Applications to Pattern Recognition and Decision Making. Symmetry, 14(2), 410. https://doi.org/10.3390/sym14020410

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