Next Article in Journal
A Note on the Sequence Related to Catalan Numbers
Previous Article in Journal
Approximations of Metric Graphs by Thick Graphs and Their Laplacians
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Similarity and Entropy Measures of Interval Neutrosophic Sets with Applications in Multi-Attribute Decision-Making

College of Mathematics, Southwest Jiaotong University, Chengdu 610031, China
*
Author to whom correspondence should be addressed.
Symmetry 2019, 11(3), 370; https://doi.org/10.3390/sym11030370
Submission received: 9 February 2019 / Revised: 4 March 2019 / Accepted: 8 March 2019 / Published: 13 March 2019

Abstract

:
Information measures play an important role in the interval neutrosophic sets (INS) theory. The main purpose of this paper is to study the similarity and entropy of INS and its application in multi-attribute decision-making. We propose a new inclusion relation between interval neutrosophic sets where the importance of the three membership functions may be different. Then, we propose the axiomatic definitions of the similarity measure and entropy of the interval neutrosophic set (INS) based on the new inclusion relation. Based on the Hamming distance, cosine function and cotangent function, some new similarity measures and entropies of INS are constructed. Finally, based on the new similarity and entropy, we propose a multi-attribute decision-making method and illustrate that these new similarities and entropies are reasonable and effective.

1. Introduction

Zadeh [1,2] put forward the theory of fuzzy sets in 1965, which is an effective method to deal with fuzzy information, but only limited to the truth-membership function. In actual decision-making, because of the fuzziness of people’s thinking and the complexity of objective things, it is difficult for decision-makers to evaluate only through truth-membership function. On this basis, Atanassov [3] proposed an intuitionistic fuzzy set, and added a falsity-membership function to the fuzzy set to represent uncertain information. That is to say, the intuitionistic fuzzy concentration has both truth-membership function T A ( x ) and falsity-membership function F A ( x ) , and T A ( x ) , F A ( x ) [ 0 , 1 ] , 0 ≤ T A ( x ) + F A ( x ) ≤ 1. However, intuitionistic fuzzy sets can only solve incomplete information, but can not deal with the uncertain information and inconsistent information in practical decision-making problems. For example, when voting, some agreed, some opposed and some abstained. Therefore, Smarandache [4] proposed the concept of neutrosophic sets. On the basis of the intuitionistic fuzzy set, a neutrosophic set is characterized independently by the truth-membership function T A ( x ) , the falsity-membership function F A ( x ) , and the indeterminacy-membership function I A ( x ) . Wang et al. [5,6] proposed the concept of single-valued neutrosophic sets (SVNS) and interval neutrosophic sets (INS), which are the subclasses of neutrosophic sets, and the set-theoretic operators and various properties of SVNSs and INSs are given. In the interval neutrosophic sets, the truth-membership function T A ( x ) , the indeterminacy-membership function I A ( x ) , and the falsity-membership function F A ( x ) are all expressed in the form of interval numbers. Then, some researchers put forward some algorithms of SVNSs and INSs, and applied them to decision-making problems. The correlation coefficients and weighted correlation coefficients of single-valued neutrosophic sets are proposed by Ye [7,8]. It is proved that the cosine similarity under singular concentration is a special case of the correlation coefficients. Furthermore, a single-valued neutrosophic cross-entropy measurement method is proposed and applied to multi-attribute decision-making in single-valued neutrosophic environment. Chi and Liu [9] applied a TOPSIS (The Order Performance technique based on Similarity to Ideal Solution) method to classify interval neutrosophic multi-attribute decision-making problems to alternative levels. Ye [10] proposed the Hamming distance and the Euclidean distance in INSs and defined similarity measure based on distance, and applied them to multi-attribute decision-making with interval neutrosophic information. In addition, Ye [11] proposed the definition of a simplified neutrosophic set (SNS). It is a subclass of the neutrosophic set and includes an SVNS and an INS. Ye also proposed some aggregation operators, including a simplified neutrosophic weighted arithmetic average operator and a simplified neutrosophic weighted geometric average operator. Based on the two aggregation operators and cosine similarity measure for SNSs, a multicriteria decision-making method is established. Zhang et al. [12] further proposed the comparison rules on the basis of truth-membership function, indeterminacy-membership function, and falsity-membership function of interval neutrosophic number (INN). Based on the possibility degree of two interval numbers, a comparison method was proposed. Then, the interval neutrosophic number weighted averaging (INNWA) operator and interval neutrosophic number weighted geometry (INNWG) operator were developed and applied to interval neutrosophic multi-attribute decision-making problems.
In 1972, De Luca and Termin gave the axiomatization definition of fuzzy entropy to characterize the degree of uncertainty [13]. Similarity is mainly used to estimate the degree of similarity between two objects. Wang [14] proposes the definition of similarity based on distance. Ye [7,8,10,11,15,16], Ridvan Sahin et al. [17] studied the similarity and entropy of the interval neutrosophic sets from different angles. Zhang et al. [18,19] proposed a new inclusion relationship of single-valued neutrosophic sets (called type-3 inclusion relations), and gave the algebraic structure of the singular-valued neutrosophic set corresponding to the type-3 inclusion relationship. Based on the third inclusion relationship, Keyun Qin [20] proposed new similarity and entropy.
In this paper, we first give the definitions of the neutrosophic sets, interval neutrosophic sets, then define the new inclusion relationship of the interval neutrosophic sets, and then give the new similarity and entropy based on the new inclusion relationship. Then, apply it to multi-attribute decisions. In Section 2, we introduced the related concepts of the neutrosophic sets and redefined the inclusion relationship. In Section 3, we introduced the similarity and entropy of interval neutrosophic value, and based on the new inclusion relationship, we reestablish a similarity and entropy. Then, we extend the similarity and entropy of the interval neutrosophic value to the interval neutrosophic sets. In Section 4, we give an example of applying new similarities and entropies to multi-attribute decisions, and compare with other methods, the results show that the proposed similarity and entropy are reasonable and effective.

2. Preliminaries

In this section, we recall some fundamental notions and properties related to an interval neutrosophic set.
Definition 1.
(See [4]) Let X be an object set and x be an element in the object set X. A neutrosophic set A of X can be expressed as
A = { [ x , ( T A ( x ) , I A ( x ) , F A ( x ) ) ] | x X } ,
where T A ( x ) , I A ( x ) and F A ( x ) are real standard or nonstandard subsets of ] 0 , 1 + [ , which represent truth-membership, indeterminacy-membership, and falsity-membership, respectively, 0 T A ( x ) + I A ( x ) + F A ( x ) 3 + .
In order to easily apply a neutrosophic set theory to science and engineering, Wang et al. [5] presented the concept of interval neutrosophic set (INS) as follows.
Definition 2.
(See [5]) Let X be an object set, an interval neutrosophic set A of X can be expressed as
A = { [ x , ( T A ( x ) , I A ( x ) , F A ( x ) ) ] | x X } ,
where, for each x ∈ X, T A ( x ) , I A ( x ) and F A ( x ) respectively represent truth-membership, indeterminacy-membership, and falsity-membership, which are sub-sets belonging to [0, 1]. In addition, ( ( T A ( x ) , I A ( x ) , F A ( x ) ) ) is the interval neutrosophic value.
Definition 3.
(See [5]) The complement of A is defined as A c = { [ x , ( T A c ( x ) , I A c ( x ) , F A c ( x ) ] | x X } , among them T A c = F A ( x ) = [ F A L ( x ) , F A U ( x ) ] , I A c ( x ) = [ 1 I A U ( x ) , 1 I A L ( x ) ] , F A c = T A ( x ) = [ T A L ( x ) , T A U ( x ) ] .
For the inclusion relation of single-valued neutrosophic sets, an original definition is proposed by Smarandache. It is called type-1 inclusion relation in [18,19]. Another one is called type-2 inclusion relation. Similarly, in the interval neutrosophic set, an original definition is proposed by Smarandache, we call it type-1 inclusion relation, and denoted by 1 .
Definition 4.
(See [5]) let A, B be the two interval neutrosophic sets, A 1 B if and only if T A L ( x ) T B L ( x ) , T A U ( x ) T B U ( x ) , I A L ( x ) I B L ( x ) , I A U ( x ) I B U ( x ) , F A L ( x ) F B L ( x ) , F A U ( x ) F B U ( x ) .
Definition 5.
Suppose that intervals [ α 1 , β 1 ] , [ α 2 , β 2 ] [ 0 , 1 ] , then
(1) 
[ α 1 , β 1 ] [ α 2 , β 2 ] , iff α 1 α 2 and β 1 β 2 ;
(2) 
[ α 1 , β 1 ] < [ α 2 , β 2 ] , iff [ α 1 , β 1 ] [ α 2 , β 2 ] and α 1 < α 2 (or β 1 < β 2 ).
In Definition 4, truth-membership, indeterminacy-membership, and falsity-membership are equally important, but, in some cases, people tend to pay more attention to true membership and false membership, so Zhang et al. [19] proposed a new kind of inclusion relation and examined the basic properties of the new kind of inclusion relation.
Definition 6.
(See [19]) Let A and B be two neutrosophic sets in the universe X. The type-3 inclusion relation is defined as follows: A 2 B if and only if x X , ( T A ( x ) < T B ( x ) , F A ( x ) < F B ( x ) ) , or ( T A ( x ) = T B ( x ) , F A ( x ) F B ( x ) ) , or ( T A ( x ) = T B ( x ) , F A ( x ) = F B ( x )   a n d   I A ( x ) > I B ( x ) ) .
Based on [19], we define a new inclusion relation called type-2 in the same way, and denoted by 2 .
Definition 7.
Let x = ( [ x 1 L , x 1 U ] , [ x 2 L , x 2 U ] , [ x 3 L , x 3 U ] ) and y = ( [ y 1 L , y 1 U ] , [ y 2 L , y 2 U ] , [ y 3 L , y 3 U ] ) be the interval neutrosophic values. x 2 y if and only if one of the following three conditions is true:
(1) 
[ x 1 L , x 1 U ] < [ y 1 L , y 1 U ] and [ x 3 L , x 3 U ] [ y 3 L , y 3 U ] ;
(2) 
[ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] and [ x 3 L , x 3 U ] > [ y 3 L , y 3 U ] ;
(3) 
[ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] and [ x 3 L , x 3 U ] = [ y 3 L , y 3 U ] and [ x 2 L , x 2 U ] [ y 2 L , y 2 U ] .
The inclusion relations 2 of interval neutrosophic sets are based on it. Let A, B be the two interval neutrosophic sets, A 2 B if and only if one of the following three conditions is true:
(1) 
[ T A L ( x ) , T A U ( x ) ] < [ T B L ( x ) , T B U ( x ) ] and [ F A L ( x ) , F A U ( x ) ] [ F B L ( x ) , F B U ( x ) ] ;
(2) 
[ T A L ( x ) , T A U ( x ) ] = [ T B L ( x ) , T B U ( x ) ] and [ F A L ( x ) , F A U ( x ) ] > [ F B L ( x ) , F B U ( x ) ] ;
(3) 
[ T A L ( x ) , T A U ( x ) ] = [ T B L ( x ) , T B U ( x ) ] and [ F A L ( x ) , F A U ( x ) ] = [ F B L ( x ) , F B U ( x ) ] and [ I A L ( x ) , I A U ( x ) ] [ I B L ( x ) , I B U ( x ) ] .

3. Similarity and Entropy of Interval Neutrosophic Sets

3.1. Similarity of Interval Neutrosophic Value

Let D = { x | x = ( [ x 1 L , x 1 U ] , [ x 2 L , x 2 U ] , [ x 3 L , x 3 U ] ) } be the set of interval neutrosophic values.
Definition 8.
(See [10]) Letting S: D × D [ 0 , 1 ] , the real function S is a similarity between interval neutrosophic values x and y, if S satisfies the following conditions:
(P1) 
0 S ( x , y ) 1 ;
(P2) 
S ( x , y ) = 1 if and only if x = y ;
(P3) 
S ( x , y ) = S ( y , x ) ;
(P4) 
For all x, y, z D , if x y z , then S ( x , z ) S ( x , y ) , S ( x , z ) S ( y , z ) .
Based on the first inclusion, many similarities have been proposed, such as [10,21]:
S 1 ( x , y ) = 1 1 6 ( | x 1 L y 1 L | + | x 1 U y 1 U | + | x 2 L y 2 L | + | x 2 U y 2 U | + | x 3 L y 3 L | + | x 3 U y 3 U | ) ;
S 2 ( x , y ) = 1 1 6 ( ( x 1 L y 1 L ) 2 + ( x 1 U y 1 U ) 2 + ( x 2 L y 2 L ) 2 + ( x 2 U y 2 U ) 2 + ( x 3 L y 3 L ) 2 + ( x 3 U y 3 U ) 2 ) 1 2 ;
S 3 ( x , y ) = 1 1 3 { max [ | x 1 L y 1 L | , | x 1 U y 1 U | ] + max [ | x 2 L y 2 L | , | x 2 U y 2 U | ] + max [ | x 3 L y 3 L | , | x 3 U y 3 U | ] } ;
S 4 ( x , y ) = 1 max [ 1 2 ( | x 1 L y 1 L | + | x 1 U y 1 U | ) , 1 2 ( | x 2 L y 2 L | , | x 2 U y 2 U | ) + 1 2 ( | x 3 L y 3 L | + | x 3 U y 3 U | ) ] .
The above similarity is based on the first inclusion to successfully solve many problems, but it is not suitable to the inclusion relationship in Definition 7. For example, x = ([0.3,0.4], [0.1,0.2], [0.8,0.9]), y = ([0.5,0.6], [0.7,0.9], [0.4,0.5]), z = ([0.5,0.7], [0.4,0.5], [0.2,0.3]), then S 1 ( x , y ) = 35 60 0.5833 , S 1 ( y , z ) = 0.8 , S 1 ( x , z ) = 37 60 0.6167 , so S 1 ( x , y ) < S 1 ( x , z ) . S 2 ( x , y ) 0.8137 , S 2 ( y , z ) 0.9028 , S 2 ( x , z ) 0.8309 , so S 2 ( x , y ) < S 2 ( x , z ) . S 3 ( x , y ) = 17 30 0.5667 , S 3 ( y , z ) = 23 30 0.7667 , S 3 ( x , z ) = 0.6 , so S 3 ( x , y ) < S 3 ( x , z ) . S 4 ( x , y ) = 0.35 , S 4 ( y , z ) = 0.65 , S 4 ( x , z ) = 0.4 , so S 4 ( x , y ) < S 4 ( x , z ) .
Through the above analysis, we propose a new similarity based on 2 .
Definition 9.
Let x = ( [ x 1 L , x 1 U ] , [ x 2 L , x 2 U ] , [ x 3 L , x 3 U ] ) , y = ( [ y 1 L , y 1 U ] , [ y 2 L , y 2 U ] , [ y 3 L , y 3 U ] ) , We define the following similarity:
S ( x , y ) = 1 | x 2 L y 2 L | + | x 2 U y 2 U | 4 , 4 | x 1 L y 1 L | | x 1 U y 1 U | | x 3 L y 3 L | | x 3 U y 3 U | 8 , [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] and [ x 3 L , x 3 U ] = [ y 3 L , y 3 U ] . else .
Theorem 1.
S ( x , y ) defined as formula (1) is a similarity between x and y.
Proof. 
Let x = ( [ x 1 L , x 1 U ] , [ x 2 L , x 2 U ] , [ x 3 L , x 3 U ] ) D , y = ( [ y 1 L , y 1 U ] , [ y 2 L , y 2 U ] , [ y 3 L , y 3 U ] ) D , if [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] and [ x 3 L , x 3 U ] = [ y 3 L , y 3 U ] , then S ( x , y ) = 1 | x 2 L y 2 L | + | x 2 U y 2 U | 4 , so 0.5 S ( x , y ) 1 ; if [ x 1 L , x 1 U ] [ y 1 L , y 1 U ] and [ x 3 L , x 3 U ] [ y 3 L , y 3 U ] , then S ( x , y ) = 4 | x 1 L y 1 L | | x 1 U y 1 U | | x 3 L y 3 L | | x 3 U y 3 U | 8 , so 0 S ( x , y ) 0.5 .
(P1) 
Obviously, 0 S ( x , y ) 1 .
(P2) 
S ( x , y ) = 1 , if and only if S ( x , y ) = 1 | x 2 L y 2 L | + | x 2 U y 2 U | 4 , if and only if [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] = [ y 3 L , y 3 U ] and [ x 2 L , x 2 U ] = [ y 2 L , y 2 U ] .
(P3) 
Obviously, S ( x , y ) = S ( y , x ) .
(P4) 
Let x = ( [ x 1 L , x 1 U ] , [ x 2 L , x 2 U ] , [ x 3 L , x 3 U ] ) , y = ( [ y 1 L , y 1 U ] , [ y 2 L , y 2 U ] , [ y 3 L , y 3 U ] ) , z = ( [ z 1 L , z 1 U ] , [ z 2 L , z 2 U ] , [ z 3 L , z 3 U ] ) ,
and x y z , then
(1) If [ x 1 L , x 1 U ] < [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] [ y 3 L , y 3 U ] and [ y 1 L , y 1 U ] < [ z 1 L , z 1 U ] , [ y 3 L , y 3 U ] [ z 3 L , z 3 U ] , so S ( x , y ) = 4 | x 1 L y 1 L | | x 1 U y 1 U | | x 3 L y 3 L | | x 3 U y 3 U | 8 , S ( y , z ) = 4 | y 1 L z 1 L | | y 1 U z 1 U | | y 3 L z 3 L | | y 3 U z 3 U | 8 , S ( x , z ) = 4 | x 1 L z 1 L | | x 1 U z 1 U | | x 3 L z 3 L | | x 3 U z 3 U | 8 , also because [ x 1 L , x 1 U ] < [ y 1 L , y 1 U ] < [ z 1 L , z 1 U ] , [ x 3 L , x 3 U ] [ y 3 L , y 3 U ] [ z 3 L , z 3 U ] , so S ( x , z ) S ( x , y ) , S ( x , z ) S ( y , z ) .
(2) If [ x 1 L , x 1 U ] < [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] [ y 3 L , y 3 U ] and [ y 1 L , y 1 U ] = [ z 1 L , z 1 U ] , [ y 3 L , y 3 U ] > [ z 3 L , z 3 U ] , so S ( x , y ) = 4 | x 1 L y 1 L | | x 1 U y 1 U | | x 3 L y 3 L | | x 3 U y 3 U | 8 , S ( y , z ) = 4 | y 1 L z 1 L | | y 1 U z 1 U | | y 3 L z 3 L | | y 3 U z 3 U | 8 , S ( x , z ) = 4 | x 1 L z 1 L | | x 1 U z 1 U | | x 3 L z 3 L | | x 3 U z 3 U | 8 , also because [ x 1 L , x 1 U ] < [ y 1 L , y 1 U ] = [ z 1 L , z 1 U ] , [ x 3 L , x 3 U ] [ y 3 L , y 3 U ] > [ z 3 L , z 3 U ] , so S ( x , z ) S ( x , y ) , S ( x , z ) S ( y , z ) .
(3) If [ x 1 L , x 1 U ] < [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] [ y 3 L , y 3 U ] and [ y 1 L , y 1 U ] = [ z 1 L , z 1 U ] , [ y 3 L , y 3 U ] = [ z 3 L , z 3 U ] , [ y 2 L , y 2 U ] [ z 2 L , z 2 U ] , so S ( x , y ) = 4 | x 1 L y 1 L | | x 1 U y 1 U | | x 3 L y 3 L | | x 3 U y 3 U | 8 , S ( y , z ) = 1 | y 2 L z 2 L | + | y 2 U z 2 U | 4 , S ( x , z ) = 4 | x 1 L z 1 L | | x 1 U z 1 U | | x 3 L z 3 L | | x 3 U z 3 U | 8 , also because [ x 1 L , x 1 U ] < [ y 1 L , y 1 U ] = [ z 1 L , z 1 U ] , [ x 3 L , x 3 U ] [ y 3 L , y 3 U ] = [ z 3 L , z 3 U ] , [ y 2 L , y 2 U ] [ z 2 L , z 2 U ] , so S ( x , z ) S ( x , y ) , S ( x , z ) < 0.5 S ( y , z ) .
(4) If [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] > [ y 3 L , y 3 U ] and [ y 1 L , y 1 U ] < [ z 1 L , z 1 U ] , [ y 3 L , y 3 U ] [ z 3 L , z 3 U ] , so S ( x , y ) = 4 | x 1 L y 1 L | | x 1 U y 1 U | | x 3 L y 3 L | | x 3 U y 3 U | 8 , S ( y , z ) = 4 | y 1 L z 1 L | | y 1 U z 1 U | | y 3 L z 3 L | | y 3 U z 3 U | 8 , S ( x , z ) = 4 | x 1 L z 1 L | | x 1 U z 1 U | | x 3 L z 3 L | | x 3 U z 3 U | 8 , also because [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] < [ z 1 L , z 1 U ] , [ x 3 L , x 3 U ] > [ y 3 L , y 3 U ] [ z 3 L , z 3 U ] , so S ( x , z ) S ( x , y ) , S ( x , z ) S ( y , z ) .
(5) If [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] > [ y 3 L , y 3 U ] and [ y 1 L , y 1 U ] = [ z 1 L , z 1 U ] , [ y 3 L , y 3 U ] > [ z 3 L , z 3 U ] , so S ( x , y ) = 4 | x 1 L y 1 L | | x 1 U y 1 U | | x 3 L y 3 L | | x 3 U y 3 U | 8 , S ( y , z ) = 4 | y 1 L z 1 L | | y 1 U z 1 U | | y 3 L z 3 L | | y 3 U z 3 U | 8 , S ( x , z ) = 4 | x 1 L z 1 L | | x 1 U z 1 U | | x 3 L z 3 L | | x 3 U z 3 U | 8 , also because [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] = [ z 1 L , z 1 U ] , [ x 3 L , x 3 U ] > [ y 3 L , y 3 U ] > [ z 3 L , z 3 U ] , so S ( x , z ) S ( x , y ) , S ( x , z ) S ( y , z ) .
(6) If [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] > [ y 3 L , y 3 U ] and [ y 1 L , y 1 U ] = [ z 1 L , z 1 U ] , [ y 3 L , y 3 U ] = [ z 3 L , z 3 U ] , [ y 2 L , y 2 U ] [ z 2 L , z 2 U ] , so S ( x , y ) = 4 | x 1 L y 1 L | | x 1 U y 1 U | | x 3 L y 3 L | | x 3 U y 3 U | 8 , S ( y , z ) = 1 | y 2 L z 2 L | + | y 2 U z 2 U | 4 , S ( x , z ) = 4 | x 1 L z 1 L | | x 1 U z 1 U | | x 3 L z 3 L | | x 3 U z 3 U | 8 , also because [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] = [ z 1 L , z 1 U ] , [ x 3 L , x 3 U ] > [ y 3 L , y 3 U ] = [ z 3 L , z 3 U ] , [ y 2 L , y 2 U ] [ z 2 L , z 2 U ] , so S ( x , z ) = S ( x , y ) , S ( x , z ) < 0.5 S ( y , z ) .
(7) If [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] = [ y 3 L , y 3 U ] , [ x 2 L , x 2 U ] [ y 2 L , y 2 U ] and [ y 1 L , y 1 U ] < [ z 1 L , z 1 U ] , [ y 3 L , y 3 U ] [ z 3 L , z 3 U ] , so S ( x , y ) = 1 | x 2 L y 2 L | + | x 2 U y 2 U | 4 , S ( y , z ) = 4 | y 1 L z 1 L | | y 1 U z 1 U | | y 3 L z 3 L | | y 3 U z 3 U | 8 , S ( x , z ) = 4 | x 1 L z 1 L | | x 1 U z 1 U | | x 3 L z 3 L | | x 3 U z 3 U | 8 , also because [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] < [ z 1 L , z 1 U ] , [ x 3 L , x 3 U ] = [ y 3 L , y 3 U ] [ z 3 L , z 3 U ] , [ x 2 L , x 2 U ] [ y 2 L , y 2 U ] , so S ( x , z ) < 0.5 S ( x , y ) , S ( x , z ) S ( y , z ) .
(8) If [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] = [ y 3 L , y 3 U ] , [ x 2 L , x 2 U ] [ y 2 L , y 2 U ] and [ y 1 L , y 1 U ] = [ z 1 L , z 1 U ] , [ y 3 L , y 3 U ] > [ z 3 L , z 3 U ] , so S ( x , y ) = 1 | x 2 L y 2 L | + | x 2 U y 2 U | 4 , S ( y , z ) = 4 | y 1 L z 1 L | | y 1 U z 1 U | | y 3 L z 3 L | | y 3 U z 3 U | 8 , S ( x , z ) = 4 | x 1 L z 1 L | | x 1 U z 1 U | | x 3 L z 3 L | | x 3 U z 3 U | 8 , also because [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] = [ z 1 L , z 1 U ] , [ x 3 L , x 3 U ] = [ y 3 L , y 3 U ] > [ z 3 L , z 3 U ] , [ x 2 L , x 2 U ] [ y 2 L , y 2 U ] , so S ( x , z ) < 0.5 S ( x , y ) , S ( x , z ) S ( y , z ) .
(9) If [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] = [ y 3 L , y 3 U ] , [ x 2 L , x 2 U ] [ y 2 L , y 2 U ] and [ y 1 L , y 1 U ] = [ z 1 L , z 1 U ] , [ y 3 L , y 3 U ] = [ z 3 L , z 3 U ] , [ y 2 L , y 2 U ] [ z 2 L , z 2 U ] , so S ( x , y ) = 1 | x 2 L y 2 L | + | x 2 U y 2 U | 4 , S ( y , z ) = 1 | y 2 L z 2 L | + | y 2 U z 2 U | 4 , S ( x , z ) = 1 | x 2 L z 2 L | + | x 2 U z 2 U | 4 , also because [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] = [ z 1 L , z 1 U ] , [ x 3 L , x 3 U ] = [ y 3 L , y 3 U ] = [ z 3 L , z 3 U ] , [ x 2 L , x 2 U ] [ y 2 L , y 2 U ] [ z 2 L , z 2 U ] , so S ( x , z ) < 0.5 S ( x , y ) , S ( x , z ) = S ( y , z ) .
Therefore, as defined in formula (1), a similarity between x and y is defined. □

3.2. Entropy of Interval Neutrosophic Value

Since entropy is also an important means in the analysis of uncertainty information, we give the concept of entropy of interval neutrosophic value.
Definition 10.
(See [22]) Letting E: D [ 0 , 1 ] , the real function E is an entropy of interval neutrosophic value, if E satisfies the following conditions:
(N1) 
E ( x ) = 0 if and only if [ x 1 L , x 1 U ] = [ 0 , 0 ] or [ 1 , 1 ] and [ x 3 L , x 3 U ] = [ 0 , 0 ] or [ 1 , 1 ] ;
(N2) 
E ( x ) = 1 if and only if [ x 1 L , x 1 U ] = [ x 2 L , x 2 U ] = [ x 3 L , x 3 U ] = [ 0.5 , 0.5 ] ;
(N3) 
E ( x ) = E ( x c ) ;
(N4) 
Let x = ( [ x 1 L , x 1 U ] , [ x 2 L , x 2 U ] , [ x 3 L , x 3 U ] ) D , y = ( [ y 1 L , y 1 U ] , [ y 2 L , y 2 U ] , [ y 3 L , y 3 U ] ) D , then y c = ( [ y 3 L , y 3 U ] , [ 1 y 2 U , 1 y 2 L ] , [ y 1 L , y 1 U ] ) , E ( x ) E ( y ) , that is, x is more ambiguous than y, if x 2 y , when y 2 y c , or if y 2 x , when y c 2 y .
Entropy is usually calculated by the similarity of x and x c , so we define the following entropy:
E ( x ) = S ( x , x c ) = 1 | 2 x 2 L 1 | + | 2 x 2 U 1 | 4 , 4 2 | x 1 L x 3 L | 2 | x 1 U x 3 U | 8 , [ x 1 L , x 1 U ] = [ x 3 L , x 3 U ] = [ 0.5 , 0.5 ] , else .
Furthermore, if interval neutrosophic values are a fuzzy set i.e.,
D = x | x = ( [ x 1 L , x 1 u ] , [ x 1 L , x 1 u ] , [ 1 x 1 L , 1 x 1 u ] ) ,
then Definition 10 is equivalent to the definition of entropy measure given by de Luca and Termini [13]. If interval neutrosophic values are an intuitionistic fuzzy set i.e.,
D = x | x = ( [ x 1 L , x 1 u ] , [ 1 x 1 u x 3 u , 1 x 1 L x 3 L ] , [ x 3 L , x 3 u ] ) ,
then Definition 10 is equivalent to the definition of entropy measure given in [23].
Theorem 2.
E ( x ) defined as (2) is an entropy of x.
Proof. 
If [ x 1 L , x 1 U ] = [ x 3 L , x 3 U ] = [ 0.5 , 0.5 ] , then E ( x ) = 1 | 2 x 2 L 1 | + | 2 x 2 U 1 | 4 , so 0.5 E ( x ) 1 ; otherwise, E ( x ) = 4 2 | x 1 L x 3 L | 2 | x 1 U x 3 U | 8 , so 0 E ( x ) 0.5 .
(N1) 
E ( x ) = 0 if and only if | x 1 L x 1 U | = 1 and | x 3 L x 3 U | = 1 , also because [ x 1 L , x 1 U ] [ 0 , 1 ] and [ x 3 L , x 3 U ] [ 0 , 1 ] , so [ x 1 L , x 1 U ] = [ 0 , 0 ] o r [ 1 , 1 ] , [ x 1 L , x 1 U ] = [ 1 , 1 ] o r [ 0 , 0 ] , so x is a distinct set.
(N2) 
Obviously, E ( x ) = 1 if and only if [ x 1 L , x 1 U ] = [ x 2 L , x 2 U ] = [ x 3 L , x 3 U ] = [ 0.5 , 0.5 ] ,
(N3) 
Obviously, E ( x ) = E ( x c ) .
(N4) 
Let x = ( [ x 1 L , x 1 U ] , [ x 2 L , x 2 U ] , [ x 3 L , x 3 U ] ) D , y = ( [ y 1 L , y 1 U ] , [ y 2 L , y 2 U ] , [ y 3 L , y 3 U ] ) D , then y = ( [ y 3 L , y 3 U ] , [ 1 y 2 U , 1 y 2 L ] , [ y 1 L , y 1 U ] ) , if x 2 y , when y 2 y c , because
E ( x ) = 1 | 2 x 2 L 1 | + | 2 x 2 U 1 | 4 , 4 2 | x 1 L x 3 L | 2 | x 1 U x 3 U | 8 , [ x 1 L , x 1 U ] = [ x 3 L , x 3 U ] = [ 0.5 , 0.5 ] , else ,
E ( y ) = 1 | 2 y 2 L 1 | + | 2 y 2 U 1 | 4 , 4 2 | y 1 L y 3 L | 2 | y 1 U y 3 U | 8 , [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] = [ 0.5 , 0.5 ] . else .
(1) If [ y 1 L , y 1 U ] < [ y 3 L , y 3 U ] , [ y 3 L , y 3 U ] [ y 1 L , y 1 U ] and [ x 1 L , x 1 U ] < [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] [ y 3 L , y 3 U ] , so [ x 1 L , x 1 U ] < [ y 1 L , y 1 U ] < [ y 3 L , y 3 U ] [ x 3 L , x 3 U ] , therefore | x 1 L x 3 L | | y 1 L y 3 L | , | x 1 U x 3 U | | y 1 U y 3 U | , also because E ( x ) = 4 2 | x 1 L x 3 L | 2 | x 1 U x 3 U | 8 , E ( y ) = 4 2 | y 1 L y 3 L | 2 | y 1 U y 3 U | 8 , so E ( x ) E ( y ) .
(2) If [ y 1 L , y 1 U ] < [ y 3 L , y 3 U ] , [ y 3 L , y 3 U ] [ y 1 L , y 1 U ] and [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] > [ y 3 L , y 3 U ] , so [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] < [ y 3 L , y 3 U ] [ x 3 L , x 3 U ] , therefore | x 1 L x 3 L | | y 1 L y 3 L | , | x 1 U x 3 U | | y 1 U y 3 U | , also because E ( x ) = 4 2 | x 1 L x 3 L | 2 | x 1 U x 3 U | 8 , E ( y ) = 4 2 | y 1 L y 3 L | 2 | y 1 U y 3 U | 8 , so E ( x ) E ( y ) .
(3) If [ y 1 L , y 1 U ] < [ y 3 L , y 3 U ] , [ y 3 L , y 3 U ] [ y 1 L , y 1 U ] and [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] = [ y 3 L , y 3 U ] , [ x 2 L , x 2 U ] = [ y 2 L , y 2 U ] , so [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] < [ y 3 L , y 3 U ] = [ x 3 L , x 3 U ] , therefore | x 1 L x 3 L | | y 1 L y 3 L | , | x 1 U x 3 U | | y 1 U y 3 U | , also because E ( x ) = 4 2 | x 1 L x 3 L | 2 | x 1 U x 3 U | 8 , E ( y ) = 4 2 | y 1 L y 3 L | 2 | y 1 U y 3 U | 8 , so E ( x ) E ( y ) .
(4) If [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] , [ y 3 L , y 3 U ] > [ y 1 L , y 1 U ] , contradiction.
(5) If [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] , [ y 2 L , y 2 U ] [ 1 y 2 U , 1 y 1 L ] and [ x 1 L , x 1 U ] < [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] [ y 3 L , y 3 U ] , so [ x 1 L , x 1 U ] < [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] [ x 3 L , x 3 U ] ; if [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] = [ 0.5 , 0.5 ] , then E ( x ) = 4 2 | x 1 L x 3 L | 2 | x 1 U x 3 U | 8 , E ( y ) = 1 | 2 y 2 L 1 | + | 2 y 2 U 1 | 4 , so E ( x ) 0.5 E ( y ) ; if [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] [ 0.5 , 0.5 ] , then E ( x ) = 4 2 | x 1 L x 3 L | 2 | x 1 U x 3 U | 8 , E ( y ) = 4 2 | y 1 L y 3 L | 2 | y 1 U y 3 U | 8 , also because | x 1 L x 3 L | | y 1 L y 3 L | = 0 , | x 1 U x 3 U | | y 1 U y 3 U | = 0 , so E ( x ) E ( y ) . In summary, E ( x ) E ( y ) .
(6) If [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] , [ y 2 L , y 2 U ] [ 1 y 2 U , 1 y 1 L ] and [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] > [ y 3 L , y 3 U ] , so [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] < [ x 3 L , x 3 U ] ; if [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] = [ 0.5 , 0.5 ] , then E ( x ) = 4 2 | x 1 L x 3 L | 2 | x 1 U x 3 U | 8 , E ( y ) = 1 | 2 y 2 L 1 | + | 2 y 2 U 1 | 4 , so E ( x ) 0.5 E ( y ) ; if [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] [ 0.5 , 0.5 ] , then E ( x ) = 4 2 | x 1 L x 3 L | 2 | x 1 U x 3 U | 8 , E ( y ) = 4 2 | y 1 L y 3 L | 2 | y 1 U y 3 U | 8 , also because | x 1 L x 3 L | | y 1 L y 3 L | = 0 , | x 1 U x 3 U | | y 1 U y 3 U | = 0 , so E ( x ) E ( y ) . In summary, E ( x ) E ( y ) .
(7) If [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] , [ y 2 L , y 2 U ] [ 1 y 2 U , 1 y 1 L ] and [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] , [ x 3 L , x 3 U ] = [ y 3 L , y 3 U ] , [ x 2 L , x 2 U ] [ y 2 L , y 2 U ] , so [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] = [ x 3 L , x 3 U ] ; if [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] = [ x 3 L , x 3 U ] = [ 0.5 , 0.5 ] , then E ( x ) = 1 | 2 x 2 L 1 | + | 2 x 2 U 1 | 4 , E ( y ) = 1 | 2 y 2 L 1 | + | 2 y 2 U 1 | 4 , also because [ x 2 L , x 2 U ] [ y 2 L , y 2 U ] , so E ( x ) 0.5 E ( y ) ; if [ x 1 L , x 1 U ] = [ y 1 L , y 1 U ] = [ y 3 L , y 3 U ] = [ x 3 L , x 3 U ] [ 0.5 , 0.5 ] , then E ( x ) = 4 2 | x 1 L x 3 L | 2 | x 1 U x 3 U | 8 , E ( y ) = 4 2 | y 1 L y 3 L | 2 | y 1 U y 3 U | 8 , also because | x 1 L x 3 L | = | y 1 L y 3 L | = 0 , | x 1 U x 3 U | = | y 1 U y 3 U | = 0 , so E ( x ) = E ( y ) . In summary, E ( x ) E ( y ) .
As the same reason, we can easily get the conclusion that if y 2 x , when y c 2 y , then E ( x ) E ( y ) . Therefore, as defined in formula (2), an entropy is defined. □

3.3. Similarity and Entropy of Interval Neutrosophic Sets

In this subsection, we extend the notions of similarity measure and entropy measure of interval nuetrosophic values to interval nuetrosophic sets.
Definition 11.
Let A, B be the two interval neutrosophic sets, the real function S is a similarity between interval neutrosophic sets A and B, if S satisfies the following conditions:
(P1) 
0 S ( A , B ) 1 ;
(P2) 
S ( A , B ) = 1 if and only if A = B ;
(P3) 
S ( A , B ) = S ( B , A ) ;
(P4) 
For all A, B, C I N S s , if A B C , then S ( A , C ) S ( A , B ) , S ( A , C ) S ( B , C ) .
Definition 12.
Let A be the an interval neutrosophic set, the real function E is the entropy of interval neutrosophic sets, if E satisfies the following conditions:
(N1) 
E ( A ) = 0 if and only if [ T A L , T A U ] = [ 0 , 0 ] o r [ 1 , 1 ] , [ F A L , F A U ] = [ 0 , 0 ] o r [ 1 , 1 ] ;
(N2) 
E ( A ) = 1 if and only if [ T A L , T A U ] = [ I A L , I A U ] = [ F A L , F A U ] = [ 0.5 , 0.5 ] ;
(N3) 
E ( A ) = E ( A c ) ;
(N4) 
Let A, B be the two interval neutrosophic sets, E ( A ) E ( B ) , that is, B is more ambiguous than A, if A 2 B , when B 2 B c , or B 2 A , when B c 2 B .
By aggregating the similarities and entropies of interval neutrosophic values, we have the following similarity and entropy of interval neutrosophic sets.
Theorem 3.
Let X = { x 1 , x 2 , x n } be an interval neutrosophic set, s : D × D [ 0 , 1 ] is the similarity of interval neutrosophic sets, A , B X , the similarity S of A and B is defined as follows:
S ( A , B ) = 1 n i = 1 n s ( A ( x i ) , B ( x i ) ) .
Theorem 4.
Let X = { x 1 , x 2 , x n } be an interval neutrosophic seet, e : D [ 0 , 1 ] is the entropy of interval neutrosophic sets, A X , the similarity S of A is defined as follows:
E ( A ) = 1 n i = 1 n e ( A ( x i ) ) .
If the weights W = ( w 1 , w 2 , , w n ) is added, w i [ 0 , 1 ] and i = 1 n w i = 1 , then the similarities of A and B and the entropy of A are defined as follows:
S ( A , B ) = i = 1 n w i · s ( A ( x i ) , B ( x i ) ) ,
E ( A ) = i = 1 n w i · e ( A ( x i ) ) .

4. The Numerical Example

Let us consider the decision problem adapted from [10]. Suppose that there is a group with four possible alternatives to invest: (1) A 1 is a food company; (2) A 2 is a car company; (3) A 3 is a weapons company; (4) A 4 is a computer company. Investment companies must make decisions based on three criteria: (1) C 1 is growth analysis; (2) C 2 is risk analysis; and (3) C 3 is environmental impact analysis. By using interval-valued intuitionistic fuzzy information, decision makers evaluated four possible alternatives based on the above three criteria and the evaluation are expressed as three interval neutrosophic sets (Table 1).

4.1. Ye’s Multi-Attributes Decision-Making Method with Analysis

Ye [10] presented a multi-attributes decision-making method by using a single-valued neutrosophic set. The approach can be described as follows. Ye presents the definitions of the Hamming and Euclidean distances between INSs and the similarity measures between INSs based on the distances, which can be used in real scientific and engineering applications.
(1) The Hamming distance
d 1 ( A , B ) = 1 6 i = 1 n ( | T A L ( x i ) T B L ( x i ) | + | T A U ( x i ) T B U ( x i ) | + | I A L ( x i ) I B L ( x i ) | + | I A U ( x i ) I B U ( x i ) | + | F A L ( x i ) F B L ( x i ) | + | F A U ( x i ) F B U ( x i ) | ) ;
(2) The Euclidean distance
d 2 ( A , B ) = 1 6 i = 1 n ( ( T A L ( x i ) T B L ( x i ) ) 2 + ( T A U ( x i ) T B U ( x i ) ) 2 + ( I A L ( x i ) I B L ( x i ) ) 2 + ( I A U ( x i ) I B U ( x i ) ) 2 + ( F A L ( x i ) F B L ( x i ) ) 2 + ( F A U ( x i ) F B U ( x i ) ) 2 ) 1 2 ;
Thus, the similarity measures between INSs are based on the distances as follows:
S 1 ( A , B ) = 1 1 6 i = 1 n ( | T A L ( x i ) T B L ( x i ) | + | T A U ( x i ) T B U ( x i ) | + | I A L ( x i ) I B L ( x i ) | + | I A U ( x i ) I B U ( x i ) | + | F A L ( x i ) F B L ( x i ) | + | F A U ( x i ) F B U ( x i ) | ) ;
S 2 ( A , B ) = 1 1 6 i = 1 n ( ( T A L ( x i ) T B L ( x i ) ) 2 + ( T A U ( x i ) T B U ( x i ) ) 2 + ( I A L ( x i ) I B L ( x i ) ) 2 + ( I A U ( x i ) I B U ( x i ) ) 2 + ( F A L ( x i ) F B L ( x i ) ) 2 + ( F A U ( x i ) F B U ( x i ) ) 2 ) 1 2 .
From the interval neutrosophic decision matrix, Ye obtain the following ideal alternative:
A = ( ( [ 0.7 , 0.8 ] , [ 0.0 , 0.1 ] , [ 0.1 , 0.2 ] ) , ( [ 0.6 , 0.7 ] , [ 0.1 , 0.2 ] , [ 0.1 , 0.3 ] ) , ( [ 0.3 , 0.6 ] , [ 0.3 , 0.5 ] , [ 0.8 , 0.9 ] ) ) .
Thus, S 1 ( A 1 , A ) = 0.7667 , S 1 ( A 2 , A ) = 0.9542 , S 1 ( A 3 , A ) = 0.8625 , S 1 ( A 4 , A ) = 0.9600 . Therefore, S 1 ( A 4 , A ) > S 1 ( A 2 , A ) > S 1 ( A 3 , A ) > S 1 ( A 1 , A ) , so A 4 is the best choice. Meanwhile, S 2 ( A 1 , A ) = 0.7370 , S 2 ( A 2 , A ) = 0.9323 , S 2 ( A 3 , A ) = 0.8344 , S 2 ( A 4 , A ) = 0.9034 . Therefore, S 2 ( A 2 , A ) > S 2 ( A 4 , A ) > S 2 ( A 3 , A ) > S 4 ( A 1 , A ) , so A 4 is the best choice.

4.2. Multi-Attributes Decision Making Based on a New Similarity Measure

Next, we use the newly proposed similarity and entropy to get the best alternative. The best choice is A = ( [ 1 , 1 ] , [ 1 , 1 ] , [ 0 , 0 ] ) because it is the largest in the second type of inclusion relationship, so it is optimal. For convenience, we use A i j that indicates the neutrosophic value in line i column j. It is available from (1), S ( A 11 , A ) = 0.275 , S ( A 12 , A ) = 0.3 , S ( A 13 , A ) = 0.3375 , S ( A 21 , A ) = 0.35 , S ( A 22 , A ) = 0.35 , S ( A 23 , A ) = 0.15 , S ( A 31 , A ) = 0.275 , S ( A 32 , A ) = 0.225 , S ( A 33 , A ) = 0.1625 , S ( A 41 , A ) = 0.4 , S ( A 42 , A ) = 0.3625 , S ( A 43 , A ) = 0.2 . Thus, by (3), we can obtain that S ( A 1 , A ) = 1 3 × 0.275 + 1 3 × 0.3 + 1 3 × 0.3375 0.3042 , for the same reason, we can obtain that S ( A 2 , A ) 0.2833 , S ( A 3 , A ) 0.2208 , S ( A 4 , A ) 0.3208 . Therefore, S ( A 4 , A ) > S ( A 1 , A ) > S ( A 2 , A ) > S ( A 3 , A ) , so A 4 is the best choice.
In order to validate the feasibility of the proposed decision-making methods, a comparative study was conducted with other methods as follows.
In the similarity measures in [10], due to the differences in inclusion relation and in the best choice, we have different conclusions. Moreover, in [10], the distances between INSs are first calculated and any difference is then amplified in the results using criteria weights, which cause a distortion in the similarity between an alternative and the ideal alternative. Meanwhile, in [17], Sahin defined the interval neutrosophic cross-entropy in two different ways, which are based on extension of fuzzy cross-entropy and single-valued neutrosophic cross-entropy. Additionally, two multi-criteria decision-making methods using the interval neutrosophic cross-entropy between an alternative and the ideal alternative are developed in order to determine the order of the alternatives and choose the most preferred one(s). In addition, Sahin ranked the alternatives as A 4 > A 1 > A 2 > A 3 . For this example, by using the new similarity measure proposed in this paper, we obtained the same ranking order of alternatives as in [17]. It shows that the new similarity measures proposed in this paper are effective and efficient.

5. Discussion and Conclusions

Based on the existing inclusion relation of the wisdom set in the interval, this paper combines the new inclusion relation type-3 of the single-valued neutrosophic sets proposed by Zhang [18,19], and gives the inclusion relationship of the new interval neutrosophic sets. The existing similarity measure is mainly designed for the original inclusion relationship, and does not apply to the new inclusion relationship, then we propose the similarity and entropy of the interval neutrosophic set. The new similarity and entropy also prove that the defined similarity and entropy satisfy the corresponding axiomatization definition, and finally apply it to the corresponding multi-attribute decision-making. The results show that the proposed similarity and entropy are reasonable and effective.

Author Contributions

All authors have contributed equally to this paper.

Funding

This work has been supported by the National Natural Science Foundation of China (Grant No. 61473239).

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]
  2. Zadeh, L.A. Is there a need for fuzzy logic? Inf. Sci. 2008, 178, 2751–2779. [Google Scholar]
  3. Atanassov, K.T. Intuitionistic. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar]
  4. Smarandache, F. Neutrosophic: Neutrosophic Probability, Set and Logic; American Researcher Press: Rehoboth, DE, USA, 1999. [Google Scholar]
  5. Wang, H.; Samarandache, F.; Zhang, Y.Q.; Sunderraman, R. Interval Neutrosophic Sets and Logic: Theory and Applications in Conputing; Hexis: Phoenix, AZ, USA, 2005. [Google Scholar]
  6. Wang, H.; Samarandache, F.; Zhang, Y.Q.; Sunderraman, R. Single valued neutrosophic sets. Multispace Multistruct. 2010, 4, 410–413. [Google Scholar]
  7. Ye, J. Multicriteria fuzzy decision-making method based on a novel accuracy function under interval-valued intuitionistic fuzzy environment. Expert Syst. Appl. 2009, 36, 6899–6902. [Google Scholar]
  8. Ye, J. Single valued neutrosophic cross-entropy for multicriteria decision-making problems. Appl. Math. Model. 2014, 38, 1170–1175. [Google Scholar]
  9. Chi, P.P.; Liu, P.D. An extended TOPSIS method for multiple attribute decision-making problems based on interval neutrosophic set. Neutrosophic Sets Syst. 2013, 1, 63–70. [Google Scholar]
  10. Ye, J. Similarity measures between interval neutrosophic sets and their applications in multicriteria decision-making. J. Intell. Fuzzy Syst. 2014, 26, 165–172. [Google Scholar]
  11. Ye, J. A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. J. Intell. Fuzzy Syst. 2014, 26, 2459–2466. [Google Scholar]
  12. Zhang, H.Y.; Wang, J.Q.; Chen, X.H. Interval neutrosophic sets and their application in multicriteria decision-making problems. Sci. World J. 2014, 2014, 645953. [Google Scholar] [CrossRef]
  13. De, L.A.; Termini, S.A. A definition of a non-probabilistic entropy in the setting of fuzzy sets theory. Inf. Control 1972, 20, 301–311. [Google Scholar]
  14. Wang, C.; Qu, A.J. Entropy, similarity measure and distance measure of vague soft sets and their relations. Inf. Sci. 2013, 224, 92–106. [Google Scholar]
  15. Ye, J. Two effective measures of intuitionistic fuzzy entropy. Computing 2010, 87, 55–62. [Google Scholar]
  16. Ye, J. Multicriteria group decision-making method using the distance-based similarity measures between intuitionistic trapezoidal fuzzy numbers. Int. J. Gen. Syst. 2012, 41, 729–739. [Google Scholar]
  17. Sahin, R. Cross-entropy measure on interval neutrosophic sets and its applications in multicriteria decision-making. Neural Comput. Appl. 2017, 28, 1177–1187. [Google Scholar]
  18. Zhang, X.H.; Bo, C.X.; Smarandache, F.; Dai, J.H. New inclusion relation of neutrosophic sets with applications and related lattice structure. Int. J. Mach. Learn. Cybern. 2018. [Google Scholar] [CrossRef]
  19. 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]
  20. Qin, K.Y.; Wang, L. New similarity and entropy measures of single-valued neutrosophic sets with applications in multi-attribute decision-making. Soft Compt. 2019. in reviewing. [Google Scholar]
  21. Ye, J. Some distances, similarity and entropy measures for interval-valued neutrosophic sets and their relationship. Int. J. Mach. Learn. Cybern. 2019, 10, 347–355. [Google Scholar]
  22. Liu, C.F.; Lou, Y.S. A new method to construct entropy of interval-valued neutrosophic set. Nuetrosophic Sets Syst. 2016, 11, 8–11. [Google Scholar]
  23. Piasecki, K. Someremarks on axiomatic definition of entropy measure. J. Intell. Fuzzy Syst. 2017, 33. [Google Scholar] [CrossRef]
Table 1. The evaluation of alternatives.
Table 1. The evaluation of alternatives.
C 1 C 2 C 3
A 1 ([0.4,0.5], [0.2,0.3], [0.3,0.4])([0.4,0.6], [0.1,0.3], [0.2,0.4])([0.7,0.9], [0.2,0.3], [0.4,0.5])
A 2 ([0.6,0.7], [0.1,0.2], [0.2,0.3])([0.6,0.7], [0.1,0.2], [0.2,0.3])([0.3,0.6], [0.3,0.5], [0.8,0.9])
A 3 ([0.3,0.6], [0.2,0.3], [0.3,0.4])([0.5,0.6], [0.2,0.3], [0.3,0.4])([0.4,0.5], [0.2,0.4], [0.7,0.9])
A 4 ([0.7,0.8], [0.0,0.1], [0.1,0.2])([0.6,0.7], [0.1,0.2], [0.1,0.3])([0.6,0.7], [0.3,0.4], [0.8,0.9])

Share and Cite

MDPI and ACS Style

Yang, H.; Wang, X.; Qin, K. New Similarity and Entropy Measures of Interval Neutrosophic Sets with Applications in Multi-Attribute Decision-Making. Symmetry 2019, 11, 370. https://doi.org/10.3390/sym11030370

AMA Style

Yang H, Wang X, Qin K. New Similarity and Entropy Measures of Interval Neutrosophic Sets with Applications in Multi-Attribute Decision-Making. Symmetry. 2019; 11(3):370. https://doi.org/10.3390/sym11030370

Chicago/Turabian Style

Yang, Han, Xiaoman Wang, and Keyun Qin. 2019. "New Similarity and Entropy Measures of Interval Neutrosophic Sets with Applications in Multi-Attribute Decision-Making" Symmetry 11, no. 3: 370. https://doi.org/10.3390/sym11030370

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