Abstract
In this paper, we propose new vector similarity measures of single-valued and interval neutrosophic sets by hybridizing the concepts of Dice and cosine similarity measures. We present their applications in multi-attribute decision making under neutrosophic environment. We use these similarity measures to find out the best alternative by determining the similarity measure values between the ideal alternative and each alternative. The results of the proposed similarity measures have been validated by comparing with other existing similarity measures reported in the literature for multi-attribute decision making. The main thrust of the proposed similarity measures will be in the field of practical decision making, medical diagnosis, pattern recognition, data mining, clustering analysis, etc.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
1 Introduction
Multi-attribute decision making (MADM) has received much attention to the researchers as it has caught great acceptance in the areas of operations research, social economics, and management science, etc. We encounter MADM problems under various situations, where the number of feasible alternatives and actions needs to be selected based on a set of predefined attributes. Lots of researches have been done on MADM problems, where the ratings of alternatives and/or attribute values are expressed in terms of crisp numbers [1], interval numbers [2], fuzzy numbers [3], interval-valued fuzzy numbers [4], intuitionistic fuzzy numbers [5], interval-valued intuitionistic fuzzy numbers [6], grey numbers [7, 8], etc. However, in realistic situations, due to time pressure, complexity of the problem, lack of information processing capabilities, poor knowledge of the public domain and information, decision makers cannot provide exact evaluation of decision parameters involved in MADM problems. In such situation, preference information of alternatives with respect to the attributes provided by the decision makers may be imprecise or incomplete in nature.
Imprecise or incomplete type of information can be dealt with neutrosophic sets (NSs), originally developed by Smarandache [9, 10]. NSs are characterized by truth, indeterminacy, and falsity membership functions which are independent in nature. In MADM context, the ratings of the alternatives provided by the decision maker can be expressed with NSs. These NSs can handle indeterminate and inconsistent information quite well, whereas intuitionistic fuzzy sets and fuzzy sets can only handle incomplete or partial information. The application of neutrosophic set in MADM problems becomes recently an attractive and interesting topic to the researchers [11–14]. From scientific and engineering point of view, Wang et al. [15] proposed single-valued neutrosophic set (SVNS) and offered some basic definitions regarding the set theoretic operators. However, in reality, sometimes the truth, the indeterminacy, and the falsity degree of a certain statement can be easily defined by interval numbers instead of crisp values. Wang et al. [16] proposed interval neutrosophic set (INS) and provided some definitions relating to set theoretic operators. As an important part of the modern decision science, some methods have been developed for MADM problems in single-valued neutrosophic set or interval neutrosophic set environment, for example weighted aggregation operators [17–22], TOPSIS method [23, 24], outranking method [25, 26], grey relational analysis method [27–29], inclusion measures [30], subset-hood measure [31], and maximizing deviation method [32].
However, as an effective method and a wide range of applications in various fields, similarity measure [33–37] can be used as a fruitful tool to deal with MADM problems, in which largest weighted similarity measure value between positive ideal alternative and alternatives determines the best alternative. Majumdar and Samanta [38] defined some similarity measures between two SVNSs with the help of distance measure, matching function, and membership grades of neutrosophic sets. Ye [39] proposed improved correlation coefficient of SVNS, studied some of its properties, and then extended it to a correlation coefficient between INSs. Broumi and Smarandache [40] defined Hausdorff distance measure between two neutrosophic sets and provided some similarity measures based on these distances. They also proposed the similarity measure between two neutrosophic sets by using set theoretic approach and matching function in the same discussion. Ye [41] developed some similarity measures of INSs and applied them to multi-criteria decision-making problems. Furthermore, Ye [42] proposed another similarity measure called vector similarity measure of SVNSs and INSs by considering the SVNS as a three-dimensional vector elements. Similarly, Broumi and Smarandache [43] extended the concept of cosine similarity measure of SVNSs into INSs and applied it to pattern recognition. Ye [44] developed the improved cosine similarity measure by using the vector concept and used it to medical diagnosis.
In the paper, we propose hybrid vector similarity measures for both SVNSs and INSs by extending the concept of variation coefficient similarity method [45] to neutrosophic environment and establish some of their basic properties. We also present the application of these proposed similarity measures to MADM under SVNSs and INSs. In order to do so, the rest of the paper is organized as follows: Sect. 2 presents the preliminaries of neutrosophic sets, SVNSs, and INSs. Section 3 represents vector similarity measure of SVNSs and INSs. Section 4 is devoted to develop the hybrid vector similarity measures for SVNSs and INSs. Hybrid vector similarity measure-based MADM problems under SVNSs and INSs environment are described in Sect. 5. Finally, in Sect. 6, two examples are provided to illustrate the MADM problems under SVNSs and INSs environment and compared the results with other existing methods to demonstrate the effectiveness of the proposed similarity measures.
2 Preliminaries
In this section, we provide a brief overview of the concepts of neutrosophic sets, single-valued neutrosophic sets, interval neutrosophic sets, some vector similarity measures, and some of their properties.
2.1 Single-valued neutrosophic set
Definition 1
Let X be a space of points (objects) with generic element in X denoted by x. Then a neutrosophic set [9, 10] A in X is characterized by a truth membership function \(T_{A}(x)\), an indeterminacy membership function \(I_{A}(x)\), and a falsity membership function \(F_{A}(x)\). The functions \(T_{A}(x),I_{A}(x)\), and \(F_{A}(x)\) in X are real standard and non-standard subsets of \(]{}^{-}0, 1^{+}[\) and satisfy the relation
However, Smarandache [9] introduced the neutrosophic set from philosophical point of view. To deal with science and engineering applications, Wang et al. [15] introduced the concept of SVNS, which is a subclass of the neutrosophic set and provided the following definitions.
Definition 2
Let X be a universal space of points (objects), with a generic element in X denoted by x. A single-valued neutrosophic set [15] \(A\subseteq X\) is characterized by a truth membership function \(T_{A}(x)\), an indeterminacy membership function \(I_{A}(x)\), and a falsity membership function \(F_{A}(x)\). Then a SVNS A can be denoted by the following form: \(A= \{\langle x, T_{A}(x),I_{A}(x),F_{A}(x) \rangle | x\in X \}\) where \(T_{A}(x),I_{A}(x)\), and \(F_{A}(x)\) belong to the unit interval [0, 1] for all \(x\in X\). Therefore, the sum of \(T_{A}(x),I_{A}(x)\), and \(F_{A}(x)\) satisfies the condition \(0 \le T_{A}(x)+I_{A}(x)+F_{A}(x)\le 3\).
For convenience, we assume that \(A =\big \langle T_{A}(x),I_{A}(x),F_{A}(x)\big \rangle\) is the single-valued neutrosophic set in X.
Definition 3
Let A and B be two SVNSs defined by \(A=\big \langle T_{A}(x),I_{A}(x),F_{A}(x)\big \rangle\) and \(B=\big \langle T_{B}(x),I_{B}(x),F_{B}(x)\big \rangle\) in a universe of discourse X. Then some operational rules [15, 19] are presented as follows:
-
1.
Complement: \(A^{c}=\big \langle F_{A}(x),1-I_{A}(x),T_{A}(x)\big \rangle\)
-
2.
Containment: \(A\subseteq B\) if and only if \(T_{A}(x)\le T_{B}(x), I_{A}(x)\ge I_{B}(x),F_{A}(x)\ge F_{B}(x)\) for all x in X;
-
3.
Equality: \(A= B\) if and only if \(A\subseteq B\) and \(A\supseteq B\)
-
4.
Union: \(A\cup B=\big \langle x, T_{A}(x)\vee T_{B}(x),I_{A}(x)\wedge I_{B}(x),F_{A}(x)\wedge F_{B}(x)\big \rangle\) for all x in X;
-
5.
Intersection: \(A\cap B=\big \langle x, T_{A}(x)\wedge T_{B}(x),I_{A}(x)\vee I_{B}(x),F_{A}(x)\vee F_{B}(x)\big \rangle\) for all x in X;
-
6.
Addition: \(A\oplus B=\left\{ \big \langle x, T_{A}(x)+ T_{B}(x)-T_{A}(x)\cdot T_{B}(x) ,I_{A}(x)\cdot I_{B}(x),F_{A}(x)\cdot F_{B}(x)\big \rangle |x\in X\right\}\);
-
7.
Multiplication: \(\begin{aligned} A\otimes B=\left\{ \left\langle \begin{array}{ll} x,T_{A}(x). T_{B}(x), &{} I_{A}(x)+I_{B}(x)-I_{A}(x)\cdot I_{B}(x), \\ &{} F_{A}(x)+F_{B}(x)-F_{A}(x)\cdot F_{B}(x) \end{array} \right\rangle |x\in X\right\}\end{aligned}\).
2.2 Interval neutrosophic set
Definition 4
Let D[0, 1] be the set of all closed subintervals of the interval [0, 1] and let X be an ordinary finite non-empty set. An interval neutrosophic set (INS) [16] \(\tilde{A}\) in X is an object of the form
where \(\tilde{T}_{\tilde{A}}(x)\in D[0,1]\), \(\tilde{I}_{\tilde{A}}(x)\in D[0,1]\), and \(\tilde{F}_{\tilde{A}}(x)\in D[0,1]\) with the relation
Here intervals \(\tilde{T}_{\tilde{A}}(x)= \left[ T_{\tilde{A}}^{L}(x),T_{\tilde{A}}^{U}(x) \right] \subset [0,1],\tilde{I}_{\tilde{A}}(x)= \left[ I_{\tilde{A}}^{L}(x),I_{\tilde{A}}^{U}(x) \right] \subset [0,1], \tilde{F}_{\tilde{A}}(x)= \left[ F_{\tilde{A}}^{L}(x),F_{\tilde{A}}^{U}(x) \right] \subset [0,1]\) denote, respectively, the degree of truth, indeterminacy, and falsity membership of \(x \in X\) in \(\tilde{A}\); moreover, \(T_{\tilde{A}}^{L}(x)\)= \(inf \tilde{T}_{\tilde{A}}(x), T_{\tilde{A}}^{U}(x) =sup \tilde{T}_{\tilde{A}}(x),I_{\tilde{A}}^{L}(x)=inf \tilde{I}_{\tilde{A}}(x),I_{\tilde{A}}^{U}(x)=sup \tilde{I}_{\tilde{A}}(x),F_{\tilde{A}}^{L}(x)= inf \tilde{F}_{\tilde{A}}(x),F_{\tilde{A}}^{U}(x)= sup \tilde{F}_{\tilde{A}}(x)\) for every \(x\in X\). Thus, the interval neutrosophic set \(\tilde{A}\) can be expressed in the following interval format:
where \(0\le sup T_{\tilde{A}}^{U}(x)+ sup I_{\tilde{A}}^{U}(x)+ sup F_{\tilde{A}}^{U}(x)\le 3, T_{\tilde{A}}^{L}(x)\ge 0, I_{\tilde{A}}^{L}(x)\ge 0\) and \(F_{\tilde{A}}^{L}(x)\ge 0\) for all \(x\in X\).
For convenience of computation, we assume that \(\tilde{A} =\big \langle \tilde{T}_{\tilde{A}}(x),\tilde{I}_{\tilde{A}}(x),\tilde{F}_{\tilde{A}}(x)\big \rangle\) is the interval neutrosophic set in X.
Definition 5
Let \(\tilde{A}=\big \langle \tilde{T}_{\tilde{A}}(x),\tilde{I}_{\tilde{A}}(x),\tilde{F}_{\tilde{A}}(x)\big \rangle\) and \(\tilde{B} =\big \langle \tilde{T}_{\tilde{B}}(x),\tilde{I}_{\tilde{B}}(x),\tilde{F}_{\tilde{B}}(x)\big \rangle\) be two INSs in a universe of discourse X, then the following operations [16] are defined as follows:
-
1.
Complement: \(\tilde{A^{c}}=\{ \langle x,[ F_{\tilde{A}}^{L}(x),F_{\tilde{A}}^{U}(x)] , [ 1-I_{\tilde{A}}^{U}(x),1-I_{\tilde{A}}^{L}(x)] , [ T_{\tilde{A}}^{L}(x),T_{\tilde{A}}^{U}(x)] \rangle |x\in X \}\);
-
2.
Inclusion: \(\tilde{A}\subseteq \tilde{B}\) if and only if \(T_{\tilde{A}}^{L}(x)\le T_{\tilde{B}}^{L}(x),T_{\tilde{A}}^{U}(x)\le T_{\tilde{B}}^{U}(x), I_{\tilde{A}}^{L}(x)\ge I_{\tilde{B}}^{L}(x),I_{\tilde{A}}^{U}(x)\ge I_{\tilde{B}}^{U}(x),F_{\tilde{A}}^{L}(x)\ge F_{\tilde{B}}^{L}(x),F_{\tilde{A}}^{U}(x)\ge F_{\tilde{B}}^{U}(x)\) for all \(x\in X\);
-
3.
Equality: \(\tilde{A}=\tilde{B}\) if and only if \(\tilde{A}\subseteq \tilde{B}\) and \(\tilde{A}\supseteq \tilde{B}\) for all \(x\in X\);
-
4.
Union: \(\tilde{A}\cup \tilde{B}= \{ \langle x, [ T_{\tilde{A}}^{L}(x)\vee T_{\tilde{B}}^{L}(x), T_{\tilde{A}}^{U}(x)\vee T_{\tilde{B}}^{U}(x)] , [ I_{\tilde{A}}^{L}(x)\wedge I_{\tilde{B}}^{L}(x), I_{\tilde{A}}^{U}(x)\wedge I_{\tilde{B}}^{U}(x)] , [ F_{\tilde{A}}^{L}(x)\wedge F_{\tilde{B}}^{L}(x), F_{\tilde{A}}^{U}(x)\wedge F_{\tilde{B}}^{U}(x)] \rangle |x\in X \}\);
-
5.
Intersection: \(\tilde{A}\cap \tilde{B}= \{ \langle x, [ T_{\tilde{A}}^{L}(x)\wedge T_{\tilde{B}}^{L}(x), T_{\tilde{A}}^{U}(x)\wedge T_{\tilde{B}}^{U}(x)] , [ I_{\tilde{A}}^{L}(x)\vee I_{\tilde{B}}^{L}(x), I_{\tilde{A}}^{U}(x)\vee I_{\tilde{B}}^{U}(x)] , [ F_{\tilde{A}}^{L}(x)\vee F_{\tilde{B}}^{L}(x), F_{\tilde{A}}^{U}(x)\vee F_{\tilde{B}}^{U}(x)] \rangle |x\in X \}\).
2.3 Vector similarity measures
The vector similarity measure is one of the important tools for the degree of similarity between objects. However, the Jaccard, Dice, and cosine similarity measures are often used for this purpose. In the following discussions, we recall some definitions of the Jaccard [46], Dice [47], and cosine [48] similarity measures between two vectors. Let \(X = (x_{1}, x_{2},\ldots , x_{n})\;\hbox {and}\;Y = (y_{1}, y_{2},\ldots , y_{n} )\) be two n-dimensional vectors with positive coordinates.
Definition 6
The Jaccard similarity measure [46] between two vectors \(X= (x_{1}, x_{2},\ldots , x_{n})\;\hbox {and}\; Y= (y_{1}, y_{2},\ldots , y_{n})\) is defined as follows:
where \(||X||=\sqrt{\sum _{i=1}^{n}x_{i}^{2}}\) and \(||Y||=\sqrt{\sum _{i=1}^{n}y_{i}^{2}}\) are the Euclidean norms of X and Y, \(X\cdot Y=\sum _{i=1}^{n}x_{i}y_{i}\) is the inner product of the vectors X and Y. Then, this similarity measure satisfies the following properties:
-
J1.
\(0\le J(X,Y)\le 1\);
-
J2.
\(J(X,Y)=J(Y,X)\);
-
J3.
\(J(X,Y)=1\) for \(X=Y\) i.e., \(x_{i}=y_{i}(i=1,2,\ldots ,n)\) for every \(x_{i}\in X\) and \(y_{i}\in Y\).
Definition 7
The Dice similarity measure [47] between two vectors \(X = (x_{1}, x_{2},\ldots , x_{n} )\) and \(Y = (y_{1}, y_{2},\ldots , y_{n} )\) is defined as follows:
It satisfies the following properties:
-
E1.
\(0\le E(X,Y)\le 1\);
-
E2.
\(E(X,Y)=E(Y,X)\);
-
E3.
\(E(X,Y)=1\) for \(X=Y\) i.e., \(x_{i}=y_{i}(i=1,2,\ldots ,n)\) for every \(x_{i}\in X\) and \(y_{i}\in Y\).
Definition 8
The cosine similarity measure [48] between two vectors \(X = (x_{1}, x_{2},\ldots , x_{n} )\) and \(Y = (y_{1}, y_{2},\ldots , y_{n} )\) is the inner product of these two vectors divided by the product of their lengths and is defined as follows:
It satisfies the following properties:
-
C1.
\(0\le C(X,Y)\le 1\);
-
C2.
\(C(X,Y)=C(Y,X)\);
-
C3.
\(C(X,Y)=1\) for \(X=Y\) i.e., \(x_{i}=y_{i}(i=1,2,\ldots ,n)\) for every \(x_{i}\in X\) and \(y_{i}\in Y\).
These three formulas are similar in the sense that they assume values in the interval [0, 1]. Jaccard and Dice similarity measures are undefined when \(x_{i}=0\) and \(y_{i}=0\), and cosine similarity measure is undefined when \(x_{i}=0\) or \(y_{i}=0\) for \(i=1,2,\ldots ,n\).
Definition 9
The variation coefficient similarity measure [45] between two vectors \(X = (x_{1}, x_{2},\ldots , x_{n} )\) and \(Y = (y_{1}, y_{2},\ldots , y_{n} )\) is defined as follows:
It satisfies the following properties:
-
V1.
\(0\le V(X,Y)\le 1\);
-
V2.
\(V(X,Y)=V(Y,X)\);
-
V3.
\(V(X,Y)=1\) for \(X=Y\) i.e., \(x_{i}=y_{i}(i=1,2,\ldots ,n)\) for every \(x_{i}\in X\) and \(y_{i}\in Y\).
3 Vector similarity measures of SVNSs and INSs
3.1 Vector similarity measures of SVNSs
We assume that the triples \(\left\langle T_{A}(x_i), I_{A}(x_i), F_{A}(x_i)\right\rangle\) and \(\left\langle T_{B}(x_i), I_{B}(x_i), F_{B}(x_i)\right\rangle\) represent, respectively, the coordinates of two SVNSs \(A =\left\{ \left\langle {T_A(x_i)},{I_A(x_i)},{F_A(x_i)} \right\rangle \mid x_i\in X \right\}\) and \(B=\left\{ \left\langle {T_B(x_i)},{I_B(x_i)},{F_B(x_i)} \right\rangle \mid x_i\in X \right\}\) in a three-dimensional space. Then the vector similarity measures between SVNSs can be defined as follows.
Definition 10
Let \(A =\left\langle {T_A(x_i)},{I_A(x_i)},{F_A(x_i)} \right\rangle\) and \(B=\left\langle {T_B(x_i)},{I_B(x_i)},{F_B(x_i)} \right\rangle\) be two SVNSs in a universe of discourse \(X =\left\{ x_1,x_2, \ldots ,x_n \right\}\). Then the Jaccard similarity measure [39] between SVNSs A and B in the vector space is defined as follows:
and if \(w_{i}\in [0,1]\) be the weight of each element \(x_{i}\) for \(i=1,2,\ldots ,n\) such that \(\sum _{i=1}^{n}w_{i} =1\), then the weighted Jaccard similarity measure [39] between SVNSs A and B is defined as follows:
Definition 11
Let \(A =\left\langle {T_A(x_i)},{I_A(x_i)},{F_A(x_i)} \right\rangle\) and \(B=\left\langle {T_B(x_i)},{I_B(x_i)},{F_B(x_i)} \right\rangle\) be two SVNSs in a universe of discourse \(X =\left\{ x_1,x_2, \ldots ,x_n \right\}\). Then the Dice similarity measure [39] between SVNSs A and B in the vector space is defined as follows:
and if \(w_{i}\in [0,1]\) be the weight of each element \(x_{i}\) for \(i=1,2,\ldots ,n\) such that \(\sum _{i=1}^{n}w_{i} =1\), then the weighted Dice similarity measure [39] between SVNSs A and B is defined as follows:
Definition 12
Let \(A =\left\langle {T_A(x_i)},{I_A(x_i)},{F_A(x_i)} \right\rangle\) and \(B=\left\langle {T_B(x_i)},{I_B(x_i)},{F_B(x_i)} \right\rangle\) be two SVNSs in a universe of discourse \(X =\left\{ x_1,x_2, \ldots ,x_n \right\}\). Then the cosine similarity measure [39] between SVNSs A and B in the vector space is defined as follows:
and if \(w_{i}\in [0,1]\) be the weight of each element \(x_{i}\) for \(i=1,2,\ldots ,n\) such that \(\sum _{i=1}^{n}w_{i} =1\), then the weighted cosine similarity measure [39] between SVNSs A and B is defined as follows:
Equations (6), (8), and (10) satisfy the following properties:
-
P1.
\(0\le Jac_{w}(A, B) \le 1;\, 0\le Dic_{w}(A, B) \le 1;\, 0\le Cos_{w}(A, B) \le 1\);
-
P2.
\(Jac_{w}(A, B) =Jac_{w}(B, A) ;\, Dic_{w}(A, B) =Dic_{w}(B, A)\); and \(Cos_{w}(A, B) =Cos_{w}(B, A)\);
-
P3.
\(Jac_{w}(A, B)=1 ;\,Dic_{w}(A, B)=1 ;\,Cos_{w}(A, B)=1\) if \(B = A\) i.e., \(T_{A}(x_{i})=T_{B}(x_{i}),I_{A}(x_{i})=I_{B}(x_{i})\), and \(F_{A}(x_{i})=F_{B}(x_{i})\) for every \(x_{i}(i=1,2,\ldots ,n)\) in X.
Jaccard and Dice similarity measures between two SVNSs \(A = \left\langle T_{A}(x_i), I_{A}(x_i), F_{A}(x_i) \right\rangle\) and \(B =\left\langle T_{B}(x_i), I_{B}(x_i), F_{B}(x_i)\right\rangle\) are undefined for \(A = \left\langle 0, 0, 0\right\rangle\) and \(B = \left\langle 0, 0, 0\right\rangle\) that is when \(T_{A}=I_{A}=F_{A}=0\) and \(T_{B}=I_{B}=F_{B}=0\) for all \(i=1,2,\ldots ,n\). Similarly, the cosine similarity measure is undefined for \(A = \left\langle 0, 0, 0\right\rangle\) or \(B = \left\langle 0, 0, 0\right\rangle\) that is when \(T_{A}=I_{A}=F_{A}=0\) or \(T_{B}=I_{B}=F_{B}=0\) for all \(i=1,2,\ldots ,n\). In this case, the similarity measure values \(Jac_{w}(A, B), Dic_{w}(A, B)\) and \(Cos_{w}(A, B)\) of SVNSs A and B are assumed to be zero.
3.2 Vector similarity measure of INSs
Let \(\tilde{A} = \left\langle \tilde{T}_{\tilde{A}}(x_i), \tilde{I}_{\tilde{A}}(x_i), \tilde{F}_{\tilde{A}}(x_i) \right\rangle\) and \(\tilde{B} = \left\langle \tilde{T}_{\tilde{B}}(x_i), \tilde{I}_{\tilde{B}}(x_i), \tilde{F}_{\tilde{B}}(x_i) \right\rangle\) be two INSs in a universe of discourse X. We consider the triples \(\left\langle \Delta \tilde{T}_{\tilde{A}}(x_i), \Delta \tilde{I}_{\tilde{A}}(x_i), \Delta \tilde{F}_{\tilde{A}}(x_i)\right\rangle\) and \(\left\langle \Delta \tilde{T}_{\tilde{B}}(x_i), \Delta \tilde{I}_{\tilde{B}}(x_i), \Delta \tilde{I}_{\tilde{B}}(x_i)\right\rangle\) as the representations of \(\tilde{A}\) and \(\tilde{B}\) in a three-dimensional vector space, where for all \(x_{i}\in X (i=1,2,\ldots ,n)\):
Then the vector similarity measures between INSs can be defined as follows.
Definition 13
Let \(\tilde{A} = \left\langle \tilde{T}_{\tilde{A}}(x_i), \tilde{I}_{\tilde{A}}(x_i), \tilde{F}_{\tilde{A}}(x_i) \right\rangle\) and \(\tilde{B} = \left\langle \tilde{T}_{\tilde{B}}(x_i), \tilde{I}_{\tilde{B}}(x_i), \tilde{F}_{\tilde{B}}(x_i) \right\rangle\) be two INSs in a universe of discourse \(X =\left\{ x_1,x_2, \ldots ,x_n \right\}\). Then the cosine similarity measure [43] between \(\tilde{A}\) and \(\tilde{B}\) in the vector space is defined as follows:
If \(w_{i}\in [0,1]\) be the weight of each element \(x_{i}\) for \(i=1,2,\ldots ,n\) such that \(\sum _{i=1}^{n}w_{i} =1\), then the weighted cosine similarity measure [43] between \(\tilde{A}\) and \(\tilde{B}\) is defined as follows:
Equation (12) satisfies the following properties:
-
C1.
\(0\le Cos_{w}(\tilde{A}, \tilde{B})\le 1\);
-
C2.
\(Cos_{w}(\tilde{A}, \tilde{B})=Cos_{w}(\tilde{B}, \tilde{A})\);
-
C3.
\(Cos_{w}(\tilde{A}, \tilde{B})=1\) if \(\tilde{A}=\tilde{B}\) i.e., when \(T_{A}^{L}(x_{i}) =T_{\tilde{B}}^{L}(x_{i}),I_{\tilde{A}}^{L}(x_{i}) = I_{\tilde{B}}^{L}(x_{i}),F_{\tilde{A}}^{L}(x_{i}) = F_{\tilde{B}}^{L}(x_{i}), T_{\tilde{A}}^{U}(x_{i}) = T_{\tilde{B}}^{U}(x_{i}), I_{\tilde{A}}^{U}(x_{i}) = I_{\tilde{B}}^{U}(x_{i})\) and \(F_{\tilde{A}}^{U}(x_{i}) = F_{\tilde{B}}^{U}(x_{i})\) for \(i=1,2,\ldots ,n\).
Definition 14
Let \(\tilde{A} = \left\langle \tilde{T}_{\tilde{A}}(x_i), \tilde{I}_{\tilde{A}}(x_i), \tilde{F}_{\tilde{A}}(x_i) \right\rangle\) and \(\tilde{B} = \left\langle \tilde{T}_{\tilde{B}}(x_i), \tilde{I}_{\tilde{B}}(x_i), \tilde{F}_{\tilde{B}}(x_i) \right\rangle\) be two INSs in a universe of discourse \(X =\left\{ x_1,x_2, \ldots ,x_n \right\}\). Then the Dice similarity measure between INSs \(\tilde{A}\) and \(\tilde{B}\) in the vector space is defined as follows:
and if \(w_{i}\in [0,1]\) be the weight of each element \(x_{i}\) for \(i=1,2,\ldots ,n\) such that \(\sum _{i=1}^{n}w_{i} =1\), then the weighted Dice similarity measure between \(\tilde{A}\) and \(\tilde{B}\) is defined as follows:
Proposition 3.1
The Dice similarity measure \(Dic_{w}(\tilde{A}, \tilde{B})\) between \(\tilde{A}\) and \(\tilde{B}\) satisfies the following properties
-
D1.
\(0\le Dic_{w}(\tilde{A}, \tilde{B})\le 1\);
-
D2.
\(Dic_{w}(\tilde{A}, \tilde{B})=Dic_{w}(\tilde{B}, \tilde{A})\);
-
D3.
\(Dic_{w}(\tilde{A}, \tilde{B})=1\) if \(\tilde{A}=\tilde{B}\) i.e., when \(T_{\tilde{A}}^{L}(x_{i}) =T_{\tilde{B}}^{L}(x_{i}),I_{\tilde{A}}^{L}(x_{i}) = I_{\tilde{B}}^{L}(x_{i}), F_{\tilde{A}}^{L}(x_{i}) = F_{\tilde{B}}^{L}(x_{i}), T_{\tilde{A}}^{U}(x_{i}) = T_{\tilde{B}}^{U}(x_{i}), I_{\tilde{A}}^{U}(x_{i}) = I_{\tilde{B}}^{U}(x_{i})\) and \(F_{\tilde{A}}^{U}(x_{i}) = F_{\tilde{B}}^{U}(x_{i})\) for \(i=1,2,\ldots ,n\).
Proof
-
D1.
It is obvious that \(Dic_{w}(\tilde{A}, \tilde{B})\ge 0\) for all real values of \(\Delta \tilde{T}_{\tilde{A}}(x_{i}),\Delta \tilde{I}_{\tilde{A}}(x_{i}),\Delta \tilde{F}_{\tilde{A}}(x_{i}), \Delta \tilde{T}_{\tilde{B}}(x_{i}),\Delta \tilde{I}_{\tilde{B}}(x_{i})\), and \(\Delta \tilde{F}_{\tilde{B}}(x_{i})\) for \(i=1,2,\ldots ,n\). Now consider the expression
$$\begin{aligned}&\left[ \begin{aligned} \Big (\big ( \Delta \tilde{T}_{\tilde{A}}(x_{i})\big )^{2}+ \big (\Delta \tilde{I}_{\tilde{A}}(x_{i})\big ) ^{2} +\big (\Delta \tilde{F}_{\tilde{A}}(x_{i})\big ) ^{2}\Big )\\ +\Big (\big ( \Delta \tilde{T}_{\tilde{B}}(x_{i})\big ) ^{2}+\big (\Delta \tilde{I}_{\tilde{B}}(x_{i})\big )^{2} +\big (\Delta \tilde{F}_{\tilde{B}}(x_{i})\big ) ^{2}\Big ) \end{aligned} \right] -2\left( \begin{aligned} \Delta \tilde{T}_{\tilde{A}}(x_{i}) \Delta \tilde{T}_{\tilde{B}}(x_{i})+ \Delta \tilde{I}_{\tilde{A}}(x_{i}) \Delta \tilde{I}_{\tilde{B}}(x_{i})\\ +\Delta \tilde{F}_{\tilde{A}}(x_{i}) \Delta \tilde{F}_{\tilde{B}}(x_{i}) \end{aligned} \right) \\ &\quad=\big (\Delta \tilde{T}_{\tilde{A}}(x_{i})- \Delta \tilde{T}_{\tilde{B}}(x_{i})\big )^{2}+ \big (\Delta \tilde{I}_{\tilde{A}}(x_{i})- \Delta \tilde{I}_{\tilde{B}}(x_{i})\big )^{2} +\big (\Delta \tilde{F}_{\tilde{A}}(x_{i})- \Delta \tilde{F}_{\tilde{B}}(x_{i})\big )^{2}. \end{aligned}$$(15)It is obviously greater than zero for any real value of \(\Delta \tilde{T}_{\tilde{A}}(x_{i}),\Delta \tilde{I}_{\tilde{A}}(x_{i}),\Delta \tilde{F}_{\tilde{A}}(x_{i}),\Delta \tilde{T}_{\tilde{B}}(x_{i}),\Delta \tilde{I}_{\tilde{B}}(x_{i}),\) and \(\Delta \tilde{F}_{\tilde{A}}(x_{i})\) for \(i=1,2,\ldots ,n\). Therefore, the first property, i.e., the inequality \(0\le Dic_{w}(\tilde{A}, \tilde{B})\le 1\), holds good for all values of \(x_{i}(i=1,2,\ldots ,n)\).
-
D2.
Symmetry of Eq. (14) validates the property D2.
-
D3.
We see that if \(T_{\tilde{A}}^{L}(x_{i}) = T_{\tilde{B}}^{L}(x_{i}),I_{\tilde{A}}^{L}(x_{i}) =I_{\tilde{B}}^{L}(x_{i}),F_{\tilde{A}}^{L}(x_{i}) = F_{\tilde{B}}^{L}(x_{i}), T_{\tilde{A}}^{U}(x_{i}) = T_{\tilde{B}}^{U}(x_{i}), I_{\tilde{A}}^{U}(x_{i}) = I_{\tilde{B}}^{U}(x_{i})\) and \(F_{\tilde{A}}^{U}(x_{i}) = F_{\tilde{B}}^{U}(x_{i})\) for \(i=1,2,\ldots ,n\) then from Eq. (14), we have \(Dic_{w}(\tilde{A}, \tilde{B})=1\) \(\square\).
However, Dice similarity measure between two INSs \(\tilde{A} = \left\langle \tilde{T}_{\tilde{A}}(x_i), \tilde{I}_{\tilde{A}}(x_i), \tilde{F}_{\tilde{A}}(x_i) \right\rangle\) and \(\tilde{ B} = \left\langle \tilde{T}_{\tilde{B}}(x_i), \tilde{I}_{\tilde{B}}(x_i), \tilde{F}_{\tilde{B}}(x_i) \right\rangle\) is undefined for \(\Delta \tilde{T}_{\tilde{A}}=\Delta \tilde{I}_{\tilde{A}}=\Delta \tilde{F}_{\tilde{A}}= \tilde{0}\) and \(\Delta \tilde{T}_{\tilde{B}}=\Delta \tilde{I}_{\tilde{B}}=\Delta \tilde{F}_{\tilde{B}}= \tilde{0}\). Similarly, the cosine similarity is undefined for \(\Delta \tilde{T}_{\tilde{A}}=\Delta \tilde{I}_{\tilde{A}}=\Delta \tilde{F}_{\tilde{A}}= \tilde{0}\) or \(\Delta \tilde{T}_{\tilde{B}}=\Delta \tilde{I}_{\tilde{B}}= \Delta \tilde{F}_{\tilde{B}}= \tilde{0}\). In this case, the similarity measure values \(Dic_{w}(\tilde{A}, \tilde{B})\) and \(Cos_{w}(\tilde{A}, \tilde{B})\) of IVNSs \(\tilde{A}\) and \(\tilde{B}\) are also assumed to be zero.
4 Hybrid vector similarity measures of neutrosophic sets
In the following two subsections, we propose two coefficient parameter-depended vector similarity measures for both SVNSs and INSs.
4.1 Hybrid vector similarity measure of SVNSs
Definition 15
Let \(A =\left\langle {T_A(x_i)},{I_A(x_i)},{F_A(x_i)} \right\rangle\) and \(B =\left\langle {T_B(x_i)},{I_B(x_i)},{F_B(x_i)} \right\rangle\) be two SVNSs in a universe of discourse \(X =\left\{ x_1,x_2, \ldots ,x_n \right\}\), and \(w_{i}\in [0,1]\) be the weight of each element \(x_{i}\) for \(i=1,2,\ldots ,n\) such that \(\sum _{i=1}^{n} w_{i}=1\). Then, the hybrid vector similarity measure (HVSM) of SVNSs in the vector space is defined as follows:
and if \(w_{i}\in [0,1]\) be the weight of each element \(x_{i}\) for \(i=1,2,\ldots ,n\) such that \(\sum _{i=1}^{n}w_{i} =1\), then the weighted hybrid vector similarity measure of SVNSs is defined as follows:
Proposition 4.1
The weighted hybrid vector similarity measure (WHVSM) of SVNSs A and B is denoted by \(Hyb_{w}(A, B)\) and satisfies the following properties:
-
H1.
\(0\le Hyb_{w}(A, B)\le 1\);
-
H2.
\(Hyb_{w}(A, B)=Hyb_{w}(B, A)\);
-
H3.
\(Hyb_{w}(A, B)=1\) if \(A=B\) i.e., when \(T_{A}(x_{i}) = T_{B}(x_{i}), I_{A}(x_{i}) = I_{B}(x_{i})\), and \(F_{A}(x_{i}) = F_{B}(x_{i})\), for \(i=1,2,\ldots ,n\).
Proof
-
H1.
From Dice and cosine similarity measures of SVNSs defined in Eqs. (8) and (10), we have \(0\le Dic_{w}(A, B)\le 1\) and \(0\le Cos_{w}(A, B)\le 1\) for all \(i=1,2,\ldots ,n\). Now from Eq. (17), the HVSM can be written as follows:
$$\begin{aligned} Hyb_{w}(A,B)&= \lambda Dic_{w}(A, B) +(1-\lambda )Cos_{w}(A, B)\\&\le \lambda +(1-\lambda )=1. \end{aligned}$$(18)Because \(Dic_{w}(A, B)\ge 0\) and \(Cos_{w}(A, B)\ge 0\), the HVSM \(Hyb_{w}(A, B)\ge 0\) for any values of \(\lambda \in [0,1]\). This proves the first property of \(Hyb_{w}(A, B)\) i.e., \(0\le Hyb_{w}(A, B)\le 1\).
-
H2.
Symmetry of Eq. (17) validates the property H2.
-
H3.
If \(T_{A}(x_{i}) = T_{B}(x_{i}),I_{A}(x_{i}) = I_{B}(x_{i})\), and \(F_{A}(x_{i}) = F_{B}(x_{i})\), for \(i=1,2,\ldots ,n\), then the value of \(Dic_{w}(A, B)=1\) and \(Cos_{w}(A, B)=1\). Therefore, from Eq. (18), the value of \(Hyb_{w}(A, B)= 1\)
This completes the proof. \(\square\)
Hybrid vector similarity measure value between two SVNSs \(A= \left\langle T_{A}(x_i), I_{A}(x_i), F_{A}(x_i) \right\rangle\) and \(B = \left\langle T_{B}(x_i), I_{B}(x_i), F_{B}(x_i)\right\rangle\) is assumed to be zero for \(A = \left\langle 0, 0, 0\right\rangle\) and \(B = \left\langle 0, 0, 0\right\rangle\).
4.2 Hybrid vector similarity measure of INSs
Definition 16
Let \(\tilde{A} = \left\langle \tilde{T}_{\tilde{A}}(x_i), \tilde{I}_{\tilde{A}}(x_i), \tilde{F}_{\tilde{A}}(x_i) \right\rangle\) and \(\tilde{B} =\left\langle \tilde{T}_{\tilde{B}}(x_i), \tilde{I}_{\tilde{B}}(x_i), \tilde{F}_{\tilde{B}}(x_i) \right\rangle\) be two INSs in a universe of discourse \(X =\left\{ x_1,x_2, \ldots ,x_n \right\}\). Then the hybrid vector similarity measure between \(\tilde{A}\) and \(\tilde{B}\) in the vector space is defined as follows:
where for any \(x_{i}\in X\, (i=1,2,\ldots ,n)\),
If \(w_{i}\in [0,1]\) be the weight of the element \(x_{i}\) for \(i=1,2,\ldots ,n\) such that \(\sum _{i=1}^{n} w_{i}=1\), then, the weighted hybrid vector similarity measure (WHVSM) between \(\tilde{A}\) and \(\tilde{B}\) in the vector space is defined as follows:
Proposition 4.2
The weighted hybrid vector similarity measure of two INSs \(\tilde{A}\) and \(\tilde{B}\) is denoted by \(H_{w}(\tilde{A}, \tilde{B})\) and satisfies the following properties:
-
H1.
\(0\le H_{w}(\tilde{A}, \tilde{B})\le 1\);
-
H2.
\(H_{w}(\tilde{A}, \tilde{B})=H_{w}(\tilde{B}, \tilde{A})\);
-
H3.
\(H_{w}(\tilde{A}, \tilde{B})=1\) if \(\tilde{A}=\tilde{B}\) i.e., when \(T_{\tilde{A}}^{L}(x_{i}) = T_{\tilde{B}}^{L}(x_{i}), I_{\tilde{A}}^{L}(x_{i}) =I_{\tilde{B}}^{L}(x_{i}), F_{\tilde{A}}^{L}(x_{i}) = F_{\tilde{B}}^{L}(x_{i}), T_{\tilde{A}}^{U}(x_{i}) = T_{\tilde{B}}^{U}(x_{i}), I_{\tilde{A}}^{U}(x_{i}) = I_{\tilde{B}}^{U}(x_{i})\) and \(F_{\tilde{A}}^{U}(x_{i})= F_{\tilde{B}}^{U}(x_{i})\) for \(i=1,2,\ldots ,n\).
Proof
-
H1.
Dice and cosine similarity measures of two INSs \(\tilde{A}\) and \(\tilde{B}\) lie in the unit interval, i.e.,
$$\begin{aligned} 0\le Dic_{w}(\tilde{A}, \tilde{B})\le 1; \quad 0\le Cos_{w}(\tilde{A}, \tilde{B})\le 1 \end{aligned}$$for all values of \(x_{i}(i=1,2,\ldots ,n)\). Now, according to Eqs. (14) and (12), the WHVSM of \(\tilde{A}\) and \(\tilde{B}\) can be written as follows:
$$\begin{aligned} H_{w}(\tilde{A}, \tilde{B})&= \lambda Dic_{w}(\tilde{A}, \tilde{B}) +(1-\lambda )Cos_{w}(\tilde{A}, \tilde{B})\\&\le \lambda +(1-\lambda )=1. \end{aligned}$$(21)On the other hand, for all real values of \(\tilde{T}_{\tilde{A}}(x_i), \tilde{I}_{\tilde{A}}(x_i), \tilde{F}_{\tilde{A}}(x_i), \tilde{T}_{\tilde{B}}(x_i), \tilde{I}_{\tilde{B}}(x_i)\) and \(\tilde{F}_{\tilde{B}}(x_i)\), WHVSM \(H_{w}(\tilde{A}, \tilde{B})\ge 0\). Therefore, \(0\le H_{w}(\tilde{A}, \tilde{B})\le 1\).
-
H2.
Symmetry of Eq. (20) validates the property H2.
-
H3.
If \(T_{\tilde{A}}^{L}(x_{i})= T_{\tilde{B}}^{L}(x_{i}), I_{\tilde{A}}^{L}(x_{i})= I_{\tilde{B}}^{L}(x_{i}), F_{\tilde{A}}^{L}(x_{i}) = F_{\tilde{B}}^{L}(x_{i}), T_{\tilde{A}}^{U}(x_{i}) = T_{\tilde{B}}^{U}(x_{i}), I_{\tilde{A}}^{U}(x_{i}) = I_{\tilde{B}}^{U}(x_{i})\) and \(F_{\tilde{A}}^{U}(x_{i}) = F_{\tilde{B}}^{U}(x_{i})\) for \(i=1,2,\ldots ,n\), then the value of \(Dic_{w}(\tilde{A}, \tilde{B})=1\) and \(Cos_{w}(\tilde{A}, \tilde{B})=1\). Therefore, from Eq. (20), the value of \(H_{w}(\tilde{A}, \tilde{B})= 1\)
This completes the proof. \(\square\)
However, for \(\Delta \tilde{T}_{\tilde{A}}=\Delta \tilde{I}_{\tilde{A}}=\Delta \tilde{F}_{\tilde{A}}= \tilde{0}\) and \(\Delta \tilde{T}_{\tilde{B}}=\Delta \tilde{I}_{\tilde{B}}=\Delta \tilde{F}_{\tilde{B}}= \tilde{0}\), the hybrid vector similarity measure between two INSs \(\tilde{A} = \left\langle \tilde{T}_{\tilde{A}}(x_i), \tilde{I}_{\tilde{A}}(x_i), \tilde{F}_{\tilde{A}}(x_i) \right\rangle\) and \(\tilde{ B} = \left\langle \tilde{T}_{\tilde{B}}(x_i), \tilde{I}_{\tilde{B}}(x_i), \tilde{F}_{\tilde{B}}(x_i) \right\rangle\) is undefined and then its value is assumed to be zero.
5 Hybrid vector similarity measure-based multi-attribute decision making under neutrosophic environment
In the following subsection, we apply the weighted hybrid vector similarity measure to multi-attribute decision making under neutrosophic environment.
5.1 Multi-attribute decision making with single-valued neutrosophic information
Consider a MADM problem of m alternatives and n attributes, where all the attribute values are characterized by single-valued neutrosophic sets. Let \(A= \{A_{1},A_{2},\ldots , A_{m} \}\) be a finite set of alternatives, C = \(\{C_{1},C_{2},\ldots , C_{n} \}\) be the set of attributes and \(W = (w_{1},w_{2},\ldots , w_{n} ) ^{T}\) be the weight vector of the attributes \(C_{j}(j=1,2,\ldots ,n)\) such that \(w_{j}\ge 0\) and \(\sum _{j=1}^{n}w_{j}=1\). Let \(D= (d_{ij})_{m\times n}\) be the decision matrix in which the rating values of the alternatives \(A_i(i=1,2,\ldots ,m)\) over the attributes \(C_j(j=1,2,\ldots ,n)\) are presented with the single-valued neutrosophic element of the form \(d_{ij}= \left\langle T_{ij},I_{ij},F_{ij} \right\rangle\). In this decision matrix, \(T_{ij}\) indicates the degree of membership that the alternative \(A_{i}\) satisfies the attribute \(C_{j},I_{ij}\) indicates the degree of indeterminacy for the alternative \(A_{i}\) with respect to attribute \(C_{j}\) and \(F_{ij}\) indicates the degree of non-membership for the alternative \(A_{i}\) with respect to the attribute \(C_{j}\) such that
for \(i=1,2,\ldots , m\) and \(j=1,2,\ldots , n\). Assume that the characteristics of the alternative \(A_{i}(i=1,2,\ldots , m)\) are represented by SVNSs that are shown in the following pattern:
In multi-attribute decision-making environment, the concept of ideal point is used to identify the best alternative properly in the decision set.
Step 1
Determination of the SVNS-based relative positive ideal solution
Definition 17
Let H be the collection of two types of attribute, namely benefit-type attribute (P) and cost-type attribute (L) in the MADM problems. The relative positive ideal neutrosophic solution (RPINS) \(A^{*}= (d_{1}^{*}, d_{2}^{*}, \ldots , d_{n}^{*})\) is the solution of decision matrix \(D= (d_{ij})_{m\times n}\) where every component of has the following form:
Step 2
Calculation of WHVSM between the ideal alternative and each alternative
According to Eq. (17), the WHVSM between the ideal alternative \(A^{*}\) and the alternative \(A_{i}(i= 1, 2, \ldots , m)\) is
where RPINS \(A^{*}\) is determined according to the nature of benefit-type and cost-type attributes defined in Eqs. (23) and (24).
Step 3
Ranking of the alternatives
According to the values obtained from Eq. (25), the ranking order of all the alternatives can be easily determined. Ranking of alternatives is done according to the decreasing order of WHVSM.
5.2 Multi-attribute decision making with interval neutrosophic information
Similar to SVNSs, consider \(D= (\tilde{d}_{ij})_{m\times n}\) be an interval neutrosophic decision matrix, where all the attribute values are represented by INSs \(\tilde{d}_{ij} = \left\langle \tilde{T}_{ij}, \tilde{I}_{ij}, \tilde{F}_{ij} \right\rangle\) for \(i=1,2,\ldots ,m\) and \(j=1,2,\ldots ,n\). Assume that the membership degree \(\tilde{T}_{ij}\) indicates that the alternative \(A_{i}\) satisfies the attribute \(C_{j}, \tilde{I}_{ij}\) indicates the degree of indeterminacy for the alternative \(A_{i}\) with respect to attribute \(C_{j}\), and the membership degree \(\tilde{F}_{ij}\) indicates that the alternative \(A_{i}\) does not satisfy the attribute \(C_{j}\). Assume that \(\tilde{T}_{ij} =\left[ T_{ij}^{L}, T_{ij}^{U}\right] ,\tilde{I}_{ij} = \left[ I_{ij}^{L}, I_{ij}^{U}\right]\), and \(\tilde{F}_{ij} = \left[ F_{ij}^{L}, F_{ij}^{U}\right]\) be the representation of INSs such that
for \(i=1,2,\ldots ,m\) and \(j=1,2,\ldots ,n\). Similar to SVNSs, assume that the characteristic of the alternative \(A_{i}(i=1,2,\ldots , m)\) is presented by INSs shown as:
Step 1
Determination of the INS-based relative positive ideal solution
Definition 18
Let H be the collection of two types of attributes, namely benefit-type attribute (P) and cost-type attribute (L) in the INS-based MADM problems. The relative positive ideal interval-valued neutrosophic solution (RPIINS) \(A^{*} = (\tilde{d}_{1}^{*}, \tilde{d}_{2}^{*}, \ldots , \tilde{d}_{n}^{*})\) is the solution of decision matrix \(D = (\tilde{d}_{ij})_{m\times n}\) where every component has the following form:
-
1.
The RPIINS of the benefit-type attribute \(C_{j}\) is defined by \(\tilde{d}_{j}^{*}= \left\langle \tilde{T}_{j}^{*},\tilde{I}_{j}^{*},\tilde{F}_{j}^{*} \right\rangle\) where
$$\begin{aligned} \left\langle \tilde{T}_{j}^{*},\tilde{I}_{j}^{*},\tilde{F}_{j}^{*} \right\rangle = \big \langle [\max \limits _{i}\{ T_{ij}^{L}\}, \max \limits _{i}\{ T_{ij}^{U}\}], [\min \limits _{i}\{ I_{ij}^{L}\},\quad \min \limits _{i}\{ I_{ij}^{U}\}] ,[\min \limits _{i}\{ F_{ij}^{L}\}, \min \limits _{i}\{ F_{ij}^{U}\}] \big \rangle \,\text {for}\, j\in P. \end{aligned}$$(27) -
2.
The RPIINS of the cost-type attribute \(C_{j}\) is defined by \(\tilde{d}_{j}^{*}=\left\langle \tilde{T}_{j}^{*},\tilde{I}_{j}^{*},\tilde{F}_{j}^{*} \right\rangle\) where
$$\begin{aligned} \left\langle \tilde{T}_{j}^{*},\tilde{I}_{j}^{*},\tilde{F}_{j}^{*} \right\rangle = \big \langle [\min \limits _{i}\{T_{ij}^{L}\}, \min \limits _{i}\{T_{ij}^{U}\}], [\max \limits _{i}\{I_{ij}^{L}\},\quad \max \limits _{i}\{I_{ij}^{U}\}] ,[\max \limits _{i}\{F_{ij}^{L}\}, \max \limits _{i}\{F_{ij}^{U}\}] \big \rangle \,\text {for}\, j\in L. \end{aligned}$$(28)
Step 2
Calculation of WHVSM between the ideal alternative and each alternative
According to Eq. (20), the WHVSM between ideal alternative \(A^{*}\) and alternative \(A_{i}(i= 1, 2, \ldots , m)\) is
where RPIINS \(A^{*}\) is determined according to benefit-type and cost-type attributes defined in Eqs. (27) and (28).
Step 3
Ranking the alternatives
According to the values obtained from Eq. (29), the ranking order of all the alternatives can be easily determined based on the decreasing order of WHVSM.
6 Illustrative examples
In this section, two MADM-related examples in neutrosophic environment are provided to demonstrate the applicability and effectiveness of the proposed approach.
6.1 Example 1
Consider a decision-making problem [11], in which an investment company wants to invest a sum of money in the best option. There is a panel with four possible alternatives to invest the money: (1) \(A_{1}\) is a car company; (2) \(A_{2}\) is a food company; (3) \(A_{3}\) is a computer company; and (4) \(A_{4}\) is an arms company. The investment company must take a decision based on the following three criteria: (1) \(C_{1}\) is the risk analysis; (2) \(C_{2}\) is the growth analysis; and (3) \(C_{3}\) is the environmental impact analysis. The four possible alternatives are to be evaluated under the criteria/attributes by the SVNS assessments provided by the decision maker. These assessment values are provided by the following SVNSs-based decision matrix \(D = (d_{ij})_{4\times 3}\) shown in Table 1.
The known weight information is given as
Step 1
Determination of the type of attribute
The first two attributes, i.e., \(C_{1}\) and \(C_{2}\), are here considered as the benefit-type attribute and \(C_{3}\) is considered as the cost-type attribute.
Step 2
Determination of the relative neutrosophic positive ideal solution
From Eqs. (27) and (28), the relative positive ideal neutrosophic solution for the given matrix \(D = (d_{ij})_{4\times 3}\) shown in Table 1 can be obtained as
Step 3
Determination of the weighted hybrid vector similarity measure
The weighted hybrid vector similarity measure is determined by using Eqs. (25), (30), and (31), and the results obtained for different values of \(\lambda\) are shown in Table 2.
Step 4
Ranking the alternatives
According to the different values of \(\lambda\), the results presented in Table 2 reflect that \(A_{4}\) is the best alternative.
6.2 Example 2
Consider the same decision-making problem described in Example 1. Here, we consider that the evaluations of the alternatives \(A_{i}(i=1,2,3,4)\) over the attributes \(C_{j}(j=1,2,3)\) are expressed in terms of the interval neutrosophic sets. These evaluations are provided in the decision matrix \(D= (\tilde{d}_{ij})_{4\times 3}\) shown in Table 3.
The weight information of the attributes is considered the same as defined in Example 1.
Step 1
Determination of the relative neutrosophic positive ideal solution
Considering \(C_{1}\) and \(C_{2}\) as the benefit-type attributes and \(C_{3}\) as the cost-type attribute, we determine the relative positive ideal neutrosophic solution by Eqs. (27) and (28) as:
Step 2
Determination of the weighted hybrid vector similarity measure
By using Eqs. (29), (30), and (32), we can determine the WHVSM \(H_{w} (A^{*},A_{i})\) between ideal alternative \(A^{*}\) and each alternative for different values of \(\lambda\). Table 4 shows the result.
Step 3
Ranking the alternatives
According to the different values of \(\lambda\), the results presented in Table 4 reflect that \(A_{4}\) is the best alternative.
6.3 Comparison of hybrid vector similarity measure method with other existing methods for MADM
In this section, we compare the results of hybrid vector similarity measure with other existing similarity measures for MADM problem. The comparison results according to Example 1 are presented in Tables 2 and 5.
Similarly, the comparison results for Example 2 are presented in Tables 4, 6, and 7. Table 5 shows that our result for the selection of best alternative agrees with Ye’s vector similarity measure method [42] as well as improved cosine similarity measure method [44] for SVNSs. We see from Table 6 that obtained result from proposed Dice similarity measure is the same as obtained from [42–44] for INSs. Finally, we compare the proposed method with other existing methods [24, 31, 39, 41] and present the results in Table 7. We also observe that the ranking order of the four alternatives for Example 1 and Example 2 is the same as the results given in Table 7.
7 Conclusions
In this paper, we have proposed hybrid vector similarity measures and weighted hybrid vector similarity measures for both single-valued and interval neutrosophic sets and proved some of their basic properties. Then, we have compared the proposed similarity measures with the existing similarity measures for MADM problems. Two numerical examples, one for SVNSs and another for INSs, have been provided to check the validity and effectiveness of the proposed approach in MADM problem. However, we hope that the proposed hybrid vector similarity measures for single-valued as well as interval neutrosophic sets can be used in the field of practical decision making, medical diagnosis, pattern recognition, data mining, clustering analysis, etc.
References
Hwang CL, Yoon K (1981) Multiple attribute decision making: methods and applications. Springer, New York
Zhang X, Liu P (2010) Method for multiple attribute decision making under risk with interval numbers. Int J Fuzzy Syst 12(3):237–242
Chen CT (2000) Extensions of the TOPSIS for group decision making under fuzzy environment. Fuzzy Sets Syst 114:1–9
Ashtiani B, Haghighirad F, Makui A, Montazer GA (2009) Extension of fuzzy TOPSIS method based on interval-valued fuzzy sets. Appl Soft Comput 9:457–461
Boran FE, Genc S, Kurt M, Akay D (2009) A multi-criteria intuitionistic fuzzy group decision making for supplier selection with TOPSIS method. Expert Syst Appl 36(8):11363–11368
Lakshmana GNV, Muralikrishan S, Sivaraman G (2011) Multicriteria decision making method based on interval valued intuitionistic fuzzy sets. Expert Syst Appl 38:1464–1467
Wang JQ, Zhang HY, Ren SC (2013) Grey stochastic multi-criteria decision-making approach based on expected probability degree. Sci Iran 20(3):873–878
Zavadskas EK, Kaklauskas A, Turskis Z, Tamošaitene J (2009) Multi-attribute decision-making model by applying grey numbers. Math Inform 20(2):305320
Smarandache F (1998) A unifying field in logics. Neutrosophy: neutrosophic probability, set and logic. American Research Press, Rehoboth
Smarandache F (2005) Neutrosophic set—a generalization of the intuitionistic fuzzy set. Int J Pure Appl Math 24:287–297
Ye J (2013) Multicriteria decision-making method using the correlation coefficient under single-valued neutrosophic environment. Int J Gen Syst 42(4):386–394
Ye J (2013) Single valued neutrosophic cross entropy for multicriteria decision making problems. Appl Math Model 38:1170–1175
Kharal A (2014) A neutrosophic multi-criteria decision making method. New Math Nat Comput 10(2):143–162
Zhang HY, Wang JQ, Chen XH (2014) Interval neutrosophic sets and their application in multi-criteria decision making problems. Sci World J. doi:10.1155/2014/645953
Wang H, Smarandache F, Zhang YQ, Sunderraman R (2010) Single valued neutrosophic sets. Multispace Multistructure 4:410–413
Wang H, Smarandache F, Zhang YQ, Sunderraman R (2005) Interval neutrosophic sets and logic: theory and applications in computing. Hexis, Phoenix
Ye J (2014) A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. J Intell Fuzzy Syst 26(5):2459–2466
Peng J, Wang J, Wang J, Zhang H, Chen X (2015) Simplified neutrosophic sets and their applications in multi-criteria group decision-making problems. Int J Syst Sci. doi:10.1080/00207721.2014.994050
Liu P, Wang Y (2014) Multiple attribute decision-making method based on single-valued neutrosophic normalized weighted Bonferroni mean. Neural Comput Appl. doi:10.1007/s00521-014-1688-8
Liu P, Chu Y, Li Y, Chen Y (2014) Some generalized neutrosophic number Hamacher aggregation operators and their application to group decision making. Int J Fuzzy Syst 16(2):242–255
Peng J, Wang J, Wang J, Zhang H, Chen X (2015) Multi-valued neutrosophic sets and power aggregation operators with their applications in multi-criteria group decision-making problems. Int J Comput Intell Syst 8(2):345–363
Liu P, Teng F (2015) Multiple attribute decision making method based on normal neutrosophic generalized weighted power averaging operator. Int J Mach Learn Cybern. doi:10.1007/s13042-015-0385-y
Biswas P, Pramanik S, Giri BC (2015) TOPSIS method for multi-attribute group decision-making under single-valued neutrosophic environment. Neural Comput Appl. doi:10.1007/s00521-015-1891-2
Chi P, Liu P (2013) An extended TOPSIS method for the multi-attribute decision making problems on interval neutrosophic set. Neutrosophic Sets Syst 1:63–70
Peng J, Wang J, Zhang H, Chen X (2014) An outranking approach for multi-criteria decision-making problems with simplified neutrosophic sets. Appl Soft Comput 25:336–346
Zhang H, Wang J, Chen X (2015) An outranking approach for multi-criteria decision-making problems with interval-valued neutrosophic sets. Neural Comput Appl. doi:10.1007/s00521-015-1882-3
Biswas P, Pramanik S, Giri BC (2014) Entropy based grey relational analysis method for multi-attribute decision-making under single valued neutrosophic assessments. Neutrosophic Sets Syst 2:102–110
Biswas P, Pramanik S, Giri BC (2014) A new methodology for neutrosophic multi-attribute decision making with unknown weight information. Neutrosophic Sets Syst 3:42–52
Pramanik S, Mondal K (2015) Interval neutrosophic multi-attribute decision making based on grey relational analysis. Neutrosophic Sets Syst 9:13–22
Şahin R, Karabacak M (2014) A multi attribute decision making method based on inclusion measure for interval neutrosophic sets. Int J Eng Appl Sci 2(2):13–15
Şahin R, Küçük A (2014) Subsethood measure for single valued neutrosophic sets. J Intell Fuzzy Syst. doi:10.3233/IFS-141304
Şahin R, Liu P (2015) Maximizing deviation method for neutrosophic multiple attribute decision making with incomplete weight information. Neural Comput Appl. doi:10.1007/s00521-015-1995-8
Xu Z (2007) Some similarity measures of intuitionistic fuzzy sets and their applications to multi attribute decision making. Fuzzy Optim Decis Mak 6:109–121
Guha D, Chakraborty D (2012) A new similarity measure of intuitionistic fuzzy sets and its application to estimate the priority weights from intuitionistic preference relations. Notes Intuitionistic Fuzzy Sets 18(1):37–47
Chiclana F, Tapia García JM, del Moral MJ, Herrera-Viedma E (2013) A statistical comparative study of different similarity measures on consensus in group decision making. Inf Sci 221:110–123
Li Y, Olson DV, Qin Z (2007) Similarity measures between intuitionistic fuzzy (vague) sets: a comparative analysis. Pattern Recognit Lett 28:278–285
Luukka P (2013) Fuzzy similarity in multi-criteria decision making problem applied to supplier evaluation and selection in supply chain management. Adv Artif Intell. doi:10.1155/2011/353509
Majumdar P, Samanta SK (2014) On similarity and entropy of neutrosophic sets. J Intell Fuzzy Syst 26:1245–1252
Ye J (2014) Improved correlation coefficients of single valued neutrosophic sets and interval neutrosophic sets for multiple attribute decision making. J Intell Fuzzy Syst 27:24532462
Broumi S, Smarandache F (2013) Several similarity measures of neutrosophic sets. Neutrosophic Sets Syst 1:54–62
Ye J (2014) Similarity measures between interval neutrosophic sets and their applications in multicriteria decision-making. J Intell Fuzzy Syst 26:165–172
Ye J (2014) Vector similarity measures of simplified neutrosophic sets and their application in multicriteria decision making. Int J Fuzzy Syst 16(2):204–211
Broumi S, Smarandache F (2014) Cosine similarity measures of intervalued neutrosophic sets. Neutrosophic Sets Syst 5:15–20
Ye J (2015) Improved cosine similarity measures of simplified neutrosophic sets for medical diagnoses. Artif Intell Med 63(3):171–179
Xu X, Zhang L, Wan Q (2012) A variation coefficient similarity measure and its application in emergency group decision making. Syst Eng Procedia 5:119–124
Jaccard P (1901) Distribution de la flore alpine dans le bassin desquelques regions voisines. Bull de la Societte Vaudoise des Sciences Naturelles 37(140):241–272
Dice LR (1945) Measures of amount of ecologic association between species. Ecology 26:297–302
Salton G, McGill MJ (1983) Introduction to modern information retrieval. McGraw-Hill, Auckland
Acknowledgments
The authors are very grateful to the anonymous referees for their insightful and constructive comments and suggestions, which have been very helpful in improving the paper.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Pramanik, S., Biswas, P. & Giri, B.C. Hybrid vector similarity measures and their applications to multi-attribute decision making under neutrosophic environment. Neural Comput & Applic 28, 1163–1176 (2017). https://doi.org/10.1007/s00521-015-2125-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-015-2125-3