Next Article in Journal
Estimates of Coefficient Functionals for Functions Convex in the Imaginary-Axis Direction
Previous Article in Journal
Lorentz Violation at the Level of Undergraduate Classical Mechanics
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Fourth Axiom of Similarity Measures

1
Department of Tourism, Aletheia University, New Taipei City 25103, Taiwan
2
Department of Information Management, Central Police University, Taoyuan 33304, Taiwan
3
Department of Fashion Industry Management, Hsing Wu University, New Taipei City 25103, Taiwan
*
Author to whom correspondence should be addressed.
Symmetry 2020, 12(10), 1735; https://doi.org/10.3390/sym12101735
Submission received: 14 September 2020 / Revised: 2 October 2020 / Accepted: 8 October 2020 / Published: 20 October 2020
(This article belongs to the Section Mathematics)

Abstract

:
In this research, the fourth axiom to improve the well-defined examination of similarity measures is studied, where the measures have a symmetric structure. We first provide a theoretic enhancement of three correlation coefficient similarity measures that were proposed by a source paper. Second, we use the same numerical example proposed by the source paper for pattern recognition problems to illustrate that the weighted correlation coefficient similarity measure is dependent on the set of weights. Finally, we demonstrate that the correlation coefficient similarity measure in the intuitionistic fuzzy set environment can address the issue of practical fault diagnosis when solving the turbine engine problems using similarity measures with symmetric characteristics.

1. Introduction

Since Zadeh [1] developed fuzzy sets and Atanassov [2] constructed intuitionistic fuzzy sets (IFSs), numerous studies have examined fuzzy sets and IFSs to determine their theoretic evolution and devise applications to practical problems. Recently, motivated by Ye [3], for a correlation coefficient similarity measure, Zhang et al. [4] developed three new similarity measures, one for fuzzy sets and two for IFSs.
A research tendency has emerged to improve the mathematical approach of analytical methods and algebraic procedures in previously published papers. For example, a series of papers—Deng et al. [5], Tang et al. [6], Lan et al. [7], Yang et al. [8], Deng [9], Chang et al. [10], Jung et al. [11], and Deng et al. [12]—make revisions to existing proofs. Motivated by these articles, Zhang et al. [4] provided a new direction for similarity measures with correlation coefficient types, which is worthy of careful examination. Based on the detailed study of Zhang et al. [4], we found that there is a questionable result about their proof on a well-defined similarity measure. Specifically, Zhang et al. [4] only adopted the axioms of Gerstenkorn and Manko [13] to solve the problem. However, following a comprehensive study, we concluded that most researchers tend to include the fourth axiom [14] than to use Gerstenkorn and Manko [13] alone. For example, Ye [3] mentioned that the systems of axioms of both Gerstenkorn and Manko [13] and Li and Cheng [14] area well-defined similarity measure. However, in an examination of the satisfying axioms for well-defined similarity measures, Ye [3] only investigated the three axioms of Li and Cheng [14] and neglected their fourth proposed axiom. Hence, the first goal of this paper is to provide a revision to enhance the proof of Zhang et al. [4] on their similarity measures for the fourth axiom of Li and Cheng [14].
Moreover, we note that the third similarity measure proposed by Zhang et al. [4], which isa weighted correlation coefficient similarity measure, is dependent on the weights for elements in the universe of discourse.
Finally, we demonstrate that the second similarity measure proposed by Zhang et al. [4] addressed a practical pattern recognition problem of fault diagnosis for the turbine engine. If a turbine engine does not operate optimally, an engineer attempts to determine the cause of possible problems and may replace malfunctioning components. Potential explanations for the suboptimal performance can be treated as patterns and the engineer represents a sample facing pattern recognition problem. Using fuzzy sets or IFSs to address practical issues involving significant uncertainty and missing information can present a vague environment in a well-defined setting.

2. Brief Review of Similarity Measures with Intuitionistic Fuzzy Sets

Zadeh [1] was the first author to develop the fuzzy set theorem to deal with uncertain conditions. More than twenty thousand papers and hundreds of books have followed his approach to investigate complicated and dynamic real-world issues. One extension of the fuzzy set theorem is the proposal of IFSs by Atanassov [2], which have been used extensively in numerous variations to address the problem of uncertainty. In the following, we recall the definition of an intuitionistic fuzzy set and several related similarity measures.
Definition 1. 
(Atanassov [2]). We assume that X is the universe of discourse; then, an intuitionistic fuzzy set on X is an object having the expression
A = { x ,   μ A ( x ) ,   v A ( x ) : x X } ,
where μ A ( x ) : X [ 0 , 1 ] is the membership function and v A ( x ) : X [ 0 , 1 ] is the non-membership function with μ A ( x ) + v A ( x ) 1 .
π A ( x ) = 1 μ A ( x ) v A ( x )
is the hesitation degree with π A ( x ) : X [ 0 , 1 ] .
Hundreds of similarity measures have been defined for intuitionistic fuzzy sets. Several are listedin the following.
Li and Cheng [14] assumed an auxiliary notation, φ A ( x ) with
φ A ( x ) = μ A ( x ) + 1 v A ( x ) 2 ,
Then, for two intuitionistic fuzzy sets, A and B, Li and Cheng [14] defined a similarity measure, S d p ( A , B ) , as
S d p ( A , B ) = 1 1 n p i = 1 n ( φ A ( x i ) φ B ( x i ) ) p p ,
where the universe of discourse is X = { x 1 , x 2 , , x n } .
For two intuitionistic fuzzy sets, A and B, Hung and Wang [15] considered a new similarity measure, C IFS new ( A , B ) , as
C IFS new ( A , B ) = 1 n i = 1 n μ A ( x i ) μ B ( x i ) + v A ( x i ) v B ( x i ) + π A ( x i ) π B ( x i ) μ A 2 ( x i ) + v A 2 ( x i ) + π A 2 ( x i ) μ B 2 ( x i ) + v B 2 ( x i ) + π B 2 ( x i ) ,
where the universe of discourse is X = { x 1 , x 2 , , x n } .
For two intuitionistic fuzzy sets, A and B, Hung et al. [16] developed a new similarity measure, S λ ,   W p ( A , B ) ,
S λ ,   W p ( A , B ) = 1 ( i = 1 n w i ( | μ A ( x i ) μ B ( x i ) | + λ | π A ( x i ) π B ( x i ) | 2 ) p ) 1 / p ,
where W = { w 1 , w 2 , , w n } is the set of weights for elements in the universe of discourse, with i = 1 n w i = 1 , 1 p < , and λ is the preference value for the decision-maker, with 0 λ 1 .
For two intuitionistic fuzzy sets, A and B, under a continuous domain, Julian et al. [17] assumed the following similarity measure, S new , p ( A , B ) ,
S new , p ( A , B ) = 1 ( w ( x ) | μ A ( x ) μ B ( x ) | p ) 1 / p ( w ( x ) | ϕ A ( x ) ϕ B ( x ) | p ) 1 / p ,
where w ( x ) is the weight function, with w ( x ) 0 and w ( x ) dx = 1 , with 1 p < .
Chu and Guo [18] constructed a similarity measure for two intuitionistic fuzzy sets, A and B, as follows:
S ( A , B ) = 1 1 + ( i = 1 n w i ( Δ 1 + Δ 2 + Δ 3 ) ) 1 / α ,
where Δ 1 = δ 1 | μ A ( x i ) μ B ( x i ) | α , Δ 2 = δ 2 | v A ( x i ) v B ( x i ) | α , and Δ 3 = δ 3 | π A ( x i ) π B ( x i ) | α are three abbreviations to simplify the expressions; w i are the weights for elements in the universe of discourse, for i = 1 , 2 , , n , and δ 1 , δ 2 , and δ 3 are weights of the membership, non-membership, and hesitation functions; α 1 is a constant.
For two intuitionistic fuzzy sets, A and B, Yen et al. [19] constructed two similarity measures, S q , ρ , w ( A , B ) and S q , ρ , w , M ( A , B ) ,
S q ,   ρ , w ( A , B ) = 1 ( i = 1 n w i ( | μ A ( x i ) μ B ( x i ) | + ρ | π A ( x i ) π B ( x i ) | 2 ) q ) 1 / q ,
and
S q , ρ , w ,   M ( A , B ) = 1 ( i = 1 n w i ( Ω 1 + Ω 2 ) q ) 1 / q ,
where Ω 1 = | μ A ( x i ) μ B ( x i ) | 2 max { μ A ( x i ) , μ B ( x i ) } and Ω 2 = ρ | π A ( x i ) π B ( x i ) | 2 max { π A ( x i ) , π B ( x i ) } are two abbreviations to simplify the expressions and W = { w 1 , w 2 , , w n } is the set of weights for elements in the universe of discourse, with i = 1 n w i = 1 , 1 q < , and ρ is the preferred rate for the decision-maker, with 0 ρ .

