# A New Similarity Measure between Intuitionistic Fuzzy Sets and Its Application to Pattern Recognition

Authors: Yafei Song; Xiaodan Wang; Lei Lei; Aijun Xue
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

As a generation of ordinary fuzzy set, the concept of intuitionistic fuzzy set (IFS), characterized both by a membership degree and by a nonmembership degree, is a more flexible way to cope with the uncertainty. Similarity measures of intuitionistic fuzzy sets are used to indicate the similarity degree between intuitionistic fuzzy sets. Although many similarity measures for intuitionistic fuzzy sets have been proposed in previous studies, some of those cannot satisfy the axioms of similarity or provide counterintuitive cases. In this paper, a new similarity measure and weighted similarity measure between IFSs are proposed. It proves that the proposed similarity measures satisfy the properties of the axiomatic definition for similarity measures. Comparison between the previous similarity measures and the proposed similarity measure indicates that the proposed similarity measure does not provide any counterintuitive cases. Moreover, it is demonstrated that the proposed similarity measure is capable of discriminating difference between patterns.


---

## Body

## 1. Introduction

Since it was proposed by Zadeh [1], the theory of fuzzy set (FS) has achieved great success due to its capability of handling uncertainty. Therefore, over the last decades, several higher order fuzzy sets have been introduced in the literature. Intuitionistic fuzzy set (IFS), as one of the higher order fuzzy sets, was proposed by Atanassov [2] to deal with vagueness. The main advantage of the IFS is its property to cope with the uncertainty that may exist due to information impression. Because it assigns to each element a membership degree, a nonmembership degree, and a hesitation degree, IFS constitutes an extension of Zadeh’s fuzzy set which only assigns to each element a membership degree [3]. So IFS is regarded as a more effective way to deal with vagueness than fuzzy set. Although Gau and Buehrer later presented vague set [4], it was pointed out by Bustince and Burillo that the notion of vague sets was the same as that of IFS [5].The definition of similarity measure between two IFSs is one of the most interesting topics in IFSs theory. A similarity measure is defined to compare the information carried by IFSs. Measures of similarity between IFSs, as an important tool for decision making, pattern recognition, machine learning, and image processing, have received much attention in recent years [6, 7]. Many similarity measures have been proposed. A few of them come from the well-known distance measures. The first study was carried out by Szmidt and Kacprzyk [8] extending the well-known distances measures, such as the Hamming distance and the Euclidian distance, to IFS environment and comparing them with the approaches used for ordinary fuzzy sets. However, Wang and Xin [9] implied that the distance measures of Szmidt and Kacprzyk [8] were not effective in some cases. Therefore, several new distance measures were proposed and applied to pattern recognition. Grzegorzewski [10] also extended the Hamming distance, the Euclidean distance, and their normalized counterparts to IFS environment. Later, Chen [11] pointed out that some errors existed in Grzegorzewski [10] by showing some counterexamples. Hung and Yang [12] extended the Hausdorff distance to IFSs and proposed three similarity measures.On the other hand, instead of extending the well-known measures, some studies defined new similarity measures for IFSs. Dengfeng and Chuntian [13] suggested a new similarity measure for IFSs based on the membership degree and the nonmembership degree. Mitchell [14] showed that the similarity measure of Dengfeng and Chuntian [13] had some counterintuitive cases and modified the similarity measure based on statistical point of view. Moreover, Liang and Shi [15] presented some examples to show that the similarity measure of Dengfeng and Chuntian [13] was not reasonable for some conditions and therefore proposed several new similarity measures for IFSs. Li et al. [16] analyzed, compared, and summarized the existing similarity measures between IFSs/vague sets by their counterintuitive examples in pattern recognition. Ye [7] conducted a similar comparative study of the existing similarity measures between IFSs and proposed a cosine similarity measure and a weighted cosine similarity measure. Hwang et al. [17] proposed a similarity measure for IFSs in which Sugeno integral was used for aggregation. The proposed similarity measure was applied to clustering problem. Xu [18] introduced a series of similarity measures for IFSs and applied them to multiple attribute decision making problem based on intuitionistic fuzzy information. Xu and Chen [19] introduced a series of distance and similarity measures, which are various combinations and generalizations of the weighted Hamming distance, the weighted Euclidean distance, and the weighted Hausdorff distance. Xu and Yager [20] developed a similarity measure between IFSs and applied the developed similarity measure for consensus analysis in group decision making based on intuitionistic fuzzy preference relations. Xia and Xu [6] proposed a series of distance measures based on the intuitionistic fuzzy point operators. In addition to these studies, some works have been interested in relationships between distance measure, similarity measure, and entropy of IFSs. Zeng and Guo [21] investigated the relationship among the normalized distance, the similarity measure, the inclusion measure, and the entropy of interval-valued fuzzy sets. It was also showed that the similarity measure, the inclusion measure, and the entropy of interval-valued fuzzy sets could be induced by the normalized distance of interval-valued fuzzy sets based on their axiomatic definitions. Wei et al. [22] introduced an entropy measure generalizing the existing entropy measures for IFS and IFSs. Also an approach was introduced to construct similarity measures using entropy measures for IFS and IFSs. Boran and Akay [23] proposed a new general type of similarity measure for IFS with two parameters, expressing L
p norm and the level of uncertainty, respectively. This similarity measure can also make sense in terms of counterintuitive cases.Moreover, Zhang and Yu [24] presented a new distance (or similarity) measure based on interval comparison, where the IFSs were, respectively, transformed into the symmetric triangular fuzzy numbers. Comparison with the widely used methods indicated that the proposed method contained more information, with much less loss of information. Li et al. [25] introduced an axiomatic definition of the similarity measure of IFSs. The relationship between the entropy and the similarity measure of IFS was investigated in detail. It was proved that the similarity measure and the entropy of IFS can be transformed into each other based on their axiomatic definitions. Farhadinia [26] generalized results on the entropy of interval-valued fuzzy sets (IVFSs) based on the intuitionistic distance and its relationship with similarity measure. Based on the set of new axioms, he also proved some theorems that entropy and similarity measure for IVFSs can be transformed by each other in a general way. Li [27] defined two dissimilarity measures between intuitionistic fuzzy sets of a finite set, and it was proved that both of the measures are metrical. Papakostas et al. [28] investigated the main theoretical and computational properties of the measures as well as the relationships between them. A comparison of the distance and similarity measures was carried out by them, from a pattern recognition point of view.Among similarity measures proposed by other authors, some of those, however, cannot satisfy the axioms of similarity or provide counterintuitive cases or are produced by complex formats. Therefore, we propose new similarity measures with relative simple expression. The proposed similarity measure depends on the triplet, membership degree, nonmembership degree, and hesitation margin. This paper proves that the proposed measures satisfy the properties of the axiomatic definition for similarity measures. In addition, several numerical examples are provided to compare the proposed measure with a number of existing measures.The remainder of this paper is organized as follows. Section2 recalls the definitions related to the IFSs and lists the properties that a distance measure for IFSs and a similarity measure for IFSs should possess. In Section 3, the existing similarity measures for IFSs will be recalled. The new similarity measure, together with its proofs, is presented in Section 4. Comparison between the proposed similarity measure and the existing similarity measures is carried out in Section 5. The application of the proposed similarity measure to pattern recognition is presented in Section 6, followed by the conclusion of this paper in Section 7.


## 2. Preliminaries

In this section, we briefly recall the basic concepts related to IFS and then list the properties of the axiomatic definition for similarity measures.Definition 1.
LetX
=
{
x
1
,
x
2
,
…
,
x
n
} be a universe of discourse; then, a fuzzy set A in X is defined as follows [1]:
(1)
A
=
{
〈
x
,
μ
A
(
x
)
〉
∣
x
∈
X
}
,
where μ
A
(
x
)
:
X
→
[
0,1
] is the membership degree.Definition 2.
An IFSA in X defined by Atanassov can be written as [2]
(2)
A
=
{
〈
x
,
μ
A
(
x
)
,
v
A
(
x
)
〉
∣
x
∈
X
}
,
where μ
A
(
x
)
:
X
→
[
0,1
] and v
A
(
x
)
:
X
→
[
0,1
] are membership degree and nonmembership degree, respectively, with the condition
(3)
0
≤
μ
A
(
x
)
+
v
A
(
x
)
≤
1
.
π
A
(
x
) determined by the following expression:
(4)
π
A
(
x
)
=
1
-
μ
A
(
x
)
-
v
A
(
x
)
,
is called the hesitancy degree of the element x
∈
X to the set A, and π
A
(
x
)
∈
[
0,1
],  for all x
∈
X.
π
A
(
x
) is also called the intuitionistic index of x to A. Greater π
A
(
x
) indicates more vagueness on x. Obviously, when π
A
(
x
)
=
0, for all x
∈
X, the IFS degenerates into an ordinary fuzzy set.
In the sequel, the couple〈
μ
A
(
x
)
,
v
A
(
x
)
〉 is called an IFS or intuitionistic fuzzy value (IFV) for clarity. Let IFSs
(
X
) denote the set of all IFSs in X.Definition 3.
ForA
∈
IFSs
(
X
) and B
∈
IFSs
(
X
), some relations between them are defined as(R1)
A
⊂
B if and only if  for all x
∈
X
μ
A
(
x
)
≤
μ
B
(
x
), v
A
(
x
)
≥
v
B
(
x
);
(R2)
A
=
B if and only if  for all x
∈
X
μ
A
(
x
)
=
μ
B
(
x
), v
A
(
x
)
=
v
B
(
x
);
(R3)
A
C
=
{
〈
x
,
v
A
(
x
)
,
μ
A
(
x
)
〉
∣
x
∈
X
}, where A
C is the complement of A.Definition 4.
LetD denote the mapping D
:
IFS
×
IFS
→
[
0,1
]; if D
(
A
,
B
) satisfies the following properties, D
(
A
,
B
) is called a distance between A
∈
IFSs
(
X
) and B
∈
IFSs
(
X
). Consider the following:(DP1)
0
≤
D
(
A
,
B
)
≤
1;
(DP2)
D
(
A
,
B
)
=
0, if and only if A
=
B;
(DP3)
D
(
A
,
B
)
=
D
(
B
,
A
);
(DP4)
ifA
⊆
B
⊆
C, then D
(
A
,
B
)
≤
D
(
A
,
C
), and D
(
B
,
C
)
≤
D
(
A
,
C
).Definition 5.
The mappingS
:
IFS
×
IFS
→
[
0,1
] is called a degree of similarity between A
∈
IFSs
(
X
) and B
∈
IFSs
(
X
), if S
(
A
,
B
) satisfies the following properties:(SP1)
0
≤
S
(
A
,
B
)
≤
1;
(SP2)
S
(
A
,
B
)
=
1, if and only if A
=
B;
(SP3)
S
(
A
,
B
)
=
S
(
B
,
A
);
(SP4)
ifA
⊆
B
⊆
C, then S
(
A
,
B
)
≥
S
(
A
,
C
), and S
(
B
,
C
)
≥
S
(
A
,
C
).
Because distance and similarity measures are complementary concepts, similarity measures can be used to define distance measures and vice versa.


## 3. Existing Similarity Measures

LetX
=
{
x
1
,
x
2
,
…
,
x
n
} be a universe of discourse. A
∈
IFSs
(
X
) and B
∈
IFSs
(
X
) are two IFSs in X, denoted by A
=
{
〈
x
,
μ
A
(
x
)
,
v
A
(
x
)
〉
∣
x
∈
X
} and B
=
{
〈
x
,
μ
B
(
x
)
,
v
B
(
x
)
〉
∣
x
∈
X
}, respectively.Considering the outcome of the analysis presented by Bustince and Burillo [5], which concluded that the intuitionistic fuzzy sets and the vague sets are similar, Chen [29] proposed the first similarity measure for IFSs defined as
(5)
S
C
(
A
,
B
)
=
1
-
∑
i
=
1
n
|
(
μ
A
(
x
i
)
-
v
A
(
x
i
)
)
-
(
μ
B
(
x
i
)
-
v
B
(
x
i
)
)
|
2
n
.Hong and Kim [30] proposed the following measure to overcome the deficiency of Chen’s similarity measure:
(6)
S
H
(
A
,
B
)
=
1
-
∑
i
=
1
n
|
(
μ
A
(
x
i
)
-
μ
B
(
x
i
)
)
-
(
v
A
(
x
i
)
-
v
B
(
x
i
)
)
|
2
n
.Following the work of Hong and Kim, Li and Xu [31] proposed new similarity measures:
(7)
S
L
(
A
,
B
)
=
1
-
∑
i
=
1
n
|
(
μ
A
(
x
i
)
-
v
A
(
x
i
)
)
-
(
μ
B
(
x
i
)
-
v
B
(
x
i
)
)
|
4
n
-
∑
i
=
1
n
(
|
μ
A
(
x
i
)
-
μ
B
(
x
i
)
|
+
|
v
A
(
x
i
)
-
v
B
(
x
i
)
|
)
4
n
.Taking the membership distance and the nonmember ship distance between the two IFSs into consideration, Li et al. [32] proposed a similarity measure as follows:
(8)
S
O
(
A
,
B
)
=
1
-
∑
i
=
1
n
(
(
μ
A
(
x
i
)
-
μ
B
(
x
i
)
)
2
+
(
v
A
(
x
i
)
-
v
B
(
x
i
)
)
2
)
2
n
.Dengfeng and Chuntian [13] pointed out that some similarity could not deal with the similarity between IFSs well. So they defined a new similarity measure for pattern recognition:
(9)
S
DC
(
A
,
B
)
=
1
-
∑
i
=
1
n
|
φ
A
(
x
i
)
-
φ
B
(
x
i
)
|
p
n
p
,
where φ
A
(
x
i
)
=
(
μ
A
(
x
i
)
+
1
-
v
A
(
x
i
)
)
/
2 and  φ
B
(
x
i
)
=
(
μ
B
(
x
i
)
+
1
-
v
B
(
x
i
)
)
/
2.Mitchell [14] found that the similarity measure S
DC
(
A
,
B
) would characterize two different IFSs as identical. To overcome this drawback, he provided a more realistic strong similarity measure of the following form:
(10)
S
HB
(
A
,
B
)
=
1
2
(
ρ
μ
(
A
,
B
)
+
ρ
v
(
A
,
B
)
)
,
where ρ
μ
(
A
,
B
)
=
1
-
∑
i
=
1
n
|
μ
A
(
x
i
)
-
μ
B
(
x
i
)
|
p
/
n
p, ρ
v
(
A
,
B
)
=
1
-
∑
i
=
1
n
|
v
A
(
x
i
)
-
v
B
(
x
i
)
|
p
/
n
p.Liang and Shi [15] proposed the following three similarity measures:
(11)
S
e
p
(
A
,
B
)
=
1
-
∑
i
=
1
n
(
ϕ
μ
(
x
i
)
+
ϕ
v
(
x
i
)
)
p
n
p
,
where ϕ
μ
(
x
i
)
=
|
μ
A
(
x
i
)
-
μ
B
(
x
i
)
|
/
2, ϕ
v
(
x
i
)
=
|
(
1
-
v
A
(
x
i
)
)
-
(
1
-
v
B
(
x
i
)
)
|
/
2. Consider
(12)
S
s
p
(
A
,
B
)
=
1
-
∑
i
=
1
n
|
ψ
s
1
(
x
i
)
+
ψ
s
2
(
x
i
)
|
p
n
p
,
where ψ
s
1
(
x
i
)
=
|
m
A
1
(
x
i
)
-
m
B
1
(
x
i
)
|
/
2,  ψ
s
2
(
x
i
)
=
|
m
A
2
(
x
i
)
-
m
B
2
(
x
i
)
|
/
2,  m
A
1
(
x
i
)
=
|
μ
A
(
x
i
)
+
m
A
(
x
i
)
|
/
2,  m
B
1
(
x
i
)
=
|
μ
B
(
x
i
)
+
m
B
(
x
i
)
|
/
2,  m
A
2
(
x
i
)
=
|
1
-
v
A
(
x
i
)
+
m
A
(
x
i
)
|
/
2,  m
B
2
(
x
i
)
=
|
1
-
v
B
(
x
i
)
+
m
B
(
x
i
)
|
/
2,  m
A
(
x
i
)
=
|
1
-
v
A
(
x
i
)
+
μ
A
(
x
i
)
|
/
2, and  m
B
(
x
i
)
=
|
1
-
v
B
(
x
i
)
+
μ
B
(
x
i
)
|
/
2. Consider
(13)
S
h
p
(
A
,
B
)
=
1
-
∑
i
=
1
n
(
η
1
(
x
i
)
+
η
2
(
x
i
)
+
η
3
(
x
i
)
)
p
3
n
p
,
where η
1
(
x
i
)
=
ϕ
μ
(
x
i
)
+
ϕ
v
(
x
i
) (defined in S
e
p),  η
2
(
x
i
)
=
|
φ
μ
(
x
i
)
-
φ
v
(
x
i
)
| (defined in S
DC),  η
3
(
x
i
)
=
max
⁡
(
l
A
(
x
i
)
,
l
B
(
x
i
)
)
-
min
⁡
(
l
A
(
x
i
)
,
l
B
(
x
i
)
),  l
A
(
x
i
)
=
(
1
-
μ
A
(
x
i
)
-
v
A
(
x
i
)
)
/
2, and  l
B
(
x
i
)
=
(
1
-
μ
B
(
x
i
)
-
v
B
(
x
i
)
)
/
2.Hung and Yang [12] introduced three similarity measures based on the Hausdorff distance d
H
(
A
,
B
):
(14)
S
HY
1
(
A
,
B
)
=
1
-
d
H
(
A
,
B
)
,
S
HY
2
(
A
,
B
)
=
e
-
d
H
(
A
,
B
)
-
e
-
1
1
-
e
-
1
,
S
HY
3
(
A
,
B
)
=
1
-
d
H
(
A
,
B
)
1
+
d
H
(
A
,
B
)
,
where d
H
(
A
,
B
)
=
(
1
/
n
)
∑
i
=
1
n
max
⁡
(
|
μ
A
(
x
i
)
-
μ
B
(
x
i
)
|
,
|
v
A
(
x
i
)
-
v
B
(
x
i
)
|
).Based on the concept of the cosine similarity measure for fuzzy sets, a cosine similarity measure was proposed by Ye [7] as follows:
(15)
C
IFS
(
A
,
B
)
=
1
n
∑
i
=
1
n
μ
A
(
x
i
)
μ
B
(
x
i
)
+
v
A
(
x
i
)
v
B
(
x
i
)
(
μ
A
(
x
i
)
)
2
+
(
v
A
(
x
i
)
)
2
(
μ
B
(
x
i
)
)
2
+
(
v
B
(
x
i
)
)
2
.One of the latest results on similarity measure is the biparametric similarity measure for IFS, proposed by Boran and Akay [23]. It has the following form with two parameters:
(16)
S
t
p
(
A
,
B
)
=
1
-
(
∑
i
=
1
n
1
2
n
(
1
+
p
)
{
-
(
u
A
(
x
i
)
-
u
B
(
x
i
)
)
|
p

|
t
(
μ
A
(
x
i
)
-
μ
B
(
x
i
)
)
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
-
(
v
A
(
x
i
)
-
v
B
(
x
i
)
)
|
p
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
+
|
t
(
v
A
(
x
i
)
-
v
B
(
x
i
)
)
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
-
(
u
A
(
x
i
)
-
u
B
(
x
i
)
)
|
p
}


∑
i
=
1
n
1
2
n
(
1
+
p
)
)
1
/
p
,
where p
=
1,2
,
3
,
… is the L
p norm and t
=
2,3
,
4
,
… identifies the level of uncertainty.


## 4. A New Similarity Measure

LetA
=
{
〈
x
,
μ
A
(
x
)
,
v
A
(
x
)
〉
∣
x
∈
X
} and B
=
{
〈
x
,
μ
B
(
x
)
,
v
B
(
x
)
〉
∣
x
∈
X
} be two IFSs in X. We propose a new similarity measure:
(17)
S
Y
(
A
,
B
)
=
1
2
n
∑
i
=
1
n
(
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)

μ
A
(
x
i
)
μ
B
(
x
i
)
lllllllllllllllillll
+
2
v
A
(
x
i
)
v
B
(
x
i
)
+
π
A
(
x
i
)
π
B
(
x
i
)
l
l
l
l
l
l
l
l
l
l
l
l
l
i
l
l
l
l
l
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
)
,
where π
A
(
x
i
) and π
B
(
x
i
) are, respectively, the hesitancy degree of the element x
i
∈
X to the sets A and B.Theorem 6.
S
Y
(
A
,
B
) is the similarity measure between two IFSs A and B in X.Proof.
For the sake of simplicity, IFSsA and B are denoted by A
=
{
〈
μ
A
(
x
i
)
,
v
A
(
x
i
)
〉
} and B
=
{
〈
μ
B
(
x
i
)
,
v
B
(
x
i
)
〉
}, respectively.(SP1)
For eachx
,
y
∈
[
0
,
+
∞
], we have 0
≤
x
y
≤
(
x
+
y
)
/
2.
Given0
≤
μ
A
(
x
i
)
≤
1, 0
≤
v
A
(
x
i
)
≤
1, 0
≤
π
A
(
x
i
)
≤
1, 0
≤
μ
B
(
x
i
)
≤
1, 0
≤
v
B
(
x
i
)
≤
1, 0
≤
π
B
(
x
i
)
≤
1, 0
≤
1
-
v
A
(
x
i
)
≤
1, and 0
≤
1
-
v
B
(
x
i
)
≤
1, we get
(18)
0
≤
μ
A
(
x
i
)
μ
B
(
x
i
)
≤
μ
A
(
x
i
)
+
μ
B
(
x
i
)
2
,
0
≤
v
A
(
x
i
)
v
B
(
x
i
)
≤
v
A
(
x
i
)
+
v
B
(
x
i
)
2
,
0
≤
π
A
(
x
i
)
π
B
(
x
i
)
≤
π
A
(
x
i
)
+
π
B
(
x
i
)
2
,
0
≤
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
≤
1
-
v
A
(
x
i
)
+
1
-
v
B
(
x
i
)
2
.
Then we have(19)
0
≤
μ
A
(
x
i
)
μ
B
(
x
i
)
+
2
v
A
(
x
i
)
v
B
(
x
i
)
+
π
A
(
x
i
)
π
B
(
x
i
)
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
≤
μ
A
(
x
i
)
+
μ
B
(
x
i
)
2
+
2
·
v
A
(
x
i
)
+
v
B
(
x
i
)
2
+
π
A
(
x
i
)
+
π
B
(
x
i
)
2
+
1
-
v
A
(
x
i
)
+
1
-
v
B
(
x
i
)
2
=
1
+
μ
A
(
x
i
)
+
v
A
(
x
i
)
+
π
A
(
x
i
)
2
+
μ
B
(
x
i
)
+
v
B
(
x
i
)
+
π
B
(
x
i
)
2
=
2
.
Hence,(20)
0
≤
∑
i
=
1
n
(
μ
A
(
x
i
)
μ
B
(
x
i
)
+
2
v
A
(
x
i
)
v
B
(
x
i
)
lllllllllll
+
π
A
(
x
i
)
π
B
(
x
i
)
l
l
l
l
l
l
l
l
l
l
l
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
)
≤
2
n
.
Finally, we get the following inequality:0
≤
S
Y
(
A
,
B
)
≤
(
1
/
2
n
)
·
2
n
=
1.
Thus,0
≤
S
Y
(
A
,
B
)
≤
1.(SP2)
We know thatx
y assumes its maximum value (
x
+
y
)
/
2 when x
=
y. Therefore, we have
(21)
S
Y
(
A
,
B
)
=
1
⟺
μ
A
(
x
i
)
μ
B
(
x
i
)
+
2
v
A
(
x
i
)
v
B
(
x
i
)
lllllll
+
π
A
(
x
i
)
π
B
(
x
i
)
lllllll
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
=
2
⟺
μ
A
(
x
i
)
μ
B
(
x
i
)
,
v
A
(
x
i
)
v
B
(
x
i
)
,
llllllll
π
A
(
x
i
)
π
B
(
x
i
)
,
1
-
v
A
(
x
i
)
=
1
-
v
B
(
x
i
)
⟺
A
=
B
.
Thus,S
Y
(
A
,
B
)
=
1, if and only if A
=
B.(SP3)
It is easy to note that the expression ofS
Y
(
A
,
B
) is commutative. So we have
(22)
S
Y
(
A
,
B
)
=
S
Y
(
B
,
A
)
.
(SP4)
LetC be another IFS in X, denoted by C
=
{
〈
μ
C
(
x
i
)
,
v
C
(
x
i
)
〉
}. A, B, and C satisfy the relation A
⊆
B
⊆
C. Then, we have 0
≤
μ
A
(
x
i
)
≤
μ
B
(
x
i
)
≤
μ
C
(
x
i
)
≤
1 and 0
≤
v
C
(
x
i
)
≤
v
B
(
x
i
)
≤
v
A
(
x
i
)
≤
1, for all x
∈
X. Based on (17), the similarity measures between (
B
,
C
) and (
A
,
C
) can be written as
(23)
S
Y
(
B
,
C
)
=
1
2
n
∑
i
-
1
n
(
μ
B
(
x
i
)
μ
C
(
x
i
)
+
v
B
(
x
i
)
v
C
(
x
i
)
lllllllllllllllll
+
π
B
(
x
i
)
π
C
(
x
i
)
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
+
(
1
-
v
B
(
x
i
)
)
(
1
-
v
C
(
x
i
)
)
)
,
S
Y
(
A
,
C
)
=
1
2
n
∑
i
=
1
n
(
μ
A
(
x
i
)
μ
C
(
x
i
)
+
v
A
(
x
i
)
v
C
(
x
i
)
lllllllllllllllll
+
π
A
(
x
i
)
π
C
(
x
i
)
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
C
(
x
i
)
)
)
.
Fora
,
b
∈
[
0,1
], a
+
b
≤
1 we can define a function f as
(24)
f
(
x
,
y
)
=
a
x
+
2
b
y
+
(
1
-
a
-
b
)
(
1
-
x
-
y
)
+
(
1
-
b
)
(
1
-
y
)
,
where x
,
y
∈
[
0,1
], x
+
y
∈
[
0,1
].
Then we have(25)
∂
f
∂
x
=
a
2
x
-
1
-
a
-
b
2
1
-
x
-
y
,
∂
f
∂
y
=
b
y
-
1
-
a
-
b
2
1
-
x
-
y
-
1
-
b
2
1
-
y
.
Givena
≤
x
≤
1, b
≤
1, we have
(26)
∂
f
∂
x
|
y
=
b
=
a
2
x
-
1
-
a
-
b
2
1
-
x
-
y
=
(
a
-
x
)
(
1
-
b
)
2
x
(
1
-
x
-
y
)
(
a
(
1
-
x
-
y
)
+
(
1
-
a
-
b
)
x
)
≤
0
,
which means that f is a decreasing function of x, when y
=
b, x
≥
a.
For0
≤
x
≤
a, b
≤
1, we can get (
∂
f
/
∂
x
)
|
y
=
b
≥
0, which means that f is an increasing function of x, when y
=
b, x
≤
a.
Similarly, as for∂
f
/
∂
y, we can get
(27)
∂
f
∂
y
|
x
=
a
=
(
b
-
y
)
(
1
-
a
)
2
y
(
1
-
x
-
y
)
(
b
(
1
-
x
-
y
)
+
(
1
-
a
-
b
)
y
)
+
b
-
y
2
y
(
1
-
y
)
(
b
(
1
-
y
)
+
(
1
-
b
)
y
)
,
which reveals that f is an increasing function of y for x
=
a, y
≤
b, but a decreasing function when x
=
a, y
≥
b.
Givena
=
μ
A
(
x
i
), b
=
v
A
(
x
i
), and two couples (
μ
B
(
x
i
)
,
v
B
(
x
i
)
), (
μ
C
(
x
i
)
,
v
C
(
x
i
)
), satisfying a
=
μ
A
(
x
i
)
≤
μ
B
(
x
i
)
≤
μ
C
(
x
i
), v
C
(
x
i
)
≤
v
B
(
x
i
)
≤
v
A
(
x
i
)
=
b, we can get
(28)
f
(
μ
C
(
x
i
)
,
b
)
≤
f
(
μ
B
(
x
i
)
,
b
)
≤
f
(
a
,
b
)
,
f
(
a
,
v
C
(
x
i
)
)
≤
f
(
a
,
v
B
(
x
i
)
)
≤
f
(
a
,
b
)
.
Sincef
(
x
,
y
) is a continuous concave function, it is true that f
(
μ
C
(
x
i
)
,
v
C
(
x
i
)
)
≤
f
(
μ
B
(
x
i
)
,
v
B
(
x
i
)
); that is,
(29)
μ
A
(
x
i
)
μ
C
(
x
i
)
+
v
A
(
x
i
)
v
C
(
x
i
)
+
π
A
(
x
i
)
π
C
(
x
i
)
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
C
(
x
i
)
)
≤
μ
A
(
x
i
)
μ
B
(
x
i
)
+
2
v
A
(
x
i
)
v
B
(
x
i
)
+
π
A
(
x
i
)
π
B
(
x
i
)
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
,
which indicates that S
Y
(
A
,
B
)
≥
S
Y
(
A
,
C
).
Similarly, if we supposea
=
μ
C
(
x
i
)
b
=
v
C
(
x
i
), considering another two couples (
μ
A
(
x
i
)
,
v
A
(
x
i
)
), (
μ
B
(
x
i
)
,
v
B
(
x
i
)
), where μ
A
(
x
i
)
≤
μ
B
(
x
i
)
≤
μ
C
(
x
i
)
=
a, b
=
v
C
(
x
i
)
≤
v
B
(
x
i
)
≤
v
A
(
x
i
), we have
(30)
f
(
μ
A
(
x
i
)
,
b
)
≤
f
(
μ
B
(
x
i
)
,
b
)
≤
f
(
a
,
b
)
,
f
(
a
,
v
A
(
x
i
)
)
≤
f
(
a
,
μ
B
(
x
i
)
)
≤
f
(
a
,
b
)
.
Considering the continuity and concavity of f
(
x
,
y
), we can finally get f
(
μ
A
(
x
i
)
,
v
A
(
x
i
)
)
≤
f
(
μ
B
(
x
i
)
,
v
B
(
x
i
)
), also written as
(31)
μ
A
(
x
i
)
μ
C
(
x
i
)
+
v
A
(
x
i
)
v
C
(
x
i
)
+
π
A
(
x
i
)
π
C
(
x
i
)
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
C
(
x
i
)
)
≤
μ
B
(
x
i
)
μ
C
(
x
i
)
+
2
v
B
(
x
i
)
v
C
(
x
i
)
+
π
B
(
x
i
)
π
C
(
x
i
)
+
(
1
-
v
B
(
x
i
)
)
(
1
-
v
C
(
x
i
)
)
.
So we haveS
Y
(
B
,
C
)
≥
S
Y
(
A
,
C
).
Thus,S
Y
(
A
,
B
) satisfies (SP4).
So the similarity measureS
Y
(
A
,
B
) satisfies all properties in Definition 5. It is a similarity measure between IFSs.Considering the weights ofx
i, we can define the weighted similarity between two IFSs as follows:
(32)
S
WY
(
A
,
B
)
=
1
2
∑
i
=
1
n
w
i
(
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)

μ
A
(
x
i
)
μ
B
(
x
i
)
lllllllllllllllllllllllllllllllll
+
2
v
A
(
x
i
)
v
B
(
x
i
)
+
π
A
(
x
i
)
π
B
(
x
i
)
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
)
,
where w
i is the weights factor of the features x
i, w
i
∈
[
0,1
] and ∑
i
=
1
n
w
i
=
1.Theorem 7.
S
W
Y
(
A
,
B
) is the similarity measure between two IFSs A and B in X.Proof.
(SP1) From the proof of (SP1) in the last theorem, we can get(33)
0
≤
∑
i
=
1
n
w
i
(
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)

μ
A
(
x
i
)
μ
B
(
x
i
)
+
2
v
A
(
x
i
)
v
B
(
x
i
)
lllllllllllllll
+
π
A
(
x
i
)
π
B
(
x
i
)
l
l
l
l
l
l
l
l
l
l
l
l
l
l
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
)
≤
∑
i
=
1
n
2
w
i
=
2
·
∑
i
=
1
n
w
i
=
2
.
Therefore,0
≤
S
WY
(
A
,
B
)
≤
1.
(SP2) Considering the implication rule in the proof of (SP2) for Theorem6, we have
(34)
S
WY
(
A
,
B
)
=
1
⟺
w
i
(

μ
A
(
x
i
)
μ
B
(
x
i
)
lllllllllllllllllllll
+
2
v
A
(
x
i
)
v
B
(
x
i
)
lllllllllllllllllllll
+
π
A
(
x
i
)
π
B
(
x
i
)
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
)
llllllllllllll
=
2
w
i
l
l
l
l
l
l
⟺
μ
A
(
x
i
)
μ
B
(
x
i
)
+
2
v
A
(
x
i
)
v
B
(
x
i
)
llllllllllllll
+
π
A
(
x
i
)
π
B
(
x
i
)
llllllllllllll
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
=
2
l
l
l
l
l
l
⟺
μ
A
(
x
i
)
μ
B
(
x
i
)
,
v
A
(
x
i
)
v
B
(
x
i
)
,
l
l
l
l
l
l
l
l
l
l
l
l
l
l
π
A
(
x
i
)
π
B
(
x
i
)
,
1
-
v
A
(
x
i
)
=
1
-
v
B
(
x
i
)
l
l
l
l
l
l
⟺
A
=
B
.
So we getS
WY
(
A
,
B
)
=
1
⇔
A
=
B.
(SP3) It is straightforward thatS
WY
(
A
,
B
) satisfies (SP3).
(SP4) Since allw
i
≥
0, we can get
(35)
w
i
(

(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
μ
A
(
x
i
)
μ
C
(
x
i
)
+
v
A
(
x
i
)
v
C
(
x
i
)
l
l
l
l
l
+
π
A
(
x
i
)
π
C
(
x
i
)
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
C
(
x
i
)
)
)
≤
w
i
(
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
μ
A
(
x
i
)
μ
B
(
x
i
)
+
2
v
A
(
x
i
)
v
B
(
x
i
)
l
l
l
l
l
l
l
l
l
+
π
A
(
x
i
)
π
B
(
x
i
)
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
)
,
w
i
(
(
1
-
v
A
(
x
i
)
)
(
1
-
v
C
(
x
i
)
)
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
μ
A
(
x
i
)
μ
C
(
x
i
)
+
v
A
(
x
i
)
v
C
(
x
i
)
llllll
+
π
A
(
x
i
)
π
C
(
x
i
)
+
(
1
-
v
A
(
x
i
)
)
(
1
-
v
C
(
x
i
)
)
)
≤
w
i
(
(
1
-
v
A
(
x
i
)
)
(
1
-
v
C
(
x
i
)
)
(
1
-
v
A
(
x
i
)
)
(
1
-
v
B
(
x
i
)
)
μ
B
(
x
i
)
μ
C
(
x
i
)
+
2
v
B
(
x
i
)
v
C
(
x
i
)
l
l
l
l
l
l
l
l
l
l
+
π
B
(
x
i
)
π
C
(
x
i
)
+
(
1
-
v
B
(
x
i
)
)
(
1
-
v
C
(
x
i
)
)
)
.
Finally we haveS
WY
(
A
,
B
)
≥
S
WY
(
A
,
C
)
,
S
WY
(
B
,
C
)
≥
S
WY
(
A
,
C
).
So far, we have finished the proof thatS
WY
(
A
,
B
) is a similarity measure between IFSs A and B.


## 5. Numerical Comparisons

In order to illustrate the superiority of the proposed similarity measure, a comparison between the proposed similarity measure and all the existing similarity measures is conducted based on the numerical cases in [23]. Table 1 presents a comprehensive comparison of the similarity measures for IFS with counterintuitive examples (p
=
1 for S
HB, S
e
p, S
s
p, S
h
p and p
=
1, t
=
2 for S
t
p).Table 1
The comparison of similarity measures (counterintuitive cases are in bold type).
1
2
3
4
5
6
A
〈
0.3,0.3
〉
〈
0.3,0.4
〉
〈
1,0
〉
〈
0.5,0.5
〉
〈
0.4,0.2
〉
〈
0.4,0.2
〉
B
〈
0.4,0.4
〉
〈
0.4,0.3
〉
〈
0,0
〉
〈
0,0
〉
〈
0.5,0.3
〉
〈
0.5,0.2
〉
S
C
1
0.9
0.5
1
1
0.95
S
H
0.9
0.9
0.5
0.5
0.9
0.95
S
L
0.95
0.9
0.5
0.75
0.95
0.95
S
O
0.9
0.9
0.3
0.5
0.9
0.93
S
DC
1
0.9
0.5
1
1
0.95
S
HB
0.9
0.9
0.5
0.5
0.9
0.95
S
e
p
0.9
0.9
0.5
0.5
0.9
0.95
S
s
p
0.95
0.9
0.5
0.75
0.95
0.95
S
h
p
0.933
0.933
0.5
0.67
0.933
0.95
S
HY
1
0.9
0.9
0
0.5
0.9
0.9
S
HY
2
0.85
0.85
0
0.38
0.85
0.85
S
HY
3
0.82
0.82
0
0.33
0.82
0.82
C
IFS
1
0.96
0
0
0.9971
0.9965
S
t
p
0.967
0.9
0.5
0.833
0.937
0.95
S
Y
0.985
0.994
0.5
0.354
0.936
0.896We can see thatS
C
(
A
,
B
)
=
S
DC
(
A
,
B
)
=
C
IFS
(
A
,
B
)
=
1 for two different IFSs A
=
〈
0.3,0.3
〉 and B
=
〈
0.4,0.4
〉. This indicates that the second axiom of similarity measure (SP2) is not satisfied by S
C
(
A
,
B
), S
DC
(
A
,
B
), and C
IFS
(
A
,
B
). This also can be illustrated by S
C
(
A
,
B
)
=
S
DC
(
A
,
B
)
=
1 when A
=
〈
0.5,0.5
〉, B
=
〈
0,0
〉 and A
=
〈
0.4,0.2
〉, B
=
〈
0.5,0.3
〉. As for S
H, S
O, S
HB, S
e
p, S
s
p, and S
h
p, different pairs of A, B may provide the identical results, which cannot satisfy the application of pattern recognition. It can be read from Table 1 that S
HB
=
0.9 for both A
=
〈
0.3,0.3
〉, B
=
〈
0.4,0.4
〉 and A
=
〈
0.3,0.4
〉, B
=
〈
0.4,0.3
〉. Such situation seems to be going from bad to worse for S
HY
1, where all the cases take the same similarity degree except Case 3 and Case 4. S
HY
2 and S
HY
3 are also stuck with this problem. S
t
p seems to be reasonable without any counterintuitive results. However, we can notice an interesting situation when comparing Case 3 and Case 4. Suppose two vote results, “all in favor” and “all abstentions,” which, respectively, represent A
=
〈
1,0
〉 and B
=
〈
0,0
〉. It is reasonable to take the similarity degree between them as 0.5. A
′
=
〈
0.5,0.5
〉 and B
′
=
〈
0,0
〉 can be interpreted as “the vote for resolution is half in favor, half against” and “the vote for resolution is all abstentions,” respectively. The similarity degree between them is 0.833, which is greater than 0.5. From the view of vote practice, the similarity degree between A and B should be equal to or not less than the similarity between A
′ and B
′. Furthermore, it is worth considering the determination of parameters p and t in S
t
p. In such a sense, the proposed similarity measure is the most reasonable one with a relative simple expression and has none of the counterintuitive cases.In order to study the effectiveness of the proposed similarity measure for IFS in the application of pattern recognition, we consider the pattern recognition problem discussed in [7, 13].Suppose there arem patterns, which can be represented by IFSs A
j
=
{
〈
x
i
,
μ
A
j
(
x
i
)
,
v
A
j
(
x
i
)
〉
∣
x
i
∈
X
}, A
j
∈
IFSs
(
X
), j
=
1,2
,
…
,
m. Let the sample to be recognized be denoted by B
=
{
〈
x
i
,
μ
B
(
x
i
)
,
v
B
(
x
i
)
〉
∣
x
i
∈
X
}. According to the recognition principle of maximum degree of similarity between IFSs, the process of assigning B to A
k is described by [7]:
(36)
k
=
arg
max
⁡
j
=
1,2
,
…
,
m
{
S
(
A
j
,
B
)
}
.Example 8.
Assume that there exist three known patternsA
1, A
2, and A
3, with class labels C
1, C
2, and C
3, respectively. Each pattern can be expressed by IFS in X
=
{
x
1
,
x
2
,
x
3
} as follows:
(37)
A
1
=
{
〈
x
1
,
1,0
〉
,
〈
x
2
,
0.8,0
〉
,
〈
x
3
,
0.7,0.1
〉
}
,
A
2
=
{
〈
x
1
,
0.8,0.1
〉
,
〈
x
2
,
1,0
〉
,
〈
x
3
,
0.9,0
〉
}
,
A
3
=
{
〈
x
1
,
0.6,0.2
〉
,
〈
x
2
,
0.8,0
〉
,
〈
x
3
,
1,0
〉
}
.
The sampleB which needs to be recognized is as follows:
(38)
B
=
{
〈
x
1
,
0.5,0.3
〉
,
〈
x
2
,
0.6,0.2
〉
,
〈
x
3
,
0.8,0.1
〉
}
.
The similarity degree betweenA
i
(
i
=
1,2
,
3
) and B calculated by (17) is
(39)
S
Y
(
A
1
,
B
)
=
0.887
,
S
Y
(
A
2
,
B
)
=
0.913
,
S
Y
(
A
3
,
B
)
=
0.936
.
It can be observed that patternB should be classified to A
3 with a class label C
3. According to the recognition principle of maximum degree of similarity between IFSs, this result is in agreement with the one obtained in [7, 13].
Let us assume that the weights ofx
1, x
2, and x
3 are 0.5, 0.3, and 0.2, respectively, as they were assumed in [7]. Considering (32), we can get
(40)
S
WY
(
A
1
,
B
)
=
0.853
,
S
WY
(
A
2
,
B
)
=
0.919
,
S
WY
(
A
3
,
B
)
=
0.949
.
According to (36), B can be recognized as A
3, which is identical to the result obtained in [7, 13].
To make our similarity measure more transparent and comparable with the measures proposed earlier by other authors, the example analyzed in [17] will be discussed next.Example 9.
Assume that there are three IFS patterns inX
=
{
x
1
,
x
2
,
x
3
}. The three patterns are denoted as follows:
(41)
A
1
=
{
〈
x
1
,
0.3,0.3
〉
,
〈
x
2
,
0.2,0.2
〉
,
〈
x
3
,
0.1,0.1
〉
}
,
A
2
=
{
〈
x
1
,
0.2,0.2
〉
,
〈
x
2
,
0.2,0.2
〉
,
〈
x
3
,
0.2,0.2
〉
}
,
A
3
=
{
〈
x
1
,
0.4,0.4
〉
,
〈
x
2
,
0.4,0.4
〉
,
〈
x
3
,
0.4,0.4
〉
}
.
Assume that a sampleB
=
{
〈
x
1
,
0.3,0.3
〉
,
〈
x
2
,
0.2,0.2
〉
,
〈
x
3
,
0.1,0.1
〉
} is to be classified.
The similarity degrees ofS
(
A
1
,
B
), S
(
A
2
,
B
), and S
(
A
3
,
B
) are calculated by (5)–(16) for all existing similarity measures and shown in Table 2, where p
=
1 for S
HB, S
e
p, S
s
p, S
h
p and p
=
1, t
=
2 for S
t
p.
The proposed similarity measureS
Y can be calculated by (17) as follows:
(42)
S
Y
(
A
1
,
B
)
=
1
,
S
Y
(
A
2
,
B
)
=
0.990
,
S
Y
(
A
3
,
B
)
=
0.932
.
It is obvious thatB is equal to A
1. This indicates that sample B should be classified to A
1. However, the similarity degrees of S
(
A
1
,
B
), S
(
A
2
,
B
), and S
(
A
3
,
B
) are equal to each other when S
C, S
H, S
DC, and C
IFS are employed. These four similarity measures are not capable of discriminating difference between the three patterns. Fortunately, the results of S
Y
(
A
i
,
B
)
(
i
=
1,2
,
3
) can be used to make correct classification conclusion. This means that the proposed similarity measure shows an identical performance with majority of the existing measures.Table 2
The similarity measures between the known patterns and the unknown patterns in Example9 (patterns not discriminated are in bold type).
S
(
A
1
,
B
)
S
(
A
2
,
B
)
S
(
A
3
,
B
)
S
(
A
1
,
B
)
S
(
A
2
,
B
)
S
(
A
3
,
B
)
S
C
1
1
1
S
s
p
1
0.967
0.900
S
H
1
1
1
S
h
p
1
0.956
0.867
S
L
1
0.967
0.9
S
HY
1
1
0.967
0.8
S
O
1
0.918
0.784
S
HY
2
1
0.898
0.713
S
DC
1
1
1
S
HY
3
1
0.875
0.667
S
HB
1
0.933
0.8
C
IFS
1
1
1
S
e
p
1
0.933
0.8
S
t
p
1
0.978
0.933


## 6. Applications in Pattern Recognition

Along with the previous investigation of classification capabilities of the proposed measure, an additional experiment discussed in [7, 22, 23, 33–36], will be presented as an application in pattern recognition. In this paper, we propose an alternative approach to medical diagnosis using the newly defined similarity measure.Let us consider the same data as in [7, 22, 23, 33–36]. Suppose that there are four patients Al, Bob, Joe, Ted, represented as P
=
{Al, Bob, Joe, Ted}. Their symptoms are S
=
{Temperature, Headache, Stomach pain, Cough, Chest pain}. The set of diagnoses is defined as D
=
{Viral fever, Malaria, Typhoid, Stomach problem, Chest problem}. The intuitionistic fuzzy relation P
→
S is presented in Table 3. Table 4 gives the intuitionistic fuzzy relation S
→
D. Each element of the tables is given in the form of IFV, which is a pair of numbers corresponding to the membership and nonmembership values, respectively.Table 3
Symptoms characteristic for the patients.
Temperature
Headache
Stomach pain
Cough
Chest pain
Al
(0.8, 0.1)
(0.6, 0.1)
(0.2, 0.8)
(0.6, 0.1)
(0.1, 0.6)
Bob
(0, 0.8)
(0.4, 0.4)
(0.6, 0.1)
(0.1, 0.7)
(0.1, 0.8)
Joe
(0.8,  0.1)
(0.8,  0.1)
(0.0,  0.6)
(0.2,  0.7)
(0.0,  0.5)
Ted
(0.6,  0.1)
(0.5,  0.4)
(0.3,  0.4)
(0.7,  0.2)
(0.3,  0.4)Table 4
Symptoms characteristic for the diagnoses.
Viral fever
Malaria
Typhoid
Stomach problem
Chest pain problem
Temperature
(0.4, 0.0)
(0.7, 0.0)
(0.3, 0.3)
(0.1, 0.7)
(0.1, 0.8)
Headache
(0.3, 0.5)
(0.2, 0.6)
(0.6, 0.1)
(0.2, 0.4)
(0, 0.8)
Stomach pain
(0.1, 0.7)
(0.0, 0.9)
(0.2, 0.7)
(0.8, 0.0)
(0.2, 0.8)
Cough
(0.4, 0.3)
(0.7, 0.0)
(0.2, 0.6)
(0.2, 0.7)
(0.2, 0.8)
Chest pain
(0.1, 0.7)
(0.1, 0.8)
(0.1, 0.9)
(0.2, 0.7)
(0.8, 0.1)In order to make a proper diagnosis for each patient, we calculate the similarity degree between each patient and each diagnose. According to the principle of maximum similarity degree, the higher similarity degree indicates a proper diagnosis. In Table5, the similarity degree S
Y between patients and diagnoses is presented. According to the similarity degrees in Table 5, conclusion can be made that Al suffers from Viral fever, Bob suffers from Stomach problem, Joe suffers from Typhoid, and Ted suffers from Viral fever. The diagnosis results for this case obtained in previous study have been presented in [23]. It is clear that our proposed method provides the same results obtained by Vlachos and Sergiadis in [33], Own in [34], and Boran and Akay in [23]. Moreover, our proposed similarity measure is calculated based on the IFNs, without any other parameters such as p, t in [23]. So it can reduce the computation complexity.Table 5
The proposed similarity measureS
Y between each patient’s symptoms and the considered set of possible diagnoses.
Viral fever
Malaria
Typhoid
Stomach problem
Chest problem
Al
0.9347
0.9228
0.9223
0.7673
0.7490
Bob
0.8124
0.6775
0.8997
0.9760
0.8211
Joe
0.9152
0.8271
0.9188
0.7917
0.7456
Ted
0.9576
0.9034
0.9060
0.8577
0.8122


## 7. Conclusion

Since most of the existing similarity measures for IFSs have provided counterintuitive results, a new similarity measure and weighted similarity measure between IFSs were proposed in this paper. The new similarity measure is calculated based on the membership degreeμ
A
(
x
), nonmembership degree v
A
(
x
), hesitancy degree π
A
(
x
), and the upper bound of membership 1
-
v
A
(
x
). In some special cases where some of the existing similarity measures cannot provide reasonable results, the proposed similarity measure shows great capacity for discriminating IFSs. Moreover, investigation of the new measure’s classification capability was carried out based on two numerical examples and medical diagnosis. It has been illustrated that the proposed similarity measure performs as well as or better than previous measures. Further research will be focused on its applications in other practical fields.



---

*Source: 384241-2014-08-27.xml*