Next Article in Journal
Facial Feature Model for a Portrait Video Stylization
Next Article in Special Issue
Two Types of Intuitionistic Fuzzy Covering Rough Sets and an Application to Multiple Criteria Group Decision Making
Previous Article in Journal
Structure Transformations in Broken Symmetry Groups—Abstraction and Visualization
Previous Article in Special Issue
A New Method to Decision-Making with Fuzzy Competition Hypergraphs
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Novel Similarity Measure for Interval-Valued Intuitionistic Fuzzy Sets and Its Applications

Department of Information and Computing Science, China Jiliang University, Hangzhou 310018, China
*
Author to whom correspondence should be addressed.
Submission received: 29 August 2018 / Revised: 21 September 2018 / Accepted: 25 September 2018 / Published: 27 September 2018
(This article belongs to the Special Issue Fuzzy Techniques for Decision Making 2018)

Abstract

:
In this paper, a novel similarity measure for interval-valued intuitionistic fuzzy sets is introduced, which is based on the transformed interval-valued intuitionistic triangle fuzzy numbers. Its superiority is shown by comparing the proposed similarity measure with some existing similarity measures by some numerical examples. Furthermore, the proposed similarity measure is applied to deal with pattern recognition and medical diagnosis problems.

1. Introduction

As a generalization concept of fuzzy set (FS) introduced by Zadeh [1], the definition of intuitionistic fuzzy set (IFS) was initiated by Atanassov [2] for dealing with vague and uncertain information, which elaborately describe uncertain information by membership degree, non-membership degree and hesitancy degree. In [3], Gau and Buehrer presented the definition of vague set. In [4], Bustince and Burillo have showed that the notion of IFSs and vague sets coincide with each other. In order to deal with indeterminate and inconsistent information, Smarandache [5] proposed a neutrosophic set (NS). In the NS, indeterminacy-membership I A ( x ) is independent, thus making the NS more flexible and the most suitable for solving some decision-making problems related to the use of incomplete and imprecise information, uncertainties, predictions and so on. Zhang [6,7] studied algebraic and lattice structure for neutrosophic sets.
The conception of similarity measure for IFSs is one of the most important subjects for degree of similarity between objects in IFS theory. Chen [8] proposed the similarity measure based on a vague set for the first time. Hong [9] introduced a new similarity measure based on vague set and overcame some drawbacks of Chen’s similarity measure. Szmidt and Kacprzyk [10] extend Hamming distance and Euclidean distance to construct intuitionistic fuzzy similarity measure. However, Wang and Xin [11] implied that Szmidt and Kacprzyk’s distance measure [10] were ineffective in some situations. Grzegorzewski [12] extended some novel similarity measures for IFSs based on Hausdorff distance. Chen [13] pointed out some defects of Grzegorzewski’s similarity measure and show some counter examples. On the other hand, some studies defined new similarity measures for IFSs, rather than extending the well-known distance measures. Li and Cheng [14] presented a new similarity measure between IFSs and applied it to pattern recognition. Mitchell [15] indicated that similarity measure of Li and Cheng [14] had some counter-intuitive cases and modified that similarity measure based on a statistical perspective. Furthermore, Liang and Shi [16] presented some counter instances to indicate that the similarity measure of Li and Cheng [14] was not suitable for some situations, and proposed several new similarity measures for IFS. Ye [17] conducted a similarity comparative study of existing similarity measures for IFSs and proposed a cosine similarity measure and weighted cosine similarity measure. Xu [18] acquainted a sequence of similarity measures for IFSs and applied to solve multiple attribute decision-making problems. Boran et al. [19] proposed a new general type of similarity measures for IFSs with two parameters, expressing L p -norm and give its relation with existing similarity measures. Zhang and Yu [20] presented a new distance 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. Luo and Zhao [21] proposed a new distance measure for IFSs, which is based on a matrix norm and a strictly increasing (or decreasing) binary function, and applied it to solve pattern recognition problems.
As the development of IFSs, Atanassov introduced interval-valued intuitionistic fuzzy set (IVIFS) [22], which the membership degree, non-membership degree and hesitancy degree are represented by subinterval of [ 0 , 1 ] . It therefore can represent the dynamic character of features accurately. Due to the advantages of IVIFSs in practical application, various similarity measures based on IVIFSs were studied extensively by many researchers from different angles and applied to many areas such as medical diagnosis, pattern recognition problem and so on. Liu [23] proposed a set of axiomatic definitions for entropy measures between IVIFSs, which extends Szmidt and Kacprzyk’s axioms formulated for entropy between IFSs. Xu [24] generalized some formulas of similarity measures of IFSs to IVIFSs. Wei [25] proposed an new similarity measure for IVIFSs, and also applied to solve problems on pattern recognitions, multi-criteria fuzzy decision-making and medical diagnosis. Singh [26] introduced a new cosine similarity measure for IVIFSs and applied to pattern recognition. Khalaf [27] advanced a new approach for medical diagnosis by IVIFSs, which is generalized by the application of IFS theory. Dhivya [28] presented a new similarity measure for IVIFSs based on the mid points of transformed triangular fuzzy numbers.
However, there are some drawbacks in some existing similarity measures for IVIFSs, most of which get counterintuitive results in some situations and they cannot get correct classification results for dealing with the pattern recognition problems and medical diagnosis problems. For example, letting A = < [ 0.20 , 0.30 ] , [ 0.40 , 0.60 ] > , B 1 = < [ 0.30 , 0.40 ] , [ 0.40 , 0.60 ] > and B 2 = < [ 0.30 , 0.40 ] , [ 0.30 , 0.50 ] > be IVIFSs, we can compute the similarity measures between A and B i ( i = 1 , 2 ) by Formulas (1), (2) and (4) (see Section 3). Obviously, we have the result B 1 B 2 because the membership degree of B 1 is identical to that of B 2 , and the non-membership degree of B 1 is not identical to that of B 2 . Therefore, we should obtain S i ( A , B 1 ) S i ( A , B 2 ) ( i = 1 , 2 ) . However, we can obtain that S 1 ( A , B 1 ) = S 1 ( A , B 2 ) = S 2 ( A , B 1 ) = S 2 ( A , B 2 ) = 0.9 by the Formulas (1) and (2) (for p = 1 ), which is not reasonable. Meanwhile, we can get S D ( A , B 1 ) = 1 by Formula (4), which does not satisfy the second axiom of the definition for similarity measure. Therefore, we need to develop a new similarity measure to overcome these drawbacks.
The rest of the paper is organized as follows: Section 2 reviews some necessary definitions related to IVIFS. In Section 3, some existing similarity measures are reviewed. In Section 4, a novel similarity measure is introduced. The geometric interpretation of the new similarity measure and the explanation of parameters are briefly given in Section 5. Applications in pattern recognition and medical diagnosis are presented in Section 6. The conclusions for this paper are given in the last section.

2. Preliminary