3. Review of the Source Paper

Based on Gerstenkorn and Manko [13] and Ye [3], Zhang et al. [4] mentioned that the three axioms for a well-defined similarity measure denoted as (A1), (A2), and (A3) in the following
S : I F S s ( X ) × I F S s ( X ) [ 0 , 1 ] should satisfy the following three requirements:
For three IFSs A , B and C in I F S s ( X ) ,
(A1)
0 S ( A , B ) 1 ;
(A2)
If A = B , then S ( A , B ) = 1 ;
(A3)
S ( A , B ) = S ( B , A ) .
Zhang et al. [4] developed three similarity measures. We cite them in the following.
For two F S s , A = ( μ A ( x 1 ) , μ A ( x 2 ) , , μ A ( x n ) ) and B = ( μ B ( x 1 ) , μ B ( x 2 ) , , μ B ( x n ) ) with the universe of discourse X = { x 1 , x 2 , , x n } , the first similarity measure is defined as
S F S ( A , B ) = 1 n i = 1 n 2 μ A ( x i ) μ B ( x i ) μ A 2 ( x i ) + μ B 2 ( x i ) .
For two I F S s A and B , the second similarity measure is defined as
S I F S ( A , B ) = 1 n i = 1 n 2 [ μ A ( x i ) μ B ( x i ) + v A ( x i ) v B ( x i ) ] μ A 2 ( x i ) + μ B 2 ( x i ) + v A 2 ( x i ) + v B 2 ( x i ) .
For two I F S s A and B , the third similarity measure is defined as
W S I F S ( A , B ) = i = 1 n w i 2 [ μ A ( x i ) μ B ( x i ) + v A ( x i ) v B ( x i ) ] μ A 2 ( x i ) + μ B 2 ( x i ) + v A 2 ( x i ) + v B 2 ( x i ) ,
where 0 w i for i = 1 , 2 , , n and i = 1 n w i = 1 .

4. Our Patchwork for the Fourth Axiom (A4) for the Source Paper

Li and Cheng [14] claimed that, besides the three axioms (A1), (A2), and (A3), a well-defined similarity measure should also satisfy the fourth axiom (A4) as cited below:
(A4)
If A B C , then S ( A , C ) S ( A , B ) , and S ( A , C ) S ( B , C ) .
Up to now, 624 papers have cited Li and Cheng [14] in their references—for example, Hung and Lin [20] Julian et al. [17], Tung et al. [21] Hung and Lin [22], Yen et al. [19], Hung and Wang [15], Chu and Guo [18], Tung and Hopscotch [23], and Hung et al. [16]—to indicate that to include (A4) for a well-defined similarity measure isaccepted by the research community. We compare the above ten papers in Table 1.
Especially, inthe last three years, 152 papers have cited Li and Cheng [14] in their references. We pay attention to those 17 papers which are related to decision sciences in the following. Aggarwal et al. [24] applied Hurwicz optimism–pessimism criterion to solve Atanassov’s I-fuzzy linear programming problems by changing convex breakpoints into concave breakpoints on the lines with the indeterminacy factor resolution principle. Farhadinia and Xu [25] established a metrical T-norm-based similarity measure to compare with a metrical T-norm-based entropy measure for hesitant fuzzy sets. Fei et al. [26] defined a new vector-valued similarity measure for intuitionistic fuzzy sets that contain a similarity measure and an uncertainty measure to express all data in the universe of discourse that satisfy all axioms of intuitionistic fuzzy sets. Joshi and Kumar [27] considered a new approach to applying exponential hesitant fuzzy entropy in multiple attribute decision-making problems. They constructed two methods to derive criterion weight. Khanmohammadi et al. [28] constructed a new fuzzy logarithmic least squares method to rank the strategic objectives by the fuzzy similarity technique to improve efficiency and the significance level. Li and Liu [29] extended two classical distances with fuzzy sets to intuitionistic fuzzy sets that satisfy the approximation and continuity properties of a method while dealing with intuitionistic fuzzy reasoning. Lin [30] used the technique for order preference by similarity to the ideal solution method to solve a group multi-criteria decision-making problem with a new distance measure that satisfied axioms of distance measure.Mishra and Rani [31] developed an interval-valued intuitionistic fuzzy method to derive weights for attributes and experts for a reservoir flood control management policy. Rani et al. [32] applied the Shapley function to deal with interval-valued intuitionistic fuzzy methods and then addressed an investment problem with an incomplete and uncertain information environment. Rouyendegh [33] constructed a new intuitionistic fuzzy index of hesitation degree method to handle multi-criteria decision-making problems under incomplete information conditions. Shen et al. [34] generalized the technique for order preference by similarity to the ideal solution method by a new similarity measure under an intuitionistic fuzzy set environment that was applied to solve credit risk evaluation problems. Shokeen and Rana [35] provided a brief introduction for advanced fuzzy sets that is the generalization of fuzzy sets, rough sets (for incomplete data), interval-valued fuzzy sets (for uncertainty and vagueness), and soft sets (for insufficiency of parameterization).Wang et al. [36] developed two fuzzy aggregate operators to deal with multi-criteria decision-making problems with Pythagorean fuzzy linguistics that are generalizations for many previously existing operators. Wei [37] constructed new similarity measures for fuzzy sets, interval-valued intuitionistic fuzzy sets, and picture fuzzy sets and then applied those similarity measures to solve building material recognition problems. Zhang et al. [38] used the technique for order preference by similarity to the ideal solution method to estimate dynamic agents to the positive ideal agent and the negative ideal agent under the intuitionistic fuzzy number conditions. Zhou et al. [39] developed the hesitant fuzzy envelopment analysis model, the deviation-oriented hesitant fuzzy envelopment analysis model, and the score-oriented hesitant fuzzy envelopment analysis model to derive score and deviation values. Hence, the subjective preferences of decision-makers for the attributes can be examined in the evaluation procedure.
In Zhang et al. [4], they only proved that their three similarity measures satisfy three axioms (A1), (A2), and (A3). However, Zhang et al. [4] did not discuss the fourth axiom (A4). Therefore, the first goal of our paper is to provide a patchwork to verify three similarity measures developed by Zhang et al. [4] that satisfy (A4) to complete the proof for well-defined similarity measures.
Based on Liang and Shi [40] and Atanassov [2,41,42], we know that for three I F S s ( X ) A , B , and C satisfying A B C if and only if for every x i in the universe of discourse, μ A ( x i ) μ B ( x i ) μ C ( x i ) and v A ( x i ) v B ( x i ) v C ( x i ) , where μ A is the membership function and v A is the non-membership function for the intuitionistic fuzzy set, A .
We present our first theoretic result for the similarity measure proposed by Zhang et al. [4] for fuzzy sets.
Lemma 1.
For three F S s A , B and C satisfying A B C , we prove that S F S ( A , C ) S F S ( A , B ) .
Proof. 
We know that
S F S ( A , C ) = 1 n i = 1 n 2 μ A ( x i ) μ C ( x i ) μ A 2 ( x i ) + μ C 2 ( x i )
and
S F S ( A , B ) = 1 n i = 1 n 2 μ A ( x i ) μ B ( x i ) μ A 2 ( x i ) + μ B 2 ( x i ) ,
under the restriction μ A ( x i ) μ B ( x i ) μ C ( x i ) for every u i in X = { x 1 , x 2 , , x n } .
For i = 1 , 2 , , n , we compute that
μ B ( x i ) μ A 2 ( x i ) + μ B 2 ( x i ) μ C ( x i ) μ A 2 ( x i ) + μ C 2 ( x i ) = [ μ C ( x i ) μ B ( x i ) ] [ μ B ( x i ) μ C ( x i ) μ A 2 ( x i ) ] [ μ A 2 ( x i ) + μ B 2 ( x i ) ] [ μ A 2 ( x i ) + μ C 2 ( x i ) ] .
Owing to μ A ( x i ) μ B ( x i ) μ C ( x i ) , we derive that
μ B ( x i ) μ A 2 ( x i ) + μ B 2 ( x i ) μ C ( x i ) μ A 2 ( x i ) + μ C 2 ( x i ) 0 ,
and then it yields that
μ A ( x i ) μ B ( x i ) μ A 2 ( x i ) + μ B 2 ( x i ) μ A ( x i ) μ C ( x i ) μ A 2 ( x i ) + μ C 2 ( x i )
for i = 1 , 2 , , n , so we verify that S F S ( A , C ) S F S ( A , B ) . □
Lemma 2.
For three F S s A , B and C satisfying A B C , we prove that S F S ( A , C ) S F S ( B , C ) .
Proof. 
We know that
S F S ( A , C ) = 1 n i = 1 n 2 μ A ( x i ) μ C ( x i ) μ A 2 ( x i ) + μ C 2 ( x i ) ,
and
S F S ( B , C ) = 1 n i = 1 n 2 μ B ( x i ) μ C ( x i ) μ B 2 ( x i ) + μ C 2 ( x i ) ,
under the restriction μ A ( x i ) μ B ( x i ) μ C ( x i ) for every u i in X = { x 1 , x 2 , , x n } .
For i = 1 , 2 , , n , we compute that
μ B ( x i ) μ B 2 ( x i ) + μ C 2 ( x i ) μ A ( x i ) μ A 2 ( x i ) + μ C 2 ( x i ) = [ μ B ( x i ) μ C ( x i ) ] [ μ C 2 ( x i ) μ A ( x i ) μ B ( x i ) ] [ μ A 2 ( x i ) + μ B 2 ( x i ) ] [ μ A 2 ( x i ) + μ C 2 ( x i ) ] .
Owing to μ A ( x i ) μ B ( x i ) μ C ( x i ) , we derive that
μ B ( x i ) μ B 2 ( x i ) + μ C 2 ( x i ) μ A ( x i ) μ A 2 ( x i ) + μ C 2 ( x i ) 0 ,
and then it yields that
μ B ( x i ) μ C ( x i ) μ B 2 ( x i ) + μ C 2 ( x i ) μ A ( x i ) μ C ( x i ) μ A 2 ( x i ) + μ C 2 ( x i )
for i = 1 , 2 , , n , so we verify that S F S ( A , C ) S F S ( B , C ) . □
Based on our proven Lemma 1 and Lemma 2, we verify that the first similarity measure proposed by Zhang et al. [4] satisfies the fourth axiom (A4). Hence, we derive our first main result.
Theorem 1.
The first similarity measure proposed by Zhang et al. [4] S F S ( A , B ) satisfies the fourth axiom (A4).
To prove that the second and third similarity measures of Zhang et al. [4] satisfy the fourth axiom (A4), we need the following lemma.
Lemma 3.
If 1 2 a A b B and 1 2 c C d D , then a + c A + C b + d B + D , where a , b , c , d and A , B , C , D are positive numbers.
Proof. 
From the conditions of Lemma 3, we know that a A b B and c C d D , and then we derive that A is bounded above by a b B and C is bounded above by c d D .
We observe a + c A + C to know that
a + c A + C a + c A + C | A = a b B , C = c d D = α b + β d α B + β D
where α = a d and β = b c are two abbreviations to simplify the expression.
We compute
α b + β d α B + β D b + d B + D = ( α β ) ( b D d B ) ( α B + β D ) ( B + D )
to imply that if (a) α β and b D d B 0 , or (b) α β and b D d B 0 , then Lemma 3 is valid.
From the conditions of Lemma 3, we know that a A b B and c C d D , and then we derive that a is bounded below by A B b and c is bounded below by C D d .
We observe a + c A + C to know that
a + c A + C a + c A + C | a = A B b , c = C D d = δ b + φ d δ B + φ D .
where δ = A D and φ = B C are two additional abbreviations to simplify the expression.
We compute
δ b + φ d δ B + φ D b + d B + D = ( δ φ ) ( b D d B ) ( δ B + φ D ) ( B + D )
to imply that if (c) φ δ and b D d B 0 , or (d) φ δ and b D d B 0 , then Lemma 3 is valid.
There are four cases: (C1) α β and b D d B 0 , (C2) α β and b D d B 0 , (C3) α β and b D d B 0 , and (C4) α β and b D d B 0 .
We already obtain that Case (C1) is (a) and Case (C2) is (b).
For Case (C3), with the condition b D d B 0 , we derive that
δ φ = A D B C A D B C a d b c A C d c B C ( A B b ) d b c 0 ,
since α = a d β = b c and D C d c .
Hence, we derive that φ δ that is (c) with the condition b D d B 0 .
For Case (C4) with the condition α β and b D d B 0 , we obtain that
δ φ = A D B C A D b c a d B C ( B a b ) D b c a d B ( D c d ) 0 ,
since α = a d β = b c , B a b A , and D d c C .
Therefore, we know that δ φ that is (d) with the condition b D d B 0 .
Based on the above discussion, we finish the proof of Lemma 3. □
For the second measure of Zhang et al. [4], we begin to verify that it satisfies the fourth axiom (A4).
Lemma 4.
For three F S s A , B and C satisfying A B C we prove that S I F S ( A , C ) S I F S ( A , B ) .
Proof. 
We know that
S I F S ( A , C ) = 1 n i = 1 n 2 [ μ A ( x i ) μ C ( x i ) + v A ( x i ) v C ( x i ) ] μ A 2 ( x i ) + μ C 2 ( x i ) + v A 2 ( x i ) + v C 2 ( x i )
and
S I F S ( A , B ) = 1 n i = 1 n 2 [ μ A ( x i ) μ B ( x i ) + v A ( x i ) v B ( x i ) ] μ A 2 ( x i ) + μ B 2 ( x i ) + v A 2 ( x i ) + v B 2 ( x i ) ,
under the restriction μ A ( x i ) μ B ( x i ) μ C ( x i ) and v A ( x i ) v B ( x i ) v C ( x i ) for every x i in X = { x 1 , x 2 , , x n } .
First, we recall Theorem 1 to know that
μ A ( x i ) μ B ( x i ) μ A 2 ( x i ) + μ B 2 ( x i ) μ A ( x i ) μ C ( x i ) μ A 2 ( x i ) + μ C 2 ( x i ) .
We repeated to apply Theorem 1 again to obtain that
v A ( x i ) v B ( x i ) v A 2 ( x i ) + v B 2 ( x i ) v A ( x i ) v C ( x i ) v A 2 ( x i ) + v C 2 ( x i ) .
We know that
1 2 μ A ( x i ) μ B ( x i ) μ A 2 ( x i ) + μ B 2 ( x i )
and
1 2 v A ( x i ) v B ( x i ) v A 2 ( x i ) + v B 2 ( x i )
such that the conditions of Lemma 3 are satisfied.
Next, we use Lemma 3 for Equations (32) and (33) to yield that
μ A ( x i ) μ B ( x i ) + v A ( x i ) v B ( x i ) μ A 2 ( x i ) + μ B 2 ( x i ) + v A 2 ( x i ) + v B 2 ( x i ) μ A ( x i ) μ C ( x i ) + v A ( x i ) v C ( x i ) μ A 2 ( x i ) + μ C 2 ( x i ) + v A 2 ( x i ) + v C 2 ( x i ) ,
for i = 1 , 2 , , n , so we verify that S I F S ( A , B ) S I F S ( A , C ) . □
Lemma 5.
For three F S s A , B and C satisfying A B C , we prove that S I F S ( A , C ) S I F S ( B , C ) .
Proof. 
We know that
S I F S ( A , C ) = 1 n i = 1 n 2 [ μ A ( x i ) μ C ( x i ) + v A ( x i ) v C ( x i ) ] μ A 2 ( x i ) + μ C 2 ( x i ) + v A 2 ( x i ) + v C 2 ( x i )
and
S I F S ( B , C ) = 1 n i = 1 n 2 [ μ B ( x i ) μ C ( x i ) + v B ( x i ) v C ( x i ) ] μ B 2 ( x i ) + μ C 2 ( x i ) + v B 2 ( x i ) + v C 2 ( x i )
under the restriction μ A ( x i ) μ B ( x i ) μ C ( x i ) and v A ( x i ) v B ( x i ) v C ( x i ) for every x i in X = { x 1 , x 2 , , x n } .
First, we recall Theorem 1 to know that
μ B ( x i ) μ C ( x i ) μ B 2 ( x i ) + μ C 2 ( x i ) μ A ( x i ) μ C ( x i ) μ A 2 ( x i ) + μ C 2 ( x i ) .
We repeated to apply Theorem 1 again to obtain that
v B ( x i ) v C ( x i ) v B 2 ( x i ) + v C 2 ( x i ) v A ( x i ) v C ( x i ) v A 2 ( x i ) + v C 2 ( x i ) .
We know that
1 2 μ B ( x i ) μ C ( x i ) μ B 2 ( x i ) + μ C 2 ( x i ) ,
and
1 2 v B ( x i ) v C ( x i ) v B 2 ( x i ) + v C 2 ( x i ) .
such that the conditions of Lemma 3 are satisfied.
Next, we apply Lemma 3 for Equations (39) and (40) to derive that
μ B ( x i ) μ C ( x i ) + v B ( x i ) v C ( x i ) μ B 2 ( x i ) + μ C 2 ( x i ) + v B 2 ( x i ) + v C 2 ( x i ) μ A ( x i ) μ C ( x i ) + v A ( x i ) v C ( x i ) μ A 2 ( x i ) + μ C 2 ( x i ) + v A 2 ( x i ) + v C 2 ( x i ) ,
for i = 1 , 2 , , n , so we verify that S I F S ( B , C ) S I F S ( A , C ) . □
Based on our Lemmas 4 and 5, we verify that the second similarity measure proposed by Zhang et al. [4] satisfies the fourth axiom (A4). Hence, we derive our second main result.
Theorem 2.
The second similarity measure proposed by Zhang et al. [4] S I F S ( A , B ) satisfies the fourth axiom (A4).
For the third measure of Zhang et al. [4], we begin to show that it satisfies the fourth axiom (A4).
Lemma 6.
For three F S s A , B and C satisfying A B C , we prove that W S I F S ( A , C ) W S I F S ( A , B ) .
Proof. 
We know that
W S I F S ( A , B ) = i = 1 n w i 2 [ μ A ( x i ) μ B ( x i ) + v A ( x i ) v B ( x i ) ] μ A 2 ( x i ) + μ B 2 ( x i ) + v A 2 ( x i ) + v B 2 ( x i ) ,
and
W S I F S ( A , C ) = i = 1 n w i 2 [ μ A ( x i ) μ C ( x i ) + v A ( x i ) v C ( x i ) ] μ A 2 ( x i ) + μ C 2 ( x i ) + v A 2 ( x i ) + v C 2 ( x i ) ,
Based on Equation (36), we derived that
w i μ A ( x i ) μ B ( x i ) + v A ( x i ) v B ( x i ) μ A 2 ( x i ) + μ B 2 ( x i ) + v A 2 ( x i ) + v B 2 ( x i ) w i μ A ( x i ) μ C ( x i ) + v A ( x i ) v C ( x i ) μ A 2 ( x i ) + μ C 2 ( x i ) + v A 2 ( x i ) + v C 2 ( x i ) ,
with w i 0 , for i = 1 , 2 , , n , so we verify that W S I F S ( A , B ) W S I F S ( A , C ) . □
Lemma 7.
For three F S s A , B and C satisfying A B C , we prove that W S I F S ( A , C ) W S I F S ( B , C ) .
Proof. 
We know that
W S I F S ( B , C ) = i = 1 n w i 2 [ μ B ( x i ) μ C ( x i ) + v B ( x i ) v C ( x i ) ] μ B 2 ( x i ) + μ C 2 ( x i ) + v B 2 ( x i ) + v C 2 ( x i ) ,
and
W S I F S ( A , C ) = i = 1 n w i 2 [ μ A ( x i ) μ C ( x i ) + v A ( x i ) v C ( x i ) ] μ A 2 ( x i ) + μ C 2 ( x i ) + v A 2 ( x i ) + v C 2 ( x i ) .
Based on Equation (33), we derived that
w i μ A ( x i ) μ B ( x i ) + v A ( x i ) v B ( x i ) μ A 2 ( x i ) + μ B 2 ( x i ) + v A 2 ( x i ) + v B 2 ( x i ) w i μ A ( x i ) μ C ( x i ) + v A ( x i ) v C ( x i ) μ A 2 ( x i ) + μ C 2 ( x i ) + v A 2 ( x i ) + v C 2 ( x i ) ,
with w i 0 , for i = 1 , 2 , , n , so we verify that W S I F S ( B , C ) W S I F S ( A , C ) . □
Based on our proven Lemmas 6 and 7, we verify that the third similarity measure proposed by Zhang et al. [4] satisfies the fourth axiom (A4). Hence, we derive our second main result.
Theorem 3.
The third similarity measure proposed by Zhang et al. [4] W S I F S ( A , B ) satisfies the fourth axiom (A4).
Therefore, we provide revisions to prove that the three similarity measures proposed by Zhang et al. [4] all satisfy the fourth axiom (A4) to complete the verification of a well-defined examination for similarity measures proposed by Zhang et al. [4].

5. Numerical Examples

In our first three examples, we reconsider the pattern recognition problem proposed by Zhang et al. [4] with three different settings of weights to illustrate that the weighed similarity measure was proposed by Zhang et al. [4] which will be influenced by weights. We recall the pattern recognition proposed by Zhang et al. [4] with three patterns C 1 , C 2 , and C 3 , and one sample Q , where
C 1 = { x 1 , 1 , 0 , x 2 , 0.8 , 0 , x 3 , 0.7 , 0.1 } ,
C 2 = { x 1 , 0.8 , 0.1 , x 2 , 1 , 0 , x 3 , 0.9 , 0 } ,
C 3 = { x 1 , 0.6 , 0.2 , x 2 , 0.8 , 0 , x 3 , 1 , 0 }
and
Q = { x 1 , 0.5 , 0.3 , x 2 , 0.6 , 0.2 , x 3 , 0.8 , 0.1 } .
We develop three examples with different settings of w i , for i = 1 , 2 , 3 . For the first example, we follow Zhang et al. [4] to assume that w 1 = 0.5 , w 2 = 0.3 and w 3 = 0.2 . For the second example, we set that w 1 = 0.05 , w 2 = 0.05 and w 3 = 0.9 , and then for the third example, we take that w 1 = 0.09 , w 2 = 0.01 , and w 3 = 0.9 . The computation results are listed in the next Table 2.
From Table 2, to consider Example 1, we derive that sample Q should have belonged to the pattern C 3 . Our derivation is consistent with Zhang et al. [4].
However, for our Example 2, with a different set of w i , for i = 1 , 2 , 3 , then we obtain that the sample Q should have belonged to the pattern C 1 . Our result is different from that of Zhang et al. [4].
Moreover, for our Example 3, with another set of w i , for i = 1 , 2 , 3 , then we imply that the sample Q should have belonged to the pattern C 2 . Our finding of Example 3 is different from that of Examples 1 and 2. Hence, we can conclude that the weighted similarity measure proposed by Zhang et al. [4] will be significantly influenced by the setting of w i , for i = 1 , 2 , 3 .
For our fourth example, we recall an application of similarity measures under an intuitionistic fuzzy sets environment for the fault diagnosis of turbine generators that was discussed by Li and Wan [43] and Chu et al. [44]. They used the amplitude ratio of vibration signal in six different frequency ranges, less than 0.4 f , 0.5 f , f , 2 f , 3 f and more than 3 f , as the characteristic values to construct their universe of discourse, where f is the fundamental frequency of the turbine generator. There are three typical failures to be used as the failure patterns: P 1 (oil whip), P 2 (unbalance), and P 3 (misalignment), and two samples B 1 and B 2 to be tested for its pattern. We cite Table 1 and Table 2 of Chu et al. [44] for the six different frequency ranges of three patterns and two samples, respectively, in our Table 3 under an intuitionistic fuzzy sets environment.
Based on our previous discussion for the weighted similarity measure W S I F S proposed by Zhang et al. [4], we know that it is influenced by the different settings of w i for i = 1 , 2 , , 6 such that we only consider S I F S proposed by Zhang et al. [4] in our fourth example.
To be compatible with Chu et al. [44], Julian et al. [17], Tung et al. [21], Li and Wan [43], Yusoff et al. [45], and Zeng [46], we cite Table 3 of Chu et al. [44] in our Table 4 along with ourfindings afterwe apply the second similarity measure proposed by Zhang et al. [4] of Equation (12).
In the following, we consider several recent published papers to apply their similarity measures for this pattern recognition problem.
For ξ = [ ξ 1 , ξ 2 , ξ 3 , ξ 4 , ω 1 , ω 2 ] and η = [ η 1 , η 2 , η 3 , η 4 , κ 1 , κ 2 ] , two generalized trapezoidal fuzzy numbers, Dutta [47] defined a new similarity measure D S ( ξ , η ) as
D S ( ξ , η ) = 2 ( ω 1 κ 1 + ω 2 κ 2 + | ω 1 κ 1 | + | ω 2 κ 2 | + ξ i η i ) ω 1 2 + ω 2 2 + κ 1 2 + κ 2 2 + | ω 1 κ 1 | 2 + | ω 2 κ 2 | 2 + ( ξ i 2 + η i 2 ) ,
where [ η 1 , η 2 , η 3 , η 4 ] is a trapezoidal number with left height ω 1 and right height ω 2 .
For an intuitionistic fuzzy set on X, μ A ( x ) : X [ 0 , 1 ] is the membership function and v A ( x ) : X [ 0 , 1 ] is the non-membership function.We can convert the intuitionistic fuzzy into a generalized trapezoidal fuzzy number as follows,
ξ = [ μ A ( x ) , μ A ( x ) ,   1 v A ( x ) ,   1 v A ( x ) , 1 , 1 ] ,
and then we can apply the similarity measure proposed by Dutta [47].
For A = { [ y , ξ A ( y ) , η A ( y ) , ν A ( y ) ] : y Y } and B = { [ y , ξ B ( y ) , η B ( y ) , ν B ( y ) ] : y Y } , two spherical fuzzy sets, where ξ A , η A , and ν A : Y [ 0 , 1 ] are the degree of positive, neutral, and negative membership functions, with Y = { y 1 , , y m } and ξ A ( y ) + η A ( y ) + ( y ) 1 , Rafiq et al. [48] developed a cotangent similarity measure, S C ( A ,   B ) as follows,
S C ( A ,   B ) = 1 m i = 1 m cot ( π 4 + Π i ) ,
where Π i is an abbreviation to simplify the expression, where
Π i = max { | ξ A 2 ( y i ) ξ B 2 ( y i ) | , | η A 2 ( y i ) η B 2 ( y i ) | , | ν A 2 ( y i ) ν B 2 ( y i ) | , Ψ i } ,
and Ψ i is a second abbreviation to simplify the expression, with
Ψ i = | ξ A ( y i ) + η A ( y i ) + ν A ( y i ) ξ B ( y i ) η B ( y i ) ν B ( y i ) | .
We can generalize an intuitionistic fuzzy set A = { [ y , ξ A ( y ) , ν A ( y ) ] : y Y } to a spherical fuzzy set A = { [ y , ξ A ( y ) , η A ( y ) , ν A ( y ) ] : y Y } with η A ( y i ) = 0 , for i = 1 , 2 , , m .
For A = { [ y , ξ A ( y ) , η A ( y ) , ν A ( y ) ] : y Y } and B = { [ y , ξ B ( y ) , η B ( y ) , ν B ( y ) ] : y Y } , two spherical fuzzy sets, Khan et al. [49] defined a new similarity measure, S S ( A ,   B ) , as
S S ( A ,   B ) = i = 1 m [ ξ A 2 ( y i ) ξ B 2 ( y i ) + η A 2 ( y i ) η B 2 ( y i ) + ν A 2 ( y i ) ν B 2 ( y i ) ] i = 1 m { max { ξ A 4 ( y i ) , ξ B 4 ( y i ) } + max { η A 4 ( y i ) , η B 4 ( y i ) } + max { ν A 4 ( y i ) , ν B 4 ( y i ) } } .
For two intuitionistic fuzzy sets, Muthuraj and Devi [50] constructed a new tangent similarity measure, T IFMS ( A ,   B ) , as follows
T IFMS ( A ,   B ) = 1 1 n i = 1 n tan [ π 12 ( | μ A ( x i ) μ B ( x i ) | + | v A ( x i ) v B ( x i ) | + | π A ( x i ) π B ( x i ) | ) ] .
For A = { [ y , s A ( y ) , i A ( y ) , d A ( y ) ] : y Y } and B = { [ y , s B ( y ) , i B ( y ) , d B ( y ) ] : y Y } , two T-spherical fuzzy sets, where s A ( y ) , i A ( y ) , d A ( y ) and r A ( y ) : X [ 0 , 1 ] are the membership, hesitancy, non-membership, and refusal degree, Wu et al. [51] assumed two cosine similarity measures, TSFCS 1 ( A , B ) and TSFCS 2 ( A ,   B ) , in the following:
TSFCS 1 ( A ,   B ) = 1 m i = 1 m cos ( π 2 max { α i , β i , γ i , δ i } ) ,
where | s A 4 ( y i ) s B 4 ( y i ) | = α i , | i A 4 ( y i ) i B 4 ( y i ) | = β i , | d A 4 ( y i ) d B 4 ( y i ) | = γ i , and | r A 4 ( y i ) r B 4 ( y i ) | = δ i are auxiliary notations to simplify the expression, and
TSFCS 2 ( A ,   B ) = 1 m i = 1 m cos ( π 4 ( α i + β i + γ i + δ i ) ) .
We can generalize an intuitionistic fuzzy set A = { [ y , ξ A ( y ) , ν A ( y ) ] : y Y } to a T-spherical fuzzy set A = { [ y , s A ( y ) , i A ( y ) , d A ( y ) ] : y Y } with s A ( y i ) = ξ A ( y i ) , i A ( y i ) = 1 ξ A ( y i ) ν A ( y i ) , d A ( y i ) = ν A ( y i ) , and η A ( y i ) = 0 , for i = 1 , 2 , , m .
Based on similarity measures discussed from Equation (54) to Equation (62), we evaluate the pattern recognition problems of Table 3 and then add them to the following Table 4.
From the fourth column of Table 4, the sample B 1 should have belonged to the pattern P 3 and in the sixth column of Table 4, the sample B 2 should have belonged to the pattern P 2 . The results derived by the similarity measure proposed by Zhang et al. [4] are the same as decided by Chu et al. [44], Julian et al. [17], Tung et al. [21], Li and Wan [43], Yusoff et al. [45], Zeng [46], Dutta [47], Rafiq et al. [48], Khan et al. [49], Muthuraj et al. [50], and Wu et al. [51]. Our fourth example illustrates that the similarity measure proposed by Zhang et al. [4] can be applied for a practical application of fault diagnosis of turbine generators.

6. Directions for Future Research

In this paper, we discuss three similarity measures proposed by Zhang et al. [4] that only refer to membership function and non-membership function, without considering the hesitation function. We can predict that to prove the similarity measures based on the inner product including membership, non-membership, and hesitation functions, satisfying the fourth axiom proposed by Li and Cheng [14] will be an interesting research topic. Some other applications require similarity measures. For example, a similarity angle mapper has been widely used as a similarity measure for comparing two vectors in hyperspectral image applications such as Kwan et al. [52] and Qu et al. [53]. Researchers applying similarity metrics in hyperspectral images will be an interesting topic for future practitioners.

7. Conclusions

In this paper, we first provide a patchwork to prove that three similarity measures proposed by Zhang et al. [4] satisfy the fourth axiom (A4) proposed by Li and Cheng [14]. Next, we examine the same example proposed by Zhang et al. [4] for a pattern recognition problem to point out that their third similarity measure, the weighted similarity measure, is dependent on weights such that how to derive a proper setting for weights becomes a critical issue. Finally, we provide a practical application for the second similarity measure of Zhang et al. [4] to demonstrate the usefulness of their second similarity measure.

Author Contributions

Conceptualization, C.-H.C. and Y.-F.L.; methodology, C.-H.C. and C.-P.Y.; software, Y.-F.L.; validation, C.-H.C.; formal analysis, C.-H.C. and C.-P.Y.; investigation, C.-P.Y.; resources, C.-P.Y.; data curation, Y.-F.L.; writing—original draft preparation, C.-P.Y. and Y.-F.L.; writing—review and editing, C.-H.C.; visualization, Y.-F.L.; supervision, C.-H.C.; project administration, C.-H.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Info. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  3. Ye, J. Cosine similarity measures for intuitionistic fuzzy sets and their applications. Math. Comput. Model. 2011, 53, 91–97. [Google Scholar] [CrossRef]
  4. Zhang, L.; Xu, X.; Chen, X. A New Similarity Measure for Intuitionistic Fuzzy Sets and Its Applications. Int. J. Info. Manag. Sci. 2012, 23, 229–239. [Google Scholar]
  5. Deng, P.S.; Yen, C.; Tung, C.; Yu, Y.; Chu, P. A technical note for the deteriorating inventory model with exponential time-varying demand and partial backlogging. Int. J. Info. Manag. Sci. 2006, 17, 101–108. [Google Scholar]
  6. Tang, D.W.; Chao, H.C.; Chuang, J.P. A note on the inventory model for deteriorating items with exponential declining demand and partial backlogging. Int. J. Info. Manag. Sci. 2013, 24, 167–173. [Google Scholar]
  7. Lan, C.; Yu, Y.; Lin, R.H.; Tung, C.; Yen, C.; Deng, P.S. A note on the improved algebraic method for the EPQ model with stochastic lead time. Int. J. Info. Manag. Sci. 2007, 18, 91–96. [Google Scholar]
  8. Yang, G.K.; Hung, K.C.; Julian, P. AdoptingLanchester model to the Ardennes Campaign with deadlock situation in the shift time between defense and attack. Int. J. Info. Manag. Sci. 2013, 24, 349–362. [Google Scholar]
  9. Deng, P.S. Improved inventory models with ramp type demand and Weibull deterioration. Int. J. Info. Manag. Sci. 2005, 16, 79–86. [Google Scholar]
  10. Chang, S.K.J.; Lei, H.L.; Jung, S.T.; Lin, R.H.J.; Lin, J.S.J.; Lan, C.H.; Yu, Y.C.; Chuang, J.P.C. Note on Deriving Weights from Pairwise Comparison Matrices in AHP. Int. J. Info. Manag. Sci. 2008, 19, 507–517. [Google Scholar]
  11. Jung, S.; Lin, J.S.; Chuang, J.P.C. A note on “an EOQ model for items with Weibull distributed deterioration, shortages and power demand pattern”. Int. J. Inf. Manag. Sci. 2008, 19, 667–672. [Google Scholar]
  12. Deng, P.S.; Yang, G.K.; Chen, H.; Chu, P.; Huang, D. The criterion for the optimal solution of inventory model with stock-dependent consumption rate. Int. J. Inf. Manag. Sci. 2005, 16, 97–109. [Google Scholar]
  13. Gerstenkorn, T.; Manko, J. Correlation of intuitionistic fuzzy sets. Fuzzy Sets Syst. 1991, 44, 39–43. [Google Scholar] [CrossRef]
  14. Li, D.; Cheng, C. New similarity measures of intuitionistic fuzzy sets and application to pattern recognition. Pattern Recognit. Lett. 2002, 23, 221–225. [Google Scholar]
  15. Hung, K.; Wang, P. An integrated intuitionistic fuzzy similarity measures for medical problems. Int. J. Comput. Intell. Syst. 2014, 7, 327–343. [Google Scholar] [CrossRef] [Green Version]
  16. Hung, K.; Lin, J.; Chu, P. An extended algorithm of similarity measures and its application to radar target recognition based on intuitionistic fuzzy sets. J. Test. Eval. 2015, 43, 878–887. [Google Scholar] [CrossRef]
  17. Julian, P.; Hung, K.C.; Lin, S.J. On the Mitchell similarity measure and its application to pattern recognition. Pattern Recognit. Lett. 2012, 33, 1219–1223. [Google Scholar] [CrossRef]
  18. Chu, C.; Guo, Y. Developing similarity based IPA under intuitionistic fuzzy sets to assess leisure bikeways. Tour. Manag. 2015, 47, 47–57. [Google Scholar] [CrossRef]
  19. Yen, P.C.P.; Fan, K.; Chao, H.C.J. A new method for similarity measures for pattern recognition. Appl. Math. Model. 2013, 37, 5335–5342. [Google Scholar] [CrossRef]
  20. Hung, K.; Lin, K. A new intuitionistic fuzzy cosine similarity measures and its application. In Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, Hong Kong, China, 10–13 December 2012; pp. 2194–2198. [Google Scholar]
  21. Tung, C.; Liu, S.; Wang, B.S. A comment on “on the Mitchell similarity measure and its application to pattern recognition”. Pattern Recognit. Lett. 2013, 34, 453–455. [Google Scholar] [CrossRef]
  22. Hung, K.; Lin, K. Long-term business cycle forecasting through a potential intuitionistic fuzzy least-squares support vector regression approach. Inf. Sci. 2013, 224, 37–48. [Google Scholar] [CrossRef]
  23. Tung, C.; Hopscotch, C. Discussion on similarity measure of its complement. J. Discret. Math. Sci. Cryptogr. 2015, 18, 417–432. [Google Scholar] [CrossRef]
  24. Aggarwal, A.; Mehra, A.; Chandra, S.; Khan, I. Solving Atanassov’s I-fuzzy linear programming problems using Hurwicz’s criterion. Fuzzy Inform. Eng. 2018, 10, 339–361. [Google Scholar] [CrossRef] [Green Version]
  25. Farhadinia, B.; Xu, Z. Hesitant fuzzy information measures derived from T-norms and S-norms. Iran. J. Fuzzy Syst. 2018, 15, 157–175. [Google Scholar]
  26. Fei, L.; Wang, H.; Chen, L.; Deng, Y. A new vector valued similarity measure for intuitionistic fuzzy sets based on OWA operators. Iran. J. Fuzzy Syst. 2019, 16, 113–126. [Google Scholar]
  27. Joshi, R.; Kumar, S. A new approach in multiple attribute decision making using exponential hesitant fuzzy entropy. Int. J. Info. Manag. Sci. 2019, 30, 305–322. [Google Scholar]
  28. Khanmohammadi, E.; Malmir, B.; Safari, H.; Zandieh, M. A new approach to strategic objectives ranking based on fuzzy logarithmic least squares method and fuzzy similarity technique. Oper. Res. Perspect. 2019, 6, 100122. [Google Scholar] [CrossRef]
  29. Li, J.; Liu, Y. Property analysis of triple implication method for approximate reasoning on Atanassov’s intuitionistic fuzzy sets. Iran. J. Fuzzy Syst. 2018, 15, 95–116. [Google Scholar]
  30. Lin, K. A new distance measure for MCDM problem using TOPSIS method. In Proceedings of the Proceedings—International Conference on Machine Learning and Data Engineering, iCMLDE 2019, Taipei, Taiwan, 2–4 December 2019; pp. 19–24. [Google Scholar]
  31. Mishra, A.R.; Rani, P. Interval-valued intuitionistic fuzzy WASPAS method: Application in reservoir flood control management policy. Group Decis. Negot. 2018, 27, 1047–1078. [Google Scholar] [CrossRef]
  32. Rani, P.; Jain, D.; Hooda, D.S. Shapley function based interval-valued intuitionistic fuzzy VIKOR technique for correlative multi-criteria decision making problems. Iran. J. Fuzzy Syst. 2018, 15, 25–54. [Google Scholar]
  33. Rouyendegh, B.D. The intuitionistic fuzzy ELECTRE model. Int. J. Manag. Sci. Eng.Manag. 2018, 13, 139–145. [Google Scholar] [CrossRef]
  34. Shen, F.; Ma, X.; Li, Z.; Xu, Z.; Cai, D. An extended intuitionistic fuzzy TOPSIS method based on a new distance measure with an application to credit risk evaluation. Inf. Sci. 2018, 428, 105–119. [Google Scholar] [CrossRef]
  35. Shokeen, J.; Rana, C. Fuzzy sets, advanced fuzzy sets and hybrids. In Proceedings of the 2017 International Conference on Energy, Communication, Data Analytics and Soft Computing, ICECDS, Chennai, Tamil Nadu, India, 1 August 2017; pp. 2538–2542. [Google Scholar]
  36. Wang, Y.; Wang, L.; Sangaiah, A.K. Generalized Pythagorean fuzzy information aggregation operators for multi-criteria decision making. In Proceedings of the ICNC-FSKD 2017—13th International Conference on Natural Computation, Fuzzy Systems, and Knowledge Discovery, Guilin, China, 29–31 July 2017; pp. 1410–1415. [Google Scholar]
  37. Wei, G. Some similarity measures for picture fuzzy sets and their applications. Iran. J. Fuzzy Syst. 2018, 15, 77–89. [Google Scholar]
  38. Zhang, L.; Liu, J.; Huang, B.; Li, H.; Zhou, X. Dynamic agent evaluation using intuitionistic fuzzy TOPSIS. In Proceedings of the 2018 IEEE 22nd International Conference on Computer Supported Cooperative Work in Design, CSCWD 2018, Nanjing, China, 9–11 May 2018; pp. 407–413. [Google Scholar]
  39. Zhou, W.; Chen, J.; Xu, Z.; Meng, S. Hesitant fuzzy preference envelopment analysis and alternative improvement. Inf. Sci. 2018, 465, 105–117. [Google Scholar] [CrossRef]
  40. Liang, Z.; Shi, P. Similarity Measures on Intuitionistic Fuzzy Sets. Pattern Recognit. Lett. 2003, 24, 2687–2693. [Google Scholar] [CrossRef]
  41. Atanassov, K. More on intuitionistic fuzzy sets. Fuzzy Sets Syst. 1989, 33, 37–46. [Google Scholar] [CrossRef]
  42. Atanassov, K. Intuitionistic Fuzzy Sets, Theory and Applications; Physica: Heidelberg, NY, USA, 1999. [Google Scholar]
  43. Li, H.; Wan, S. Improved BP method in vibration failure diagnosis of steam turbine generator set. J. Chongqing Univ. 1999, 22, 47–52. [Google Scholar]
  44. Chu, C.; Hung, K.; Julian, P. A complete pattern recognition approach under Atanassov’s intuitionistic fuzzy sets. Knowl. Based Syst. 2014, 66, 36–45. [Google Scholar] [CrossRef]
  45. Yusoff, B.; Taib, I.; Abdullah, L.; Wahab, A.F. A new similarity measure on intuitionistic fuzzy sets. Int. J. Comput. Math. Sci. 2011, 5, 70–74. [Google Scholar]
  46. Zeng, S. Some intuitionistic fuzzy weighted distance measures and their application to group decision making. Group Decis. Negot. 2013, 22, 281–298. [Google Scholar] [CrossRef]
  47. Dutta, P. An advanced dice similarity measure of generalized fuzzy numbers and its application in multicriteria decision making. Arab J. Basic Appl. Sci. 2020, 27, 75–92. [Google Scholar] [CrossRef] [Green Version]
  48. Rafiq, M.; Ashraf, S.; Abdullah, S.; Mahmood, T.; Muhammad, S. The cosine similarity measures of sphericalfuzzy sets and their applications in decision making. J. Intell. Fuzzy Syst. 2019, 36, 6059–6073. [Google Scholar] [CrossRef]
  49. Khan, M.J.; Kumam, P.; Deebani, W.; Kumam, W.; Shah, Z. Distance and similarity measures for spherical fuzzy sets and their applications in selecting mega projects. Mathematics 2020, 8, 519. [Google Scholar] [CrossRef] [Green Version]
  50. Muthuraj, R.; Devi, S. New similarity measure between intuitionistic fuzzy multisets based on tangent function and its application in medical diagnosis. Int. J. Recent Tech. Eng. 2019, 8, 161–165. [Google Scholar]
  51. Wu, M.; Chen, T.; Fan, J. 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]
  52. Kwan, C.; Budavari, B.; Gao, F.; Zhu, X. A hybrid color mapping approach to fusing MODIS and landsat images for forward prediction. Remote Sens. 2018, 10, 520. [Google Scholar] [CrossRef] [Green Version]
  53. Qu, Y.; Qi, H.; Ayhan, B.; Kwan, C.; Kidd, R. Does multispectral/hyperspectralpansharpening improve the performance of anomaly detection? In Proceedings of the International Geoscience and Remote Sensing Symposium (IGARSS), Fort Worth, TX, USA, 23–28 July 2017; pp. 6130–6133. [Google Scholar]
Table 1. Comparisons among several papers citing Li and Cheng [14].
Table 1. Comparisons among several papers citing Li and Cheng [14].
CounterexampleTheoretical
Improvement
New MeasureCheck Axiom A4Iterative AlgorithmReal Application
[14]
[20]
[17]
[21]
[22]
[19]
[15]
[18]
[23]
[16]
Table 2. Computation results for Examples 1–3.
Table 2. Computation results for Examples 1–3.
Example W S I F S ( C 1 , Q ) W S I F S ( C 2 , Q ) W S I F S ( C 3 , Q ) Implication
10.8483180.8887470.957349 C 3 C 2 C 1
20.9756410.9739630.967530 C 1 C 2 C 3
30.9685690.9744240.969626 C 2 C 3 C 1
Table 3. Data for patterns and samples (reproduced from Table 1 and Table 2 of Chu et al. [44]).
Table 3. Data for patterns and samples (reproduced from Table 1 and Table 2 of Chu et al. [44]).
Frequency Range
<0.4f0.5ff2f3f>3f
Pattern P 1 <0.06,0.84><0.84,0.02><0.20,0.75><0.02,0.89><0.20,0.75><0.01,0.92>
Pattern P 2 <0.01,0.93><0.02,0.90><0.90,0.01><0.08,0.85><0.01,0.89><0.02,0.93>
Pattern P 3 <0.01,0.94><0.01,0.94><0.40,0.42><0.40,0.44><0.28,0.56><0.01,0.61>
Sample B 1 <0.01,0.96><0.00,0.97><0.37,0.60><0.46,0.51><0.31,0.66><0.21,0.75>
Sample B 2 <0.00,0.98><0.05,0.92><0.69,0.27><0.04,0.93><0.03,0.84><0.00,0.97>
Table 4. Comparison of seven methods.
Table 4. Comparison of seven methods.
Sample B 1 Sample B 2
Patterns Patterns
P 1 P 2 P 3 P 1 P 2 P 3
[4] 0.7720.8570.9840.7680.9850.884
[44] 0.7790.8270.9180.7970.9390.822
[17]0.1630.3930.8390.1850.7950.481
[21] 0.5820.6960.9200.5930.8970.741
[43] 0.5540.7040.9260.5820.8930.721
[45] 0.6700.7450.9530.7130.9330.787
[46] 0.5820.6970.9230.5930.8980.747
[47]0.7730.9270.9800.6040.6290.606
[48]0.4220.4310.6370.4250.5550.137
[49]0.3660.6430.6520.4010.5440.235
[50]0.8050.8530.9040.7880.8350.713
[51] with (61)0.7970.7150.9080.6330.8340.423
[51] with (62)0.9240.9200.9750.7900.9020.773
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Chu, C.-H.; Yen, C.-P.; Lin, Y.-F. The Fourth Axiom of Similarity Measures. Symmetry 2020, 12, 1735. https://doi.org/10.3390/sym12101735

AMA Style

Chu C-H, Yen C-P, Lin Y-F. The Fourth Axiom of Similarity Measures. Symmetry. 2020; 12(10):1735. https://doi.org/10.3390/sym12101735

Chicago/Turabian Style

Chu, Chun-Hsiao, Chih-Ping Yen, and Yi-Fong Lin. 2020. "The Fourth Axiom of Similarity Measures" Symmetry 12, no. 10: 1735. https://doi.org/10.3390/sym12101735

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