In this section, we review the basic concepts related to IVIFSs that will be used in this paper.
Definition 1
([1]). A fuzzy set A in the unverse of discourse X = { x 1 , x 2 , , x n } is defined as follows:
A = { < x , μ A ( x ) > | x X } ,
where μ A ( x ) : X [ 0 , 1 ] is the membership degree.
Definition 2
([2]). An intuitionistic fuzzy set A in a universe of discourse X = { x 1 , x 2 , , x n } is defined as follows:
A = { < x , μ A ( x ) , ν A ( x ) > | x X } ,
where μ A ( x ) : X [ 0 , 1 ] and ν A ( x ) : X [ 0 , 1 ] are membership and non-membership degree, respectively, such that: 0 μ A ( x ) + ν A ( x ) 1 .
The third parameter of intuitionistic fuzzy set A is: π A ( x ) = 1 μ A ( x ) ν A ( x ) , which is known as the intuitionistic fuzzy index or the hesitation degree of whether x belongs to A or not. It is obviously seen that 0 π A ( x ) 1 . If π A ( x ) is small; then, knowledge about x is more certain; if π A ( x ) is great, then knowledge about x is more uncertain.
Definition 3
([22]). An interval-valued intuitionistic fuzzy set A in a universe of discourse X = { x 1 , x 2 , , x n } is defined as follows:
A = { < x , μ A ( x ) , ν A ( x ) > | x X } = { < x , [ μ A ( x ) , μ A + ( x ) ] , [ ν A ( x ) , ν A + ( x ) ] > | x X } ,
where μ A ( x ) [ 0 , 1 ] , ν A ( x ) [ 0 , 1 ] , which satisfies 0 μ A + ( x ) + ν A + ( x ) 1 .
The intervals μ A ( x ) and ν A ( x ) denote the membership degree and non-membership degree, respectively. Furthermore, for each x X , we can compute the hesitance degree π A ( x ) = [ π A ( x i ) , π A + ( x i ) ] = [ 1 μ A + ( x ) ν A + ( x ) , 1 μ A ( x ) ν A ( x ) ] .
Definition 4
([29]). For every two IVIFSs A and B in the universe of discourse X, we have the following relations:
(1): 
A B iff ( x X ) μ A ( x ) μ B ( x ) and μ A + ( x ) μ B + ( x ) and ν A ( x ) ν B ( x ) and ν A + ( x ) ν B + ( x ) .
(2): 
A B = x , [ max ( μ A ( x ) , μ B ( x ) ) , max ( μ A + ( x ) , μ B + ( x ) ) ] , [ min ( ν A ( x ) , ν B ( x ) ) , min ( ν A + ( x ) , ν B + ( x ) ) ] .
(3): 
A B = x , [ min ( μ A ( x ) , μ B ( x ) ) , min ( μ A + ( x ) , μ B + ( x ) ) ] , [ max ( ν A ( x ) , ν B ( x ) ) , max ( ν A + ( x ) , ν B + ( x ) ) ] .
(4): 
A = B iff ( x X ) μ A ( x ) = μ B ( x ) and μ A + ( x ) = μ B + ( x ) and ν A ( x ) = ν B ( x ) and ν A + ( x ) = ν B + ( x ) .
(5): 
A c = x , [ ν A ( x ) , ν A + ( x ) ] , [ μ A ( x ) , μ A + ( x ) ]
Definition 5
([18]). Let A and B be interval-valued intuitionistic fuzzy sets in the unverse of discourse X = { x 1 , x 2 , , x n } , a mapping S : I V I F S ( X ) × I V I F S ( X ) [ 0 , 1 ] , S ( A , B ) is called to be a similarity measure between A and B, if S ( A , B ) satisfies the following properties:
(S1): 
0 S ( A , B ) 1 ,
(S2): 
S ( A , B ) = 1 if and only if A = B ,
(S3): 
S ( A , B ) = S ( B , A ) ,
(S4): 
If A B C , then S ( A , C ) S ( A , B ) , and S ( A , C ) S ( B , C ) .

3. Some Existing Similarity Measures

In this section, we review some existing similarity measures.
Let A = { < x i , [ μ A ( x i ) , μ A + ( x i ) ] , [ ν A ( x i ) , ν A + ( x i ) ] > | x i X } , B = { < x i , [ μ B ( x i ) , μ B + ( x i ) ] , [ ν B ( x i ) , ν B + ( x i ) ] > | x i X } be IVIFSs defined on a universe of discourse X = { x 1 , x 2 , , x n } . The following Formulas (1)–(4) are similarity measures based on IVIFSs:
Xu’s similarity measure([24]):
S 1 ( A , B ) = 1 1 4 n i = 1 n ( μ A ( x i ) μ B ( x i ) p + μ A + ( x i ) μ B + ( x i ) p + ν A ( x i ) ν B ( x i ) p + ν A + ( x i ) ν B + ( x i ) p ) p ,
S 2 ( A , B ) = 1 1 n i = 1 n max ( μ A ( x i ) μ B ( x i ) p , μ A + ( x i ) μ B + ( x i ) p , ν A ( x i ) ν B ( x i ) p , ν A + ( x i ) ν B + ( x i ) p ) p .
Wei’s similarity measure ([25]):
S W ( A , B ) = 1 n i = 1 n 2 min ( μ i , ν i ) min ( μ i + , ν i + ) 2 + max ( μ i , ν i ) + max ( μ i + , ν i + ) ,
where
μ i = μ A ( x i ) μ B ( x i ) , μ i + = μ A + ( x i ) μ B + ( x i ) , ν i = ν A ( x i ) ν B ( x i ) , ν i + = ν A + ( x i ) ν B + ( x i ) .
Dhivya’s similarity measure ([28]):
S D ( A , B ) = 1 1 n i = 1 n ( 1 2 ( | ψ A ( x i ) ψ B ( x i ) | + | ψ A + ( x i ) ψ B + ( x i ) | ) · ( 1 σ A ( x i ) + σ B ( x i ) 2 ) + | σ A ( x i ) σ B ( x i ) | · ( σ A ( x i ) + σ B ( x i ) 2 ) ) ,
where
ψ A = μ A ( x i ) + 1 ν A ( x i ) 2 , ψ A + = μ A + ( x i ) + 1 ν A + ( x i ) 2 , ψ B = μ B ( x i ) + 1 ν B ( x i ) 2 , ψ B + = μ B + v + 1 ν B + ( x i ) 2 , σ A ( x i ) = 1 1 2 ( μ A ( x i ) + μ A + ( x i ) + ν A ( x i ) + ν A + ( x i ) ) , σ B ( x i ) = 1 1 2 ( μ B ( x i ) + μ B + ( x i ) + ν B ( x i ) + ν B + ( x i ) ) .

4. A New Similarity Measure between Interval-Valued Intuitionistic Fuzzy Sets

Definition 6.
Let A, B be IVIFSs defined in universe of discourse X = { x 1 , x 2 , , x n } , and A = { < x i , [ μ A ( x i ) , μ A + ( x i ) ] , [ ν A ( x i ) , ν A + ( x i ) ] > | x i X } , B = { < x i , [ μ B ( x i ) , μ B + ( x i ) ] , [ ν B ( x i ) , ν B + ( x i ) ] > | x i X } . We call
S p ( A , B ) = 1 1 2 n i = 1 n t 1 [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] 2 ( t 1 + 1 ) p + t 2 [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] 2 ( t 2 + 1 ) p 1 p
a similarity measure between A and B. t 1 , t 2 , p [ 1 , + ) . Here, three parameters: p is the L p -norm and t 1 , t 2 identifies the level of uncertainty.
Theorem 1.
S p ( A , B ) is a similarity measure between IVIFSs A and B.
Proof. 
Let A, B, C be IVIFSs defined on a universe of discourse X = { x 1 , x 2 , , x n } , and A = { < x i , [ μ A ( x i ) , μ A + ( x i ) ] , [ ν A ( x i ) , ν A + ( x i ) ] > | x i X } , B = { < x i , [ μ B ( x i ) , μ B + ( x i ) ] , [ ν B ( x i ) , ν B + ( x i ) ] > | x i X } , and C = { < x i , [ μ C ( x i ) , μ C + ( x i ) ] , [ ν C ( x i ) , ν C + ( x i ) ] > | x i X } .
( 1 ) Firstly, we know that, for arbitrary x i X :
t 1 [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] = [ t 1 ( μ A ( x i ) μ B ( x i ) ) ( ν A ( x i ) ν B ( x i ) ) ] + [ t 1 ( μ A + ( x i ) μ B + ( x i ) ) ( ν A + ( x i ) ν B + ( x i ) ) ] .
For μ A ( x i ) , μ B ( x i ) , ν A ( x i ) , ν B ( x i ) [ 0 , 1 ] , then we have t 1 t 1 ( μ A ( x i ) μ B ( x i ) ) t 1 , 1 ν A ( x i ) ν B ( x i ) 1 . Thus, we obtain that
( t 1 + 1 ) t 1 ( μ A ( x i ) μ B ( x i ) ) ( ν A ( x i ) ν B ( x i ) ) t 1 + 1 .
Similarly,
( t 1 + 1 ) t 1 ( μ A + ( x i ) μ B + ( x i ) ) ( ν A + ( x i ) ν B + ( x i ) ) t 1 + 1 .
Thus,
0 t 1 [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] 2 ( t 1 + 1 ) p 1 .
By the same way, we have
0 t 2 [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] 2 ( t 2 + 1 ) p 1 .
Therefore,
0 1 2 n i = 1 n t 1 [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] 2 ( t 1 + 1 ) p + t 2 [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] 2 ( t 2 + 1 ) p 1 .
That is, 0 S p ( A , B ) 1 .
( 2 ) A = B , if and only if for arbitrary x i X , we have μ A ( x i ) = μ B ( x i ) , μ A + ( x i ) = μ B + ( x i ) , ν A ( x i ) = ν B ( x i ) , ν A + ( x i ) = ν B + ( x i ) . It is obvious that S p ( A , B ) = 1 .
( 3 ) For S p ( A , B ) , we have
t 1 [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] p = t 1 [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] + [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + v ) ] p = t 1 [ ( μ B ( x i ) μ A ( x i ) ) + ( μ B + ( x i ) μ A + ( x i ) ) ] [ ( ν B ( x i ) ν A ( x i ) ) ( ν B + ( x i ) ν A + ( x i ) ) ] p .
Similarly,
t 2 [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] p = t 2 [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] + [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] p = t 2 [ ( ν B ( x i ) ν A ( x i ) ) ( ν B + ( x i ) ν A + ( x i ) ) ] [ ( μ B ( x i ) μ A ( x i ) ) ( μ B + ( x i ) μ A + ( x i ) ) ] p .
Thus, S p ( A , B ) = S p ( B , A ) .
( 4 ) For A , B , C be IVIFSs, the similarity measure A and B, and A and C are the following:
S p ( A , B ) = 1 1 2 n i = 1 n t 1 [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] 2 ( t 1 + 1 ) p + t 2 [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] 2 ( t 2 + 1 ) p 1 p ,
S p ( A , C ) = 1 1 2 n i = 1 n t 1 [ ( μ A ( x i ) μ C ( x i ) ) + ( μ A + ( x i ) μ C + ( x i ) ) ] [ ( ν A ( x i ) ν C ( x i ) ) + ( ν A + ( x i ) ν C + ( x i ) ) ] 2 ( t 1 + 1 ) p + t 2 [ ( ν A ( x i ) ν C ( x i ) ) + ( ν A + ( x i ) ν C + ( x i ) ) ] [ ( μ A ( x i ) μ C ( x i ) ) + ( μ A + ( x i ) μ C + ( x i ) ) ] 2 ( t 2 + 1 ) p 1 p .
If A B C , then μ A ( x i ) μ B ( x i ) μ C ( x i ) , μ A + ( x i ) μ B + ( x i ) μ C + ( x i ) , ν C ( x i ) ν B ( x i ) ν A ( x i ) , and ν C + ( x i ) ν B + ( x i ) ν A + ( x i ) . Then, we have
t 1 [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] = t 1 [ ( μ B ( x i ) μ A ( x i ) ) + ( μ B + ( x i ) μ A + ( x i ) ) ] + [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] t 1 [ ( μ C ( x i ) μ A ( x i ) ) + ( μ C + ( x i ) μ A + ( x i ) ) ] + [ ( ν A ( x i ) ν C ( x i ) ) + ( ν A + ( x i ) ν C + ( x i ) ) ] = t 1 [ ( μ A ( x i ) μ C ( x i ) ) + ( μ A + ( x i ) μ C + ( x i ) ) ] [ ( ν A ( x i ) ν C ( x i ) ) + ( ν A + ( x i ) ν C + ( x i ) ) ] .
By the same reason, we have
t 2 [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] t 2 [ ( ν A ( x i ) ν C ( x i ) ) + ( ν A + ( x i ) ν C + ( x i ) ) ] [ ( μ A ( x i ) μ C ( x i ) ) + ( μ A + ( x i ) μ C + ( x i ) ) ] .
Therefore, S p ( A , B ) S p ( A , C ) , and S p ( B , C ) S p ( A , C ) .
In conclusion, S p ( A , B ) is a similarity measure between IVIFSs A and B. ☐
Remark 1.
If interval-valued intuitionistic fuzzy sets A and B degenerates to intuitionistic fuzzy set, i.e., μ A = μ A + , ν A = ν A + , and μ B = μ B + , ν B = ν B + , then
S p ( A , B ) = 1 1 n i = 1 n t 1 ( μ A μ B ) ( ν A ν B ) 2 ( t 1 + 1 ) p + t 2 ( ν A ν B ) ( μ A μ B ) 2 ( t 2 + 1 ) p 1 p
is a new similarity measure between intuitionistic fuzzy sets A and B.
Remark 2.
In the environment of IFSs, and when t 1 = t 2 = t , the proposed similarity measure
S p ( A , B ) = 1 1 2 n ( t + 1 ) p i = 1 n | t ( μ A μ B ) ( ν A ν B ) | p + | t ( ν A ν B ) ( μ A μ B ) | p 1 p
is the similarity measure between intuitionistic fuzzy sets A and B in the literature ([19]).
Example 1.
Supposing that A i and B i are two IVIFSs, we can compute the similarity measures between A i and B i by different similarity measures listed in Table 1.
In Table 1, by comparing the first column and the second column, we can find that S i ( A 1 , B 1 ) = S i ( A 2 , B 2 ) ( i = 1 , 2 ) when A 1 = A 2 , B 1 B 2 . Similarly, by comparing the third column and the fourth column, we can find S 2 ( A 3 , B 3 ) = S 2 ( A 4 , B 4 ) when A 3 = A 4 , B 3 B 4 . Therefore, we can determine that the similarity measure S 1 and S 2 is not reasonable. Meanwhile, we find that S D ( A 1 , B 1 ) = 1 when A 1 B 1 , which is not satisfy the second axiom of the definition for similarity measure. Most importantly, we can observe that the proposed similarity measure S p can overcome these drawbacks. Therefore, our novel similarity measure for IVIFSs is more reasonable than others.

5. Geometric Interpretation of the Novel Similarity Measure

In this section, we briefly interpret the proposed similarity measure and explain the functionality of parameters t 1 , t 2 and p defined in the proposed similarity measure.
Let A = < [ μ A , μ A + ] , [ ν A , ν A + ] > , B = < [ μ B , μ B + ] , [ ν B , ν B + ] > be interval-valued intuitionistic fuzzy numbers. We can split A into two intuitionistic fuzzy numbers, i.e., A = < μ A , ν A > and A + = < μ A + , ν A + > . For intuitionistic fuzzy set A , μ A can be equal to any value in [ μ A , μ A + π A + ] and ν A can be equal to any value in [ ν A , ν A + π A + ] , where π A + = 1 μ A ν A . Similarly, μ A + can be equal to any value in [ μ A + , μ A + + π A ] and ν A + can be equal to any value in [ ν A + , ν A + + π A ] for intuitionistic fuzzy set A + , where π A = 1 μ A + ν A + . Then, the possible values for A and A + illustrated in Figure 1 as the two triangles. As the center of gravity, D and D + are the most informative points in the triangle A and A + , respectively.
However, < μ A + π A + t 1 + 1 , ν A + π A + t 2 + 1 > ( t 1 , t 2 [ 1 , + ) ) can represent any point in the triangle A . Especially when t 1 = t 2 = t , < μ A + π A + t + 1 , ν A + π A + t + 1 > can denote the point of middle line of the triangle bevel. In the same way, < μ A + + π A t 1 + 1 , ν A + + π A t 2 + 1 > ( t 1 , t 2 [ 1 , + ) ) represents any point in the triangle A + .
The following is the calculation process:
Firstly, A = μ A + π A + t 1 + 1 , ν A + π A + t 2 + 1 denotes possible points of triangle A . By the same token, A + = μ A + + π A t 1 + 1 , ν A + + π A t 2 + 1 denotes possible points of triangle A + . Similarly, we can obtain that B = μ B + π B + t 1 + 1 , ν B + π B + t 1 + 1 and B + = μ B + + π B t 1 + 1 , ν B + + π B t 1 + 1 denote any points in triangles B and B + , respectively.
Secondly, the average of A and A + can be computed as follows:
A = < μ A , ν A > = 2 + t 1 ( μ A + μ A + ) ( ν A + ν A + ) 2 ( t 1 + 1 ) , 2 + t 2 ( μ A + μ A + ) ( ν A + ν A + ) 2 ( t 2 + 1 ) .
We can also get the mean value of B and B + :
B = < μ B , ν B > = 2 + t 1 ( μ B + μ B + ) ( ν B + ν B + ) 2 ( t 1 + 1 ) , 2 + t 2 ( μ B + μ B + ) ( ν B + ν B + ) 2 ( t 2 + 1 ) .
The absolute difference between A and B is calculated as follows:
μ A μ B = t 1 [ ( μ A μ B ) + ( μ A + μ B + ) ] [ ( ν A ν B ) + ( ν A + ν B + ) ] 2 ( t 1 + 1 ) ,
ν A ν B = t 2 [ ( ν A ν B ) + ( ν A + ν B + ) ] [ ( μ A μ B ) + ( μ A + μ B + ) ] 2 ( t 2 + 1 ) .
μ A μ B and ν A ν B to the power of p is equal to the following:
μ A μ B p = t 1 [ ( μ A μ B ) + ( μ A + μ B + ) ] [ ( ν A ν B ) + ( ν A + ν B + ) ] p 2 p ( t 1 + 1 ) p ,
ν A ν B p = t 2 [ ( ν A ν B ) + ( ν A + ν B + ) ] [ ( μ A μ B ) + ( μ A + μ B + ) ] p 2 p ( t 2 + 1 ) p .
The average value of μ A μ B p and ν A ν A p is calculated as follows:
1 2 μ A μ B p + ν A ν A p = 1 2 t 1 [ ( μ A μ B ) + ( μ A + μ B + ) ] [ ( ν A ν B ) + ( ν A + ν B + ) ] 2 ( t 1 + 1 ) p + 1 2 t 2 [ ( ν A ν B ) + ( ν A + ν B + ) ] [ ( μ A μ B ) + ( μ A + μ B + ) ] 2 ( t 2 + 1 ) p .
The p root of the average value of μ A μ B p and ν A ν A p is calculated as:
1 2 μ A μ B p + ν A ν B p 1 p = t 1 [ ( μ A μ C ) + ( μ A + μ C + ) ] [ ( ν A ν C ) + ( ν A + ν C + ) ] 2 ( t 1 + 1 ) p + t 2 [ ( ν A ν C ) + ( ν A + ν C + ) ] [ ( μ A μ C ) + ( μ A + μ C + ) ] 2 ( t 2 + 1 ) p 1 p .
For an interval-valued intuitionistic fuzzy set instead of interval-valued intuitionistic fuzzy number, i.e., there is more than one feature in the discourse of universe, such as X = { x 1 , x 2 , , x n } :
S p ( A , B ) = 1 1 2 n i = 1 n t 1 [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] 2 ( t 1 + 1 ) p + t 2 [ ( ν A ( x i ) ν B ( x i ) ) + ( ν A + ( x i ) ν B + ( x i ) ) ] [ ( μ A ( x i ) μ B ( x i ) ) + ( μ A + ( x i ) μ B + ( x i ) ) ] 2 ( t 2 + 1 ) p 1 p .
In particular, A = D = μ A + 1 μ A ν A 3 , ν A + 1 μ A ν A 3 and A + = D + = μ A + + 1 μ A + ν A + 3 , ν A + + 1 μ A + ν A + 3 when t 1 = t 2 = 2 . Without a doubt, D and D + are the most concentrated points of information in triangle A and A + , respectively; therefore, they are also the most significant points in all possible meaningful points.

6. Applications

In this section, the proposed similarity measure is used to solve the real life problems under the IVIFSs environment and obtained results have been compared with some existing similarity measures.

6.1. Pattern Recognition

6.1.1. Algorithms for Pattern Recognition

Letting X = { x 1 , x 2 , , x n } be a finite universe of discourse, there exists m patterns which are denoted by IVIFSs A j = { < x 1 , [ μ A j ( x 1 ) , μ A j + ( x 1 ) ] , [ ν A j ( x 1 ) , ν A j + ( x 1 ) ] > , , < x 1 , [ μ A j ( x n ) , μ A j + ( x n ) ] , [ ν A j ( x n ) , ν A j + ( x n ) ] > | x 1 , , x n X } ( j = 1 , 2 , , m ) and there is a test sample to be classified which is denoted by an IVIFS B = { < x 1 , [ μ B ( x 1 ) , μ B + ( x 1 ) ] , [ ν B ( x 1 ) , ν B + ( x 1 ) ] > , , < x 1 , [ μ B ( x n ) , μ B + ( x n ) ] , [ ν B ( x n ) , ν B + ( x n ) ] > | x 1 , , x n X } . The recognition process is as follows:
Step 1. Calculate the similarity measure S ( B , A j ) between B and A j ( j = 1 , , m ) .
Step 2. Choose the maximum one S ( B , A j 0 ) from S ( B , A j ) ( j = 1 , 2 , , m ) , i.e., S ( B , A j 0 ) = max 1 j m S ( B , A j ) . Then, the test sample B is classified the pattern A j 0 .

6.1.2. Applications for Pattern Recognition

Example 2.
Assume that there are four classes of ores A i ( i = 1 , 2 , 3 , 4 ) in the area developed by a coal mine company, for which the related feature information are expressed by IVIFSs, and A i = { < x 1 , μ A i ( x 1 ) , μ A i + ( x 1 ) , ν A i ( x 1 ) , ν A i + ( x 1 ) > , , < x 4 , μ A i ( x 4 ) , μ A i + ( x 4 ) , ν A i ( x 4 ) , ν A i + ( x 4 ) > | x 1 , x 2 , x 3 , x 4 X } , which are presented in Table 2. Now, there is an unknown ore B and our aim is to classify B into the four kinds of ores above.
Compute the similarity measures S ( A i , B ) between B and A i . By analyzing the computed results in Table 3, we can easily see that, if S 1 is used for pattern recognition, we can obtain that S 1 ( A 1 , B ) = S 1 ( A 2 , B ) = S 1 ( A 4 , B ) > S 1 ( A 3 , B ) . In this way, we can not classify the sample B into a certain pattern accurately. If S W is used for pattern recognition, we can obtain that S W ( A 2 , B ) = S W ( A 4 , B ) > S W ( A 1 , B ) = S W ( A 3 , B ) . In this way, we can not make sure if the sample B belongs to one of A 2 and A 4 . If we use S D for pattern recognition, we can get S ( A 3 , B ) = S ( A 4 , B ) > S ( A 2 , B ) > S ( A 1 , B ) . In this way, we can not classify the sample B into one of A 3 and A 4 . If we use S p for pattern recognition, we can get S ( A 1 , B ) > S ( A 2 , B ) > S ( A 3 , B ) > S ( A 4 , B ) . According to the principle of recognition, S 2 and S p can get the same recognition result, i.e., the sample B can be classified into the pattern A 3 . However, we can not distinguish which one is bigger between A 2 and A 4 when using S 2 to calculate the similarity measure. Therefore, we can assign the sample B to the pattern A 3 .
Example 3
([30]). In this example, a pattern recognition example about classification of building materials is used to illustrate the proposed similarity measure. Suppose that there are four classes of building material, which are denoted by the IVIFSs A j = { < x 1 , [ μ A j ( x 1 ) , μ A j + ( x 1 ) ] , [ ν A j ( x 1 ) , ν A j + ( x 1 ) ] > , , < x 12 , [ μ A j ( x 12 ) , μ A j + ( x 12 ) ] , [ ν A j ( x 12 ) , ν A j + ( x 12 ) ] > | x 1 , , x 12 X } ( j = 1 , , 4 ) in the feature space X = { x 1 , x 2 , , x 12 } , and there is an unknown pattern B:
A 1 = { < x 1 , [ 0 . 1 , 0 . 2 ] , [ 0 . 5 , 0 . 6 ] > , < x 2 , [ 0 . 1 , 0 . 2 ] , [ 0 . 7 , 0 . 8 ] > , < x 3 , [ 0 . 5 , 0 . 6 ] , [ 0 . 3 , 0 . 4 ] > , < x 4 , [ 0 . 8 , 0 . 9 ] , [ 0 . 0 , 0 . 1 ] > , < x 5 , [ 0 . 4 , 0 . 5 ] , [ 0 . 3 , 0 . 4 ] > , < x 6 , [ 0 . 0 , 0 . 1 ] , [ 0 . 8 , 0 . 9 ] > , < x 7 , [ 0 . 3 , 0 . 4 ] , [ 0 . 5 , 0 . 6 ] > , < x 8 , [ 1 . 0 , 1 . 0 ] , [ 0 . 0 , 0 . 0 ] > , < x 9 , [ 0 . 2 , 0 . 3 ] , [ 0 . 6 , 0 . 7 ] > , < x 10 , [ 0 . 4 , 0 . 5 ] , [ 0 . 4 , 0 . 5 ] > , < x 11 , [ 0 . 7 , 0 . 8 ] , [ 0 . 1 , 0 . 2 ] > , < x 12 , [ 0 . 4 , 0 . 5 ] , [ 0 . 4 , 0 . 5 ] > } ,
A 2 = { < x 1 , [ 0 . 5 , 0 . 6 ] , [ 0 . 3 , 0 . 4 ] > , < x 2 , [ 0 . 6 , 0 . 7 ] , [ 0 . 1 , 0 . 2 ] > , < x 3 , [ 1 . 0 , 1 . 0 ] , [ 0 . 0 , 0 . 0 ] > , < x 4 , [ 0 . 1 , 0 . 2 ] , [ 0 . 6 , 0 . 7 ] > , < x 5 , [ 0 . 0 , 0 . 1 ] , [ 0 . 8 , 0 . 9 ] > , < x 6 , [ 0 . 7 , 0 . 8 ] , [ 0 . 1 , 0 . 2 ] > , < x 7 , [ 0 . 5 , 0 . 6 ] , [ 0 . 3 , 0 . 4 ] > , < x 8 , [ 0 . 6 , 0 . 7 ] , [ 0 . 2 , 0 . 3 ] > , < x 9 , [ 1 . 0 , 1 . 0 ] , [ 0 . 0 , 0 . 0 ] > , < x 10 , [ 0 . 1 , 0 . 2 ] , [ 0 . 7 , 0 . 8 ] > , < x 11 , [ 0 . 0 , 0 . 1 ] , [ 0 . 8 , 0 . 9 ] > , < x 12 , [ 0 . 7 , 0 . 8 ] , [ 0 . 1 , 0 . 2 ] > } ,
A 3 = { < x 1 , [ 0 . 4 , 0 . 5 ] , [ 0 . 3 , 0 . 4 ] > , < x 2 , [ 0 . 6 , 0 . 7 ] , [ 0 . 2 , 0 . 3 ] > , < x 3 , [ 0 . 9 , 1 . 0 ] , [ 0 . 0 , 0 . 0 ] > , < x 4 , [ 0 . 0 , 0 . 1 ] , [ 0 . 8 , 0 . 9 ] > , < x 5 , [ 0 . 0 , 0 . 1 ] , [ 0 . 8 , 0 . 9 ] > , < x 6 , [ 0 . 6 , 0 . 7 ] , [ 0 . 2 , 0 . 3 ] > , < x 7 , [ 0 . 1 , 0 . 2 ] , [ 0 . 7 , 0 . 8 ] > , < x 8 , [ 0 . 2 , 0 . 3 ] , [ 0 . 6 , 0 . 7 ] > , < x 9 , [ 0 . 5 , 0 . 6 ] , [ 0 . 2 , 0 . 4 ] > , < x 10 , [ 1 . 0 , 1 . 0 ] , [ 0 . 0 , 0 . 0 ] > , < x 11 , [ 0 . 3 , 0 . 4 ] , [ 0 . 4 , 0 . 5 ] > , < x 12 , [ 0 . 0 , 0 . 1 ] , [ 0 . 8 , 0 . 9 ] > } ,
A 4 = { < x 1 , [ 1 . 0 , 1 . 0 ] , [ 0 . 0 , 0 . 0 ] > , < x 2 , [ 1 . 0 , 1 . 0 ] , [ 0 . 0 , 0 . 0 ] > , < x 3 , [ 0 . 8 , 0 . 9 ] , [ 0 . 0 , 0 . 1 ] > , < x 4 , [ 0 . 7 , 0 . 8 ] , [ 0 . 1 , 0 . 2 ] > , < x 5 , [ 0 . 0 , 0 . 1 ] , [ 0 . 7 , 0 . 9 ] > , < x 6 , [ 0 . 0 , 0 . 1 ] , [ 0 . 8 , 0 . 9 ] > , < x 7 , [ 0 . 1 , 0 . 2 ] , [ 0 . 7 , 0 . 8 ] > , < x 8 , [ 0 . 1 , 0 . 2 ] , [ 0 . 7 , 0 . 8 ] > , < x 9 , [ 0 . 4 , 0 . 5 ] , [ 0 . 3 , 0 . 4 ] > , < x 10 , [ 1 . 0 , 1 . 0 ] , [ 0 . 0 , 0 . 0 ] > , < x 11 , [ 0 . 3 , 0 . 4 ] , [ 0 . 4 , 0 . 5 ] > , < x 12 , [ 0 . 0 , 0 . 1 ] , [ 0 . 8 , 0 . 9 ] > } ,
B = { < x 1 , [ 0 . 9 , 1 . 0 ] , [ 0 . 0 , 0 . 0 ] > , < x 2 , [ 0 . 9 , 1 . 0 ] , [ 0 . 0 , 0 . 0 ] > , < x 3 , [ 0 . 7 , 0 . 8 ] , [ 0 . 1 , 0 . 2 ] > , < x 4 , [ 0 . 6 , 0 . 7 ] , [ 0 . 1 , 0 . 2 ] > , < x 5 , [ 0 . 0 , 0 . 1 ] , [ 0 . 8 , 0 . 9 ] > , < x 6 , [ 0 . 1 , 0 . 2 ] , [ 0 . 7 , 0 . 8 ] > , < x 7 , [ 0 . 1 , 0 . 2 ] , [ 0 . 7 , 0 . 8 ] > , < x 8 , [ 0 . 1 , 0 . 2 ] , [ 0 . 7 , 0 . 8 ] > , < x 9 , [ 0 . 4 , 0 . 5 ] , [ 0 . 3 , 0 . 4 ] > , < x 10 , [ 1 . 0 , 1 . 0 ] , [ 0 . 0 , 0 . 0 ] > , < x 11 , [ 0 . 3 , 0 . 4 ] , [ 0 . 4 , 0 . 5 ] > , < x 12 , [ 0 . 0 , 0 . 1 ] , [ 0 . 7 , 0 . 9 ] > } .
Calculate the similarity measure S ( A j , B ) between IVIFSs A j ( j = 1 , 2 , 3 , 4 ) and B by use of Formulas (1)–(5). It is obvious that the similarity measure in the literature ([30]) is the special case of S 1 and S 2 , and the computed result is the same as ([30]). According to Table 4 and the recognition principle, the unknown pattern can be classified properly in A 4 by the computation of similarity measure. This conclusion coincides with that in [30].

6.2. Applications for Medical Diagnosis

Researchers proposed a lot of methods from different points of view to deal with problems of medical diagnosis. Refs. [27,31,32,33] presented several ways to deal with the problems of medical diagnosis. In this section, the methods of pattern recognition are used for solving medical diagnosis problems, i.e., patients are unknown test samples, diseases are several patterns, and the symptom set is the set universe of discourse. Our aim is to classify patients in one of the illnesses, respectively.
Example 4.
Let A = { A 1 (Viral fever), A 2 (Typhoid), A 3 (Pneumonia), A 4 (Stomach problem)} be a set of diagnoses and X = { x 1 (Temperature), x 2 (Cough), x 3 (Headache), x 4 (Stomach pain)} be a set of symptoms. The disease–symptom matrix that is represented by IVIFSs is listed in Table 5.
Suppose the patient B can be represented as:
B = { < x 1 , [ 0 . 4 , 0 . 5 ] , [ 0 . 1 , 0 . 2 ] > , < x 2 , [ 0 . 7 , 0 . 8 ] , [ 0 . 1 , 0 . 2 ] > , < x 3 , [ 0 . 9 , 0 . 9 ] , [ 0 . 0 , 0 . 1 ] > , < x 4 , [ 0 . 3 , 0 . 5 ] , [ 0 . 2 , 0 . 4 ] > } .
Our aim is to classify the patient B in one of the illnesses A 1 , A 2 , A 3 and A 4 . Then, we can have the following results in the environment of IVIFSs, which are listed in Table 6.
Considering the recognition principle of the maximum similarity degree for the IVIFSs, we can obtain the consequence that the similarity measure between A 2 and B is the largest one. However, the similarity measures S 2 could not distinguish which one is bigger between A 1 and A 4 . Thus, we can classify the patient B to illness A 2 due to the recognition principle. Therefore, we can diagnose that the patient’s disease is typhoid.

7. Conclusions

In this paper, a novel similarity measure for IVIFSs is proposed, which is obtained by splitting an IVIFS into two IFSs and computing the average value of the p power of any points in two triangles composed of the two intuitionistic fuzzy sets. Its superiority is presented by comparing the developed similarity measure with some existing similarity measures. Thus, we can use the similarity measure to deal with the problems with vagueness and uncertainty. For example, pattern recognition, medical diagnosis, game theory and so on.
In fact, we can choose different values of the three parameters ( t 1 , t 2 and p in Formula (5)) when facing different problems. However, there are some difficulties when choosing the value of parameters. This is also a problem to be solved in the future.

Author Contributions

M.L. initiated the research and provide the framework of this paper. J.L. wrote and complete this paper with M.L.’s validity and helpful suggeations.

Acknowledgments

The authors would like to thank the reviewers for their valuable comments and suggestions. This research was supported by the National Natural Science Foundation of China (Grant No. 61773019).

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.; Rangasamy, P. Intuitionistic Fuzzy Sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  3. Gau, W.L.; Buehrer, D.J. Vague sets. IEEE Trans. Syst. Man Cybern. 1993, 23, 610–614. [Google Scholar] [CrossRef]
  4. Bustince, H.; Burillo, P. Vague sets are intuitionistic fuzzy sets. Fuzzy Sets Syst. 1996, 79, 403–405. [Google Scholar] [CrossRef]
  5. Smarandache, F. A Unifiying Field in Logics: Neutrosophic Logic, Neutrosophy, Neutrosophic Set, Neutrosophic Probability; American Research Press: Rehoboth, DE, USA, 1999. [Google Scholar]
  6. Zhang, X.H.; Smarandache, F.; Liang, X.L. Neutrosophic duplet semi-group and cancellable neutrosophic triplet groups. Symmetry 2017, 9, 275. [Google Scholar] [CrossRef]
  7. Zhang, X.H.; Bo, C.X.; Smarandache, F.; Park, C. New operations of totally dependent- neutrosophic sets and totally dependent-neutrosophic soft sets. Symmetry 2018, 10, 187. [Google Scholar] [CrossRef]
  8. Chen, S.M. Similarity measures between vague sets and between elements. IEEE Trans. Syst. Man Cybern. Part B Cybern. 1997, 27, 153–158. [Google Scholar] [CrossRef] [PubMed]
  9. Hong, D.H.; Kim, C. A note on similarity measures between vague sets and between elements. Inf. Sci. 1999, 115, 83–96. [Google Scholar] [CrossRef]
  10. Szmidt, E.; Kacprzyk, J. Distances between intuitionistic fuzzy sets. Fuzzy Sets Syst. 2000, 114, 505–518. [Google Scholar] [CrossRef]
  11. Wang, W.Q.; Xin, X.L. Distance measure between intuitionistic fuzzy sets. Pattern Recognit. Lett. 2005, 26, 2063–2069. [Google Scholar] [CrossRef]
  12. Grzegorzewski, P. Distances between intuitionistic fuzzy sets and/or interval-valued fuzzy sets based on the Hausdorff metric. Fuzzy Sets Syst. 2004, 148, 319–328. [Google Scholar] [CrossRef]
  13. Chen, T.Y. A note on distances between intuitionistic fuzzy sets and/or interval-valued fuzzy sets based on the Hausdorff metric. Fuzzy Sets Syst. 2007, 158, 2523–2525. [Google Scholar] [CrossRef]
  14. Li, D.F.; Cheng, C. New similarity measures of intuitionistic fuzzy sets and application to pattern recognitions. Pattern Recognit. Lett. 2002, 23, 221–225. [Google Scholar] [CrossRef]
  15. Mitchell, H.B. On the Dengfeng-Chuntian similarity measure and its application to pattern recognition. Pattern Recognit. Lett. 2003, 24, 3101–3104. [Google Scholar] [CrossRef]
  16. Liang, Z.Z.; Shi, P. Similarity measures on intuitionistic fuzzy sets. Pattern Recognit. Lett. 2003, 24, 2687–2693. [Google Scholar] [CrossRef]
  17. Ye, J. Cosine similarity measures for intuitionistic fuzzy sets and their applications. Math. Comput. Model. 2011, 53, 91–97. [Google Scholar] [CrossRef]
  18. Xu, Z.S. Some similarity measures of intuitionistic fuzzy sets and their applications to multiple attribute decision making. Fuzzy Optim. Decis. Mak. 2007, 6, 109–121. [Google Scholar] [CrossRef]
  19. Boran, F.E.; Akay, D. A biparametric similarity measure on intuitionistic fuzzy sets with applications to pattern recognition. Inf. Sci. 2014, 255, 45–57. [Google Scholar] [CrossRef]
  20. Zhang, H.M.; Yu, L.Y. New distance measures between intuitionistic fuzzy sets and interval-valued fuzzy sets. Inf. Sci. 2013, 245, 181–196. [Google Scholar] [CrossRef]
  21. Luo, M.X.; Zhao, R.R. A distance measure between intuitionistic fuzzy sets and its application in medical diagnosis. Artif. Intell. Med. 2018, 89, 34–39. [Google Scholar] [CrossRef] [PubMed]
  22. Atanassov, K.T.; Gargov, G. Interval-valued intuitionistic fuzzy sets. Fuzzy Sets Syst. 1989, 31, 343–349. [Google Scholar] [CrossRef]
  23. Liu, X.D.; Zheng, S.H.; Xiong, F.L. Entropy and subsethood for general interval-valued intuitionistic fuzzy sets. Int. Conf. Fuzzy Syst. Knowl. Discov. 2005, 42–52. [Google Scholar] [CrossRef]
  24. Xu, Z.S.; Chen, J. An overview of distance and simiarity measures of intuitionistic fuzzy sets. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 2008, 16, 529–555. [Google Scholar] [CrossRef]
  25. Wei, C.P.; Wang, P.; Zhang, Y.Z. Entropy, similarity measure of interval-valued intuitionistic fuzzy sets and their applications. Inf. Sci. 2011, 181, 4273–4286. [Google Scholar] [CrossRef]
  26. Singh, P. A New Method on Measure of Similarity between Interval-Valued Intuitionistic Fuzzy Sets for Pattern Recognition. J. Appl. Comput. Math. 2012, 1. [Google Scholar] [CrossRef]
  27. Khalaf, M. Medical diagnosis via interval valued intuitionistic fuzzy sets. Ann. Fuzzy Math. Inf. 2013, 6, 245–249. [Google Scholar]
  28. Dhivya, J.; Sridevi, B. Similarity measure between interval-valued intuitionistic fzzy sets and their applications to medical diagnosis and pattern recognition. Int. J. Math. Arch. 2018, 9, 58–65. [Google Scholar]
  29. Meng, F.Y.; Chen, X. Entropy and similarity measure for Atannasov’s interval-valued intuitionistic fuzzy sets and their application. Fuzzy Optim. Decis. Mak. 2015, 15, 75–101. [Google Scholar] [CrossRef]
  30. Xu, Z.S. On similarity measures of interval-valued intuitionistic fuzzy sets and their application to pattern recognitions. J. Southeast Univ. 2007, 23, 027. [Google Scholar]
  31. Mathew, T.J.; Sherly, E.; Alcantud, J.C.R. A multimodal adaptive approach on soft set based diagnostic risk prediction system. J. Intell. Fuzzy Syst. 2018, 34, 1609–1618. [Google Scholar] [CrossRef]
  32. Celik, Y.; Yamak, S. Fuzzy soft set theory applied to medical diagnosis using fuzzy arithmetic operations. J. Inequal. Appl. 2013, 1, 82. [Google Scholar] [CrossRef]
  33. De, S.K.; Biswas, R.; Roy, A.R. An application of intuitionistic fuzzy sets in medical diagnosis. Fuzzy Sets Syst. 2001, 117, 209–213. [Google Scholar] [CrossRef]
Figure 1. Possible value for A and A + .
Figure 1. Possible value for A and A + .
Symmetry 10 00441 g001
Table 1. Comparison of similarity measures in the environment of IVIFSs (interval-valued intuitionistic fuzzy set) (counter-intuitive cases are in bold type; p = 1 in S 1 and S 2 ; p = 1 , t 1 = 2 , t 2 = 3 in S p ).
Table 1. Comparison of similarity measures in the environment of IVIFSs (interval-valued intuitionistic fuzzy set) (counter-intuitive cases are in bold type; p = 1 in S 1 and S 2 ; p = 1 , t 1 = 2 , t 2 = 3 in S p ).
1234
A i < [ 0.20 , 0.30 ] , [ 0.40 , 0.60 ] > < [ 0.20 , 0.30 ] , [ 0.40 , 0.60 ] > < [ 0.20 , 0.30 ] , [ 0.30 , 0.50 ] > < [ 0.20 , 0.30 ] , [ 0.30 , 0.50 ] >
B i < [ 0.30 , 0.40 ] , [ 0.40 , 0.60 ] > < [ 0.30 , 0.40 ] , [ 0.30 , 0.50 ] > < [ 0.30 , 0.40 ] , [ 0.40 , 0.60 ] > < [ 0.30 , 0.40 ] , [ 0.30 , 0.50 ] >
S 1 [24]0.900.900.900.95
S 2 [24]0.900.900.900.90
S D [28]1.000.980.950.94
S p 0.950.900.800.94
Table 2. Feature matrix of A 1 , A 2 , A 3 , A 4 and B.
Table 2. Feature matrix of A 1 , A 2 , A 3 , A 4 and B.
Feature1Feature2Feature3Feature4
A 1 < [ 0.10 , 0.50 ] , [ 0.20 , 0.30 ] > < [ 0.10 , 0.30 ] , [ 0.00 , 0.20 ] > < [ 0.30 , 0.50 ] , [ 0.20 , 0.40 ] > < [ 0.20 , 0.50 ] , [ 0.10 , 0.30 ] >
A 2 < [ 0.20 , 0.40 ] , [ 0.15 , 0.35 ] > < [ 0.20 , 0.20 ] , [ 0.05 , 0.15 ] > < [ 0.20 , 0.60 ] , [ 0.30 , 0.30 ] > < [ 0.30 , 0.40 ] , [ 0.15 , 0.25 ] >
A 3 < [ 0.15 , 0.30 ] , [ 0.30 , 0.40 ] > < [ 0.20 , 0.40 ] , [ 0.50 , 0.60 ] > < [ 0.50 , 0.60 ] , [ 0.15 , 0.35 ] > < [ 0.25 , 0.45 ] , [ 0.30 , 0.40 ] >
A 4 < [ 0.20 , 0.35 ] , [ 0.10 , 0.65 ] > < [ 0.35 , 0.60 ] , [ 0.05 , 0.30 ] > < [ 0.15 , 0.30 ] , [ 0.40 , 0.55 ] > < [ 0.15 , 0.25 ] , [ 0.45 , 0.55 ] >
B < [ 0.30 , 0.40 ] , [ 0.10 , 0.50 ] > < [ 0.10 , 0.40 ] , [ 0.25 , 0.40 ] > < [ 0.20 , 0.30 ] , [ 0.10 , 0.35 ] > < [ 0.15 , 0.40 ] , [ 0.20 , 0.50 ] >
Table 3. Pattern recognition result under different similarity measures (counter-intuitive cases are in bold type; p = 1 in S 1 and S 2 ; p = 1 , t 1 = 2 , t 2 = 3 in S p ; N.A. means method is not applicable).
Table 3. Pattern recognition result under different similarity measures (counter-intuitive cases are in bold type; p = 1 in S 1 and S 2 ; p = 1 , t 1 = 2 , t 2 = 3 in S p ; N.A. means method is not applicable).
S ( A 1 , B ) S ( A 2 , B ) S ( A 3 , B ) S ( A 4 , B ) Classification Results
S 1 [24]0.870.870.860.87N.A.
S 2 [24]0.750.760.790.76 A 3
S W [25]0.780.790.780.79N.A.
S D [28]0.820.860.880.88N.A.
S p 0.820.810.880.75 A 3
Table 4. Pattern recognition results under different similarity measures (counter-intuitive cases are in bold type; p = 1 in S 1 and S 2 , p = 1 , t 1 = 2 , t 2 = 3 in S p ).
Table 4. Pattern recognition results under different similarity measures (counter-intuitive cases are in bold type; p = 1 in S 1 and S 2 , p = 1 , t 1 = 2 , t 2 = 3 in S p ).
S ( A 1 , B ) S ( A 2 , B ) S ( A 3 , B ) S ( A 4 , B ) Recognition Results
S 1 [24]0.590.580.810.97 A 4
S 2 [24]0.530.530.790.94 A 4
S W [25]0.480.470.740.94 A 4
S D [28]0.640.560.830.98 A 4
S p 0.600.580.850.97 A 4
Table 5. Disease–symptom matrix.
Table 5. Disease–symptom matrix.
x 1 (Temperature) x 2 (Cough) x 3 (Headache) x 4 (Stomach Pain)
A 1 (Viral fever) < [ 0.8 , 0.9 ] , [ 0.0 , 0.1 ] > < [ 0.7 , 0.8 ] , [ 0.1 , 0.2 ] > < [ 0.5 , 0.6 ] , [ 0.2 , 0.3 ] > < [ 0.6 , 0.8 ] , [ 0.1 , 0.2 ] >
A 2 (Typhoid) < [ 0.5 , 0.6 ] , [ 0.1 , 0.3 ] > < [ 0.8 , 0.9 ] , [ 0.0 , 0.1 ] > < [ 0.6 , 0.8 ] , [ 0.1 , 0.2 ] > < [ 0.4 , 0.6 ] , [ 0.1 , 0.2 ] >
A 3 (Pneumonia) < [ 0.7 , 0.8 ] , [ 0.1 , 0.2 ] > < [ 0.7 , 0.9 ] , [ 0.0 , 0.1 ] > < [ 0.4 , 0.6 ] , [ 0.2 , 0.4 ] > < [ 0.3 , 0.5 ] , [ 0.2 , 0.4 ] >
A 4 (Stomach problem) < [ 0.8 , 0.9 ] , [ 0.0 , 0.1 ] > < [ 0.7 , 0.8 ] , [ 0.1 , 0.2 ] > < [ 0.7 , 0.9 ] , [ 0.0 , 0.1 ] > < [ 0.8 , 0.9 ] , [ 0.0 , 0.1 ] >
Table 6. Computed results under different similarity measures (counter-intuitive cases are in bold type; p = 1 in S 1 and S 2 ; p = 1 , t 1 = 2 , t 2 = 3 in S p ).
Table 6. Computed results under different similarity measures (counter-intuitive cases are in bold type; p = 1 in S 1 and S 2 ; p = 1 , t 1 = 2 , t 2 = 3 in S p ).
S ( A 1 , B ) S ( A 2 , B ) S ( A 3 , B ) S ( A 4 , B ) Recognition Result
S 1 [24]0.810.890.860.84 A 2
S 2 [24]0.730.800.780.73 A 2
S W [25]0.820.800.790.77 A 2
S D [28]0.820.910.860.84 A 2
S p 0.830.890.870.85 A 2

Share and Cite

MDPI and ACS Style

Luo, M.; Liang, J. A Novel Similarity Measure for Interval-Valued Intuitionistic Fuzzy Sets and Its Applications. Symmetry 2018, 10, 441. https://0-doi-org.brum.beds.ac.uk/10.3390/sym10100441

AMA Style

Luo M, Liang J. A Novel Similarity Measure for Interval-Valued Intuitionistic Fuzzy Sets and Its Applications. Symmetry. 2018; 10(10):441. https://0-doi-org.brum.beds.ac.uk/10.3390/sym10100441

Chicago/Turabian Style

Luo, Minxia, and Jingjing Liang. 2018. "A Novel Similarity Measure for Interval-Valued Intuitionistic Fuzzy Sets and Its Applications" Symmetry 10, no. 10: 441. https://0-doi-org.brum.beds.ac.uk/10.3390/sym10100441

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