Abstract
A single-valued neutrosophic multi-set is characterized by a sequence of truth membership degrees, a sequence of indeterminacy membership degrees and a sequence of falsity membership degrees. Nature of a single-valued neutrosophic multi-set allows us to consider multiple information in the truth, indeterminacy and falsity memberships which is pretty useful in multi-criteria group decision making. In this paper, we consider sequences of intuitionistic fuzzy values instead of numbers to define the concept of intuitionistic fuzzy-valued neutrosophic multi-set. In this manner, such a set gives more powerful information. We also present some set theoretic operations and a partial order for intuitionistic fuzzy-valued neutrosophic sets and provide some algebraic operations between intuitionistic fuzzy-valued neutrosophic values. Then, we develop two types of weighted aggregation operators with the help of intuitionistic fuzzy t-norms and t-conorms. By considering some well-known additive generators of ordinary t-norms, we give the Algebraic weighted arithmetic and geometric aggregation operators and the Einstein weighted arithmetic and geometric aggregation operators that are the particular cases of the weighted aggregation operators defined via general t-norms and t-conorms. We also define a simplified neutrosophic valued similarity measure and we use a score function for simplified neutrosophic values to rank similarities of intuitionistic fuzzy-valued neutrosophic multi-values. Finally, we give an algorithm to solve classification problems using intuitionistic fuzzy-valued neutrosophic multi-values and proposed aggregation operators and we apply the theoretical part of the paper to a real classification problem.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Introduction
Fuzzy sets (FSs) [1] are characterized by membership functions and a fuzzy set is a successful tool to handle uncertainties arising from partial belongingness of an element to a set. Atanassov [2] extended the concept of fuzzy set to the concept of intuitionistic fuzzy set (IFS) via a membership function \( \mu _{A} \) and a non-membership function \( \nu _{A} \) such that \(0\le \mu _{A}(x)+\nu _{A}(x) \le 1 \) for each \( x\in X \). For a fixed \(x \in X \), the pair \( ( \mu _{A}(x),\nu _{A}(x) ) \) is called an intuitionistic fuzzy value (IFV) or an intuitionistic fuzzy number [3]. Moreover, Atanassov [2] described the hesitant function of an IFS that is given by \(\pi _{A}(x)=1-\mu _{A}(x)-\nu _{A}(x) \). This function indicates exactly the level of indecision of a decision maker and it is not included in the classical intuitionistic fuzzy set notion. Theory of IFS has been extensively studied by many authors and it has been applied to vary fields such as decision making, image fusion and segmentation systems, classification and clustering (see e.g., [4,5,6,7,8,9]). Recently, many methods and approaches also have been developed to solve the problems in many areas. For example, Krawczak and Szkatula [10] have studied on IFSs’s perturbation and they have applied this concept to classification problems. He et al. [11] have proposed some distance measures between IFSs via dissimilarity function and have given a pattern recognition application. Kumar [12] have formulated the crisp, fuzzy and intuitionistic fuzzy optimization problems. Lohani et al. [13] have carried out experimental study of intuitionistic fuzzy c-mean algorithm over machine learning dataset.
Smarandache [14] has proposed the concept of neutrosophic set (NS) from a philosophical point of view as a generalization of the concept of FS and IFS. A NS is characterized by a truth membership function, an indeterminacy membership function and a falsity membership function and each membership degree is a real standard or a non-standard subset of the non-standard unit interval \( ]^{-}0,1^{+}[ \). Unlike IFSs, there is no restriction on the membership functions in a NS, and the degree of hesitancy is included in the NS. Nonetheless, NSs are hard to apply in practical problems since the values of the truth, indeterminacy and falsity membership functions lie in \( ]^{-}0,1^{+}[ \). Therefore, this concept has been extended to various NSs whose truth, falsity and indeterminacy membership functions take only one value from the closed interval [0, 1] such as single-valued neutrosophic sets (SVNSs) [15], simplified neutrosophic sets (SNSs) [16], neutrosophic soft sets (NSSs) [17] and they have been applied to various multi-criteria decision making problems. However, decision makers get hard to determine the truth, indeterminacy and falsity membership degree of an element to a set in some real-life situation and so they give rise of giving a few different values due to doubt such as fuzzy multi-sets (FMs) and intuitionistic fuzzy multi-sets (IFMSs) (see e.g., [18,19,20]). In such a situation, it may be useful to use the concept of single-valued neutrosophic multi-set (SVNMS) which was proposed by Ye and Ye [21] in 2014. A SVNMS is characterized by sequences of truth, indeterminacy and falsity membership degrees coming from [0, 1] .
The process of combining several numerical values into a single representative one is called aggregation, and a numerical function performing this process is called an aggregation operator. This concept has various application areas such as artificial intelligence, operations research, economics and finance, pattern recognition and image processing, data fusion, multi-criteria decision making, classification and clustering, automated reasoning, etc. (see, e.g., [35]). The concepts of t-norm and t-conorm are often used to define algebraic operations and aggregation operators for fuzzy sets. Most researchers have identified various aggregation operators for an IFS and its generalizations using several types of \(t-\)norm and \(t-\) conorm. For example, Beliakov et al. [22] constructed some operations for IFSs based on Archimedean t-norm and t-conorm, from which an aggregation principle is proposed for intuitionistic fuzzy information. Liu et al. [23] proposed Heronian aggregation operators of IFVs based on the Archimedean \(t-\)norm and \(t-\)conorm and Liu and You [24] developed Heronian mean operators based on Einstein \(t-\)norm and \(t-\)conorm for linguistic IFSs. Garg and Rani [25] have proposed Bonferroni mean aggregation operators based on Archimedean \(t-\)norm and \(t-\)conorm for complex intuitionistic fuzzy information and Garg and Arora [26] introduced Maclaurin symmetric mean aggregation operator based on Archimedean \(t-\)norm for intuitionistic fuzzy soft sets.
Classification is a pattern identification method in the field of data science and statistics. This method is used for rearranging the data into predefined classes according to the some specific algorithms. These algorithms have been commonly used in machine learning as a supervised rule learning method. On the other hand, cluster analysis is an unsupervised learning method which is used for classification without labeled responses. Once data have been classified or clustered, the correct output can be checked using some statistical features like accuracy. There are plenty of classification and clustering algorithms in machine learning studies. These algorithms are commonly based on some statistical features or analysis. The concept is preferred by researchers in various fields such as pattern recognition, information retrieval, microbiology analysis, data mining, etc. In the meantime, recently many researchers have been using fuzzy methods as well as fuzzy set theory in classification analysis (see, e.g., [36,37,38]) and clustering analysis (see, e.g., [39, 40]).
In this paper, we expand the idea of SVNMS to the concepts of intuitionistic fuzzy-valued neutrosophic multi-set (IFVNMS) and intuitionistic fuzzy-valued neutrosophic multi-value (IFVNMV), which combine NS theory with IFS theory with the help of IFVs instead of numbers in membership sequences. Actually, an IFVNMS lets us model membership and non-membership degrees of an element to truth, indeterminacy and falsity sequences in the neutrosophic environment. Therefore, more detailed information can be carried when transforming the data to fuzzy information and so decision makers can assign less strict fuzzy values. Thus, an IFVNMS or IFVNMV prevents the loss of the information and relaxes the decision process. We also present some set theoretic operations and a partial order for IFVNMSs. Then, we give some fundamental algebraic operations with the help of intuitionistic fuzzy t-norms and t-conorms and we provide some weighted arithmetic and geometric aggregation operators for IFVNMVs. A comparison of aggregation operators from the literature and those of the present study is provided in Table 1 and the advantages of the concept of IFVNMS is emphasized in Table 2. Next, we aim to solve a real classification problem with the help of the proposed aggregation operators. For this purpose, we first define a simplified neutrosophic valued cosine similarity measure between IFVNMVs and we rank similarity results via a score function for SNVs. As an example, we consider a real-life example and construct a new classification method based on IFVNMVs, the proposed aggregation operators and the cosine similarity measure for an applied classification problem.
Preliminaries
The concepts of triangular norm (t-norm) and triangular conorm (t-conorm) have a significant importance in the definition of algebraic operations and aggregation operators for fuzzy sets. A t-norm and a t-conorm are functions that map pairs of numbers from [0, 1] to [0, 1]. Deschrijver et al. [41] extended the notions of t-norm and t-conorm to the intuitionistic fuzzy case by defining these functions from the domain of \(I^{*} \times I^{*}\) to \(I^{*}\) where \(I^{*}:=\left\{ \left( x_{1},x_{2}\right) :x_{1},x_{2}\in [0,1]\text { and }x_{1}+x_{2}\le 1\right\} \). Before recalling these concepts, we recall a partial order for IFVs.
Let \(x=(x_{1},x_{2})\) and \(y=(y_{1},y_{2})\) be two IFVs. According to the partial order introduced by Atanassov [2] \(x\le _{(int)}y\) if and only if \(x_{1}\le y_{1}\) and \(x_{2}\ge y_{2}\).
A function \(\mathcal {T}:I^{*}\times I^{*}\rightarrow I^{*}\) is called an intuitionistic fuzzy t-norm if
-
(1)
For any \(x\in I^{*}\), \(\mathcal {T}(x,(1,0))=x\) (border condition),
-
(2)
For any \(x,y\in I^{*}\), \(\mathcal {T}(x,y)=\mathcal {T}(y,x)\) (commutativity),
-
(3)
For any \(x,y,z\in I^{*}\), \(\mathcal {T}(x,\mathcal {T} (y,z))=\mathcal {T}(y,\mathcal {T}(x,z))\) (associativity),
-
(4)
For any \(x=(x_{1},x_{2}),x^{\prime }=(x_{1}^{\prime },x_{2}^{\prime }),y=(y_{1},y_{2}),y^{\prime }=(y_{1}^{\prime },y_{2}^{\prime })\in I^{*}\), \(\mathcal {T}(x,y)\le _{(int)}\mathcal {T}(x^{\prime },y^{\prime })\) whenever \((x_{1},x_{2})\le _{(int)}(x_{1}^{\prime },x_{2}^{\prime })\) and \((y_{1} ,y_{2})\le _{(int)}(y_{1}^{\prime },y_{2}^{\prime })\) (monotonicity) [41].
A function \(\mathcal {S}:I^{*} \times I^{*}\rightarrow I^{*}\) is called an intuitionistic fuzzy t-conorm if
-
(1)
For any \(x\in I^{*}\), \(\mathcal {S}(x,(0,1))=x\) (border condition),
-
(2)
For any \(x,y\in I^{*}\), \(\mathcal {S}(x,y)=\mathcal {S}(y,x)\) (commutativity),
-
(3)
For any \(x,y,z\in I^{*}\), \(\mathcal {S}(x,\mathcal {S} (y,z))=\mathcal {S}(y,\mathcal {S}(x,z))\) (associativity),
-
(4)
For any \(x=(x_{1},x_{2}),x^{\prime }=(x_{1}^{\prime },x_{2}^{\prime }),y=(y_{1},y_{2}),y^{\prime }=(y_{1}^{\prime },y_{2}^{\prime })\in I^{*}\), \(\mathcal {S}(x,y)\le _{(int)}\mathcal {S}(x^{\prime },y^{\prime })\) whenever \((x_{1},x_{2})\le _{(int)}(x_{1}^{\prime },x_{2}^{\prime })\) and \((y_{1} ,y_{2})\le _{(int)}(y_{1}^{\prime },y_{2}^{\prime })\) (monotonicity) [41].
Definitions of t-norm and t-conorm in the ordinary sense can be found in [42, 43].
A function \(\mathcal {N}:I^{*}\rightarrow I^{*}\) is called a fuzzy negator if
-
(1)
For any \(x=(x_{1},x_{2}),y=(y_{1},y_{2})\in I^{*}\), \(\mathcal {N} (x)\le _{(int)}\mathcal {N}(y)\) whenever \(x\ge _{(int)}y\), i.e., \(\mathcal {N}\) is decreasing,
-
(2)
\(\mathcal {N}((0,1))=(1,0)\) and \(\mathcal {N}((1,0))=(0,1)\) [41].
Remark 1
-
(i)
The mapping \(\mathcal {N}_{s}\) defined by \(\mathcal {N}_{s}((x_{1},x_{2}))=(x_{2},x_{1})\) is a fuzzy negator and it is called the standard negator (see e.g., [41]).
-
(ii)
Let \(\mathcal {T}\) be an intuitionistic fuzzy t-norm and let \(\mathcal {N}\) be a fuzzy negator. Then, the function \(\mathcal {T}^{*}:I^{*}\times I^{*}\rightarrow I^{*}\) defined by \(\mathcal {T}^{*}(x,y)=\mathcal {N}\left( \mathcal {T}\left( \mathcal {N} \left( x\right) ,\mathcal {N}(y\mathcal {)}\right) \right) \) is a t-conorm which is called the dual intuitionistic fuzzy t-conorm of \(\mathcal {T}\) with respect to \(\mathcal {N}\) [41].
-
(iii)
Let T be a t-norm and let S be a t-conorm in the ordinary sense. If
$$\begin{aligned} T(a,b)\le 1-S(1-a,1-b)\text { for any }a,b\in [0,1], \end{aligned}$$(2.1)then the mapping \(\mathcal {T}:I^{*}\times I^{*}\rightarrow I^{*}\) defined by \(\mathcal {T}(x,y)=\left( T(x_{1},y_{1}),S(x_{2},y_{2})\right) \) is an intuitionistic fuzzy t-norm and the mapping \(\mathcal {T}^{*}:I^{*}\times I^{*}\rightarrow I^{*}\) defined by \(\mathcal {T}^{*}(x,y)=\left( S(x_{1},y_{1 }),T(x_{2},y_{2})\right) \) is the dual intuitionistic fuzzy t-conorm of \(\mathcal {T}\) with respect to \(\mathcal {N}_{s}\) [41].
Remark 2
Additive generators of t-norms and t-conorms of ordinary sense play an important role while defining the algebraic operators. Now, we generate an intuitionistic fuzzy t-norm and an intuitionistic fuzzy t-conorm using generators in the ordinary sense. Let \(g:[0,1]\rightarrow \left[ 0,\infty \right] \) be the additive generator of a t-norm T and let S be the dual t-conorm of T. In this case, we know that \(h(t)=g(1-t)\) (see, e.g., [44]). Then, (2.1) is satisfied. Thus, using (iii) of Remark 1 we obtain an intuitionistic fuzzy t-norm \(\mathcal {T}\) defined by
and its dual t-conorm
with respect to \(\mathcal {N}_{s}\). In this case, we say that \(\mathcal {T}\) is the intuitionistic fuzzy t-norm generated by g.
Example 1
Let \(g,h:[0,1]\rightarrow [0,\infty ]\) defined by \(g(t)=-\log t\) and \(h(t)=-\log (1-t)\). Then, we obtain the algebraic intuitionistic fuzzy t-norm
given in [41] (see pg.48) and its dual intuitionistic fuzzy dual t-conorm
Let \(\alpha ,\beta \in [0,1]\) such that \(\alpha + \beta \le 1\). Then, the pair \( ( \alpha ,\beta ) \) is called an IFV [2]. Now, we are ready to introduce the concepts of IFVNMS and IFVNMV.
Definition 1
Let \(X=\left\{ x_{1},...,x_{n} \right\} \) be a finite set. An IFVNMS defined on X is given with
where \((\mathbb {T}_{A}^{i,j})_{j=1}^{p_{i}}\), \((\mathbb {I}_{A} ^{i,j})_{j=1}^{p_{i}}\) and \((\mathbb {F}_{A}^{i,j})_{j=1}^{p_{i}}\) are the truth, the indeterminacy and the falsity membership sequences of IFVs, respectively, i.e., \(i=1,...,n\), \(j=1,...,p_{i}\)
and
For a fixed \(i=1,...,n\) the expression
denotes an IFVNMV.
Example 2
Let \(X=\left\{ x_{1},x_{2}\right\} \). The following is an IFVNMS:
Now, we introduce some set theoretic operations among IFVNMSs. Throughout this manuscript “\(\subset _{(int)},\cap _{(int)} ,\cup _{(int)},\left( \cdot \right) ^{c_{(int)}}\)”denote the set operations for IFSs [2].
Definition 2
Let \(X=\left\{ x_{1},...,x_{n}\right\} \) be a finite set and let A and B be two IFVNMSs in X. Some set operations among IFVNMSs can be defined as follows:
-
a)
\(A\subset B\) if and only if
-
(i)
\(\mathbb {T}_{A}^{i,j}\subset _{(int)}\mathbb {T}_{B}^{i,j}\) i.e., \(T_{A}^{j,t_{i}}\le T_{B}^{j,t_{i}}\) and \(T_{A}^{j,f_{i}}\ge T_{B}^{j,f_{i} }\)
-
(ii)
\(\mathbb {I}_{A}^{i,j}\) \(\supset _{(int)} \mathbb {I}_{B}^{i,j}\) i.e., \(I_{A}^{j,t_{i}}\ge I_{B}^{j,t_{i}}\) and \(I_{A}^{j,f_{i}}\le I_{B}^{j,f_{i} }\)
-
(iii)
\(\mathbb {F}_{A}^{i,j}\) \(\supset _{(int)} \mathbb {F}_{B}^{i,j}\) i.e., \(F_{A}^{j,t_{i}}\ge F_{B}^{j,t_{i}}\) and \(F_{A}^{j,f_{i}}\le F_{B}^{j,f_{i} }\)
for \(j=1,2,...p_{i} \) and \(i=1,2,...,n\).
-
(i)
-
(b)
\(A=B\) if and only if \(A\subset B\) and \(A\supset B\).
-
(c)
\(A^{c}=\left\{ \left\langle x_{i},\left( (\mathbb {F}_{A}^{i,j} )_{j=1}^{p_{i}}, ([ \mathbb {I}_{A}^{i,j}] ^{c_{(int)}})_{j=1}^{p_{i} },(\mathbb {T}_{A}^{i,j})_{j=1}^{p_{i}}\right) \right\rangle : i=1,2,...n\right\} \)
-
(d)
\(A\cup B=\left\{ \left\langle x_{i},\left( (\mathbb {T}_{A}^{i,j}\cup _{(int)}\mathbb {T}_{B}^{i,j})_{j=1}^{p_{i} },(\mathbb {I}_{A}^{i,j}\cap _{(int)}\mathbb {I}_{B}^{i,j})_{j=1}^{p_{i} },(\mathbb {F}_{A}^{i,j}\cap _{(int)}\mathbb {F}_{B}^{i,j})_{j=1}^{p_{i}}\right) \right\rangle :i=1,2,...n\right\} \) where
$$\begin{aligned} (\mathbb {T}_{A}^{i,j}\cup _{(int)}\mathbb {T}_{B}^{i,j})_{j=1}^{p_{i} }= & {} (\displaystyle \max _{j}(T_{A}^{j,t_{i}},T_{B}^{j,t_{i}}),&\displaystyle \min _{j}(T_{A}^{j,f_{i}},T_{B}^{j,f_{i}}))_{j}^{p_{i}}, \end{aligned}$$$$\begin{aligned} (\mathbb {I}_{A}^{i,j}\cap _{(int)}\mathbb {I}_{B}^{i,j})_{j=1}^{p_{i} }= & {} (\displaystyle \min _{j}(I_{A}^{j,t_{i}},I_{B}^{j,t_{i}}),\displaystyle&\max _{j}(I_{A}^{j,f_{i}},I_{B}^{j,f_{i}}))_{j}^{p_{i}}, \end{aligned}$$and
$$\begin{aligned} (\mathbb {F}_{A}^{i,j}\cap _{(int)}\mathbb {F}_{B}^{i,j})_{j=1}^{p_{i} }= & {} (\displaystyle \min _{j}(F_{A}^{j,t_{i}},F_{B}^{j,t_{i}}),\displaystyle&\max _{j}(F_{A}^{j,f_{i}},F_{B}^{j,f_{i}}))_{j}^{p_{i}}. \end{aligned}$$ -
(e)
\(A\cap B{=}\left\{ \left\langle x_{i},\left( (\mathbb {T}_{A}^{i,j}\cap _{(int)}\mathbb {T}_{B}^{i,j})_{j=1}^{p_{i} },(\mathbb {I}_{A}^{i,j}\cup _{(int)}\mathbb {I}_{B}^{i,j})_{j=1}^{p_{i} },(\mathbb {F}_{A}^{i,j}\cup _{(int)}\mathbb {F}_{B}^{i,j})_{j=1}^{p_{i}}\right) \right\rangle :i=1,2,...n\right\} \) where
$$\begin{aligned} (\mathbb {T}_{A}^{i,j}\cap _{(int)}\mathbb {T}_{B}^{i,j})_{j=1}^{p_{i} }= & {} (\displaystyle \min _{j}(T_{A}^{j,t_{i}},T_{B}^{j,t_{i}}),\\&\max _{j}(T_{A}^{j,f_{i}},T_{B}^{j,f_{i}}))_{j}^{p_{i}},\\ (\mathbb {I}_{A}^{i,j}\cup _{(int)}\mathbb {I}_{B}^{i,j})_{j=1}^{p_{i} }= & {} (\displaystyle \max _{j}(I_{A}^{j,t_{i}},I_{B}^{j,t_{i}}),\\&\min _{j}(I_{A}^{j,f_{i}},I_{B}^{j,f_{i}}))_{j}^{p_{i}}, \end{aligned}$$and
$$\begin{aligned} (\mathbb {F}_{A}^{i,j}\cup _{(int)}\mathbb {F}_{B}^{i,j})_{j=1}^{p_{i} }= & {} (\displaystyle \max _{j}(F_{A}^{j,t_{i}},F_{B}^{j,t_{i}}),\\&\min _{j}(F_{A}^{j,f_{i}},F_{B}^{j,f_{i}}))_{j}^{p_{i}}. \end{aligned}$$
Example 3
Let \(X=\left\{ x_{1},x_{2}\right\} \) and let A and B be two IFVNMSs given with:
and
then \(A\subset B\). On the other hand, it is easy to check that
and
The following shows that De Morgan’s rules are valid for set operations defined in Definition 2.
Theorem 1
Let \(X=\left\{ x_{1},...,x_{n}\right\} \) be a finite set and let
and
be two IFVNMSs in X. The following De Morgan’s rules are satisfied:
-
(1)
\(\left( A\cup B\right) ^{c}=A^{c}\cap B^{c}\),
-
(2)
\(\left( A\cap B\right) ^{c}=A^{c}\cup B^{c}\).
Proof
We obtain
and
which finish the proof. \(\square \)
Now we define a partial order over the set of all IFVNMSs on a given set X using“\(\le _{(int)}\)”.
Proposition 1
The relation defined on the set of all IFVNMSs on a set X by \(\alpha \preceq \beta \) if and only if \(\mathbb {T}_{\alpha }^{j}\le _{(int)}\mathbb {T}_{\beta }^{j}\), \(\mathbb {I}_{\alpha }^{j}\ge _{(int)} \mathbb {I}_{\beta }^{j}\) and \(\mathbb {F}_{\alpha }^{j}\ge _{(int)} \mathbb {F}_{\beta }^{j}\) for any \(j=1,...,p\) where \(\alpha ={\left\langle (\mathbb {T}_{\alpha }^{j})_{j=1}^{p},(\mathbb {I} _{\alpha }^{j})_{j=1}^{p},(\mathbb {F}_{\alpha }^{j})_{j=1}^{p}\right\rangle }\) and is a partial order.
Proof
Reflexivity and antisymmetry are trivial. To prove transitivity let \(\alpha \preceq \beta \) and \(\beta \preceq \gamma \) where \(\gamma = \left\langle (\mathbb {T}_{\gamma }^{j})_{j=1}^{p},(\mathbb {I} _{\gamma }^{j})_{j=1}^{p},(\mathbb {F}_{\gamma }^{j})_{j=1}^{p}\right\rangle \). Therefore, for any \(j=1,...,p\), we have
and
Since,“\(\le _{(int)}\)” is a partial order we have from (2.6) and (2.7)
which yields that \(\alpha \preceq \gamma \). \(\square \)
Note that
and
are the minimal and the maximal elements of the IFVNMVs with respect to“\(\preceq \)”.
Algebraic operations for IFVNMVs
In this section, using intuitionistic fuzzy t-norms and intuitionistic fuzzy t-conorms, we define some algebraic operations for IFVNMVs.
Definition 3
Let \(\alpha =\) \(\left\langle (\mathbb {T}_{\alpha }^{j})_{j=1} ^{p},(\mathbb {I}_{\alpha }^{j})_{j=1}^{p},(\mathbb {F}_{\alpha }^{j})_{j=1} ^{p}\right\rangle \) and \(\beta =\) \(\left\langle (\mathbb {T} _{\beta }^{j})_{j=1}^{p},(\mathbb {I}_{\beta }^{j})_{j=1}^{p},(\mathbb {F}_{\beta }^{j})_{j=1}^{p}\right\rangle \) be two IFVNMVs with same sequence lengths \(p\in \mathbb {Z}^{+}\), let \(\mathcal {T}\) be an intuitionistic t-norm and let \(\mathcal {N}\) be a fuzzy negator. Then,
-
(i)
\(\alpha \oplus \beta :=\left\langle \left( \mathcal {T}^{*}\left( \mathbb {T}_{\alpha } ^{j},\mathbb {T}_{\beta }^{j}\right) \right) _{j=1}^{p},\left( \mathcal {T} \left( \mathbb {I}_{\alpha }^{j},\mathbb {I}_{\beta }^{j}\right) \right) _{j=1}^{p}, \left( \mathcal {T}\left( \mathbb {F}_{\alpha }^{j},\mathbb {F} _{\beta }^{j}\right) \right) _{j=1}^{p}\right\rangle \),
-
(ii)
\(\alpha \otimes \beta :=\left\langle \left( \mathcal {T}\left( \mathbb {T} _{\alpha }^{j},\mathbb {T}_{\beta }^{j}\right) \right) _{j=1}^{p},\left( \mathcal {T}^{*}\left( \mathbb {I}_{\alpha }^{j},\mathbb {I}_{\beta } ^{j}\right) \right) _{j=1}^{p},\left( \mathcal {T}^{*}\left( \mathbb {F}_{\alpha }^{j},\mathbb {F}_{\beta }^{j}\right) \right) _{j=1} ^{p}\right\rangle \)
where \(\mathcal {T}^{*}\) is the dual intuitionistic fuzzy t-conorm of \(\mathcal {T}\) with respect to \(\mathcal {N}\).
The following proposition confirms that the sum and the product of two IFVNMVs are also IFVNMVs.
Proposition 2
Let \(\alpha \) and \(\beta \) be two IFVNMVs, let \(\mathcal {T}\) be an intuitionistic t-norm and let \(\mathcal {T}^*\) be the dual intuitionistic t-conorm of \(\mathcal {T}\) with respect to a fuzzy negator. Then, \(\alpha \oplus \beta \) and \(\alpha \otimes \beta \) are IFVNMVs.
Proof
Since \(\mathcal {T}\) and \(\mathcal {T}^{*}\) have range \(I^{*}\) the proof is trivial. \(\square \)
Now, we define multiplication by a positive constant and a positive power of IFVNMVs using additive generators of ordinary t-norms.
Definition 4
Let \(\alpha =\) \(\left\langle (\mathbb {T}_{\alpha }^{j})_{j=1} ^{p},(\mathbb {I}_{\alpha }^{j})_{j=1}^{p},(\mathbb {F}_{\alpha }^{j})_{j=1} ^{p}\right\rangle \) be an IFVNMV with sequence length \(p\in \mathbb {Z}^{+}\) and let g be the additive generator of a t-norm and let \(h(t) = g(1-t)\). Then,
-
i)
For \(\lambda >0\), \(\lambda \alpha =\left\{ \left\langle (\mathbb {T}_{\lambda \alpha }^{j})_{j=1}^{p},(\mathbb {I}_{\lambda \alpha } ^{j})_{j=1}^{p},(\mathbb {F}_{\lambda \alpha }^{i,j})_{j=1}^{p}\right\rangle :i=1,2,...n\right\} \) where \(\mathbb {T}_{\lambda \alpha }^{j}=(T_{\lambda \alpha }^{j,t},T_{\lambda \alpha }^{j,f}),\mathbb {I}_{\lambda \alpha } ^{j}=(I_{\lambda \alpha }^{j,t},I_{\lambda \alpha }^{j,f})\), \(\mathbb {F} _{\lambda \alpha }^{j}=(F_{\lambda \alpha }^{j,t},F_{\lambda \alpha }^{j,f})\) and
$$\begin{aligned} T_{\lambda \alpha }^{j,t}&:=h^{-1}\left( \lambda h\left( T_{\alpha } ^{j,t}\right) \right) \\ T_{\lambda \alpha }^{j,f}&:=g^{-1}\left( \lambda g\left( T_{\alpha } ^{j,f}\right) \right) \\ I_{\lambda \alpha }^{j,t}&:=g^{-1}\left( \lambda g\left( I_{\alpha } ^{j,t}\right) \right) \\ I_{\lambda \alpha }^{j,f}&:=h^{-1}\left( \lambda h\left( I_{\alpha } ^{j,f}\right) \right) \end{aligned}$$and
$$\begin{aligned} F_{\lambda \alpha }^{j,t}&:=g^{-1}\left( \lambda g\left( F_{\alpha } ^{j,t}\right) \right) \\ F_{\lambda \alpha }^{j,f}&:=h^{-1}\left( \lambda h\left( F_{\alpha } ^{j,f}\right) \right) \end{aligned}$$for any \(j=1,...,p\).
-
(ii)
For \(\lambda >0\), \(\alpha ^{\lambda }:=\left\{ \left\langle (\mathbb {T}_{\alpha ^{\lambda }}^{j})_{j=1} ^{p},(\mathbb {I}_{\alpha ^{\lambda }}^{j})_{j=1}^{p},(\mathbb {F}_{\alpha ^{\lambda }}^{i,j})_{j=1}^{p}\right\rangle :i=1,2,...n\right\} \) where \(\mathbb {T}_{\alpha ^{\lambda }}^{j}:=(T_{\alpha ^{\lambda }}^{j,t},T_{\alpha ^{\lambda }}^{j,f})\), \(\mathbb {I}_{\alpha ^{\lambda }}^{j}:=(I_{\alpha ^{\lambda } }^{j,t},I_{\alpha ^{\lambda }}^{j,f})\), \(\mathbb {F}_{\alpha ^{\lambda }} ^{j}:=(F_{\alpha ^{\lambda }}^{j,t},F_{\alpha ^{\lambda }}^{j,f})\) and
$$\begin{aligned} T_{\alpha ^{\lambda }}^{j,t}&:=g^{-1}\left( \lambda g\left( T_{\alpha }^{j,t}\right) \right) \\ T_{\alpha ^{\lambda }}^{j,f}&:=h^{-1}\left( \lambda h\left( T_{\alpha }^{j,f}\right) \right) \\ I_{\alpha ^{\lambda }}^{j,t}&:=h^{-1}\left( \lambda h\left( I_{\alpha }^{j,t}\right) \right) \\ I_{\alpha ^{\lambda }}^{j,f}&:=g^{-1}\left( \lambda g\left( I_{\alpha }^{j,f}\right) \right) \end{aligned}$$and
$$\begin{aligned} F_{\alpha ^{\lambda }}^{j,t}&:=h^{-1}\left( \lambda h\left( F_{\alpha }^{j,t}\right) \right) \\ F_{\alpha ^{\lambda }}^{j,f}&:=g^{-1}\left( \lambda g\left( F_{\alpha }^{j,f}\right) \right) \end{aligned}$$for any \(j=1,...,p\).
The following theorem validates that \(\lambda \alpha \) and \(\alpha ^{\lambda }\) are also an IFVNMVs.
Theorem 2
Let \(\alpha \) and \(\beta \) be two IFVNMVs and \(\lambda >0\). Then, \(\lambda \alpha \) and \(\alpha ^{\lambda }\) are IFVNMVs on X.
Proof
We prove that \(\lambda \alpha \) is an IFVNMV. Since \(T_{\alpha }^{j,t} \le 1-T_{\alpha }^{j,f}\) and \(h,h^{-1}\) are increasing we obtain for any \(j=1,...,p\) that
which proves that \(\mathbb {T}_{\lambda \alpha }^{j}\) is an IFV. Similarly, we can prove that \(\mathbb {I}_{\lambda \alpha }^{j},\mathbb {F}_{\lambda \alpha } ^{j},\mathbb {T}_{\alpha ^{\lambda }}^{j},\mathbb {I}_{\alpha ^{\lambda }}^{j}\) and \(\mathbb {F}_{\alpha ^{\lambda }}^{j}\) are IFVs. \(\square \)
Some properties of the operational laws are given in the following theorem.
Theorem 3
Let \(\alpha \), \(\beta \) and \(\nu \) be IFVNMVs on X. Assume that t-norm T, t-conorm S and intuitionistic fuzzy t-norm \(\mathcal {T}\) are generated by an algebraic generator g and let \(h(t)=g(1-t)\). Then,
-
(i)
\(\alpha \oplus \beta =\beta \oplus \alpha \),
-
(ii)
\(\alpha \otimes \beta =\beta \otimes \alpha \),
-
(iii)
\(\left( \alpha \oplus \beta \right) \oplus \nu =\alpha \oplus \left( \beta \oplus \nu \right) \),
-
(iv)
\(\left( \alpha \otimes \beta \right) \otimes \nu =\alpha \otimes \left( \beta \otimes \nu \right) \),
-
(v)
\(\lambda (\alpha \oplus \beta )=\lambda \alpha \oplus \lambda \beta \), \(\lambda >0\),
-
(vi)
\((\lambda +\gamma )\alpha =\lambda \alpha \oplus \gamma \alpha \), \(\lambda ,\gamma >0\),
-
(vii)
\(\left( \alpha \otimes \beta \right) ^{\lambda }=\alpha ^{\lambda }\otimes \beta ^{\lambda }\), \(\lambda >0\),
-
(viii)
\(\alpha ^{\lambda }\otimes \alpha ^{\gamma }=\alpha ^{\lambda +\gamma }\), \(\lambda ,\gamma >0\).
-
(ix)
If \(\alpha \preceq \beta \), then \(\alpha \oplus \varphi \preceq \beta \oplus \varphi \).
-
(x)
If \(\alpha \preceq \beta \), then \(\alpha \otimes \varphi \preceq \beta \otimes \varphi \).
-
(xi)
\(\alpha \oplus \overline{0}=\alpha \).
-
(xii)
\(\alpha \otimes \overline{1}=1\).
Proof
(i) and (ii) are trivial.
(iii) We know that
for any \(j=1,...,p\) which yields that
Similarly, we get \(\mathbb {I}_{\left( \alpha \oplus \beta \right) \oplus \nu } ^{j}=\mathbb {I}_{\alpha \oplus \left( \beta \oplus \nu \right) }^{j}\) and \(\mathbb {F}_{\left( \alpha \oplus \beta \right) \oplus \nu }^{j}=\mathbb {F} _{\alpha \oplus \left( \beta \oplus \nu \right) }^{j}\) for any \(j=1,...,p\) .
(iv) It is clear that
for any \(j=1,...,p\). Therefore, we obtain
Similarly, we get \(\mathbb {I}_{\left( \alpha \otimes \beta \right) \otimes \nu }^{j}=\mathbb {I}_{\alpha \otimes \left( \beta \otimes \nu \right) }^{j}\) and \(\mathbb {F}_{\left( \alpha \otimes \beta \right) \otimes \nu }^{j}=\mathbb {F} _{\alpha \otimes \left( \beta \otimes \nu \right) }^{j}\) for any \(j=1,...,p\).
(v) We have for any \(j=1,...,p\) that
On the other hand, we obtain
From (3.1) and (3.2) we have \(\mathbb {T}_{\lambda (\alpha \oplus \beta )}^{j}=\mathbb {T}_{\lambda \alpha \oplus \lambda \beta }^{j}\). Similarly, we obtain \(\mathbb {I}_{\lambda \alpha \oplus \lambda \beta }^{j}=\mathbb {I}_{\lambda \alpha \oplus \lambda \beta }^{j}\) and \(\mathbb {F}_{\lambda \alpha \oplus \lambda \beta }^{j}=\mathbb {F}_{\lambda \alpha \oplus \lambda \beta }^{j}\) for any \(j=1,...,p\) which proves the claim.
vi) We get for any \(j=1,...,p\) that
Similarly, we obtain \(\mathbb {I}_{\lambda \alpha \oplus \gamma \alpha } ^{j}=\mathbb {I}_{(\lambda +\gamma )\alpha }^{j}\) and \(\mathbb {F}_{\lambda \alpha \oplus \gamma \alpha }^{j}=\mathbb {F}_{(\lambda +\gamma )\alpha }^{j}\) for any \(j=1,...,p\) which proves the claim.
vii) We obtain for any \(j=1,...,p\) that
and
Now, from (3.3) and (3.4) we get \(\mathbb {T}_{\left( \alpha \otimes \beta \right) ^{\lambda }}^{j}=\mathbb {T}_{\alpha ^{\lambda }\otimes \beta ^{\lambda }}^{j}\). Similarly, we obtain \(\mathbb {I}_{\left( \alpha \otimes \beta \right) ^{\lambda }}^{j}=\mathbb {I}_{\alpha ^{\lambda }\otimes \beta ^{\lambda }}^{j}\) and \(\mathbb {F}_{\left( \alpha \otimes \beta \right) ^{\lambda }}^{j}=\mathbb {F}_{\alpha ^{\lambda }\otimes \beta ^{\lambda }}^{j}\) for any \(j=1,...,p\) which proves the claim.
viii) We have for any \(j=1,...,p\) that
Similarly, we obtain \(\mathbb {I}_{\alpha ^{\lambda }\otimes \alpha ^{\gamma }} ^{j}=\mathbb {I}_{\alpha ^{\lambda +\gamma }}^{j}\) and \(\mathbb {F}_{\alpha ^{\lambda }\otimes \alpha ^{\gamma }}^{j}=\mathbb {F}_{\alpha ^{\lambda +\gamma }} ^{j}\) for any \(j=1,...,p\) which proves the claim.
ix) Let \(\alpha \preceq \beta \). Then, for any \(j=1,...,p\), we have
which yields that
and so \(\mathcal {T}^{*}\left( \mathbb {T}_{\alpha }^{j},\mathbb {T}_{\varphi }^{j}\right) \le _{(int)}\mathcal {T}^{*}\left( \mathbb {T}_{\beta } ^{j},\mathbb {T}_{\varphi }^{j}\right) \). Similarly \(\mathbb {I}_{\alpha } ^{j}\ge _{(int)}\mathbb {I}_{\beta }^{j}\) and \(\mathbb {F}_{\alpha }^{j} \ge _{(int)}\mathbb {F}_{\beta }^{j}\) imply that \(\mathcal {T}\left( \mathbb {I}_{\alpha }^{j},\mathbb {I}_{\varphi }^{j}\right) \ge _{(int)} \mathcal {T}\left( \mathbb {I}_{\beta }^{j},\mathbb {I}_{\varphi }^{j}\right) \) and \(\mathcal {T}\left( \mathbb {F}_{\alpha }^{j},\mathbb {F}_{\varphi } ^{j}\right) \ge _{(int)}\mathcal {T}\left( \mathbb {F}_{\beta }^{j} ,\mathbb {F}_{\varphi }^{j}\right) \). Hence, \(\alpha \oplus \varphi \preceq \beta \oplus \varphi \).
x) The proof is similar to the proof of (ix).
xi) We have
On the other hand, for any \(j=1,...,p\), we obtain
which yields that \(\mathbb {T}_{\alpha \oplus \overline{0}}^{j}=\mathbb {T} _{\alpha }^{j}\). Similarly, we have \(\mathbb {I}_{\alpha \oplus \overline{0}} ^{j}=\mathbb {F}_{\alpha }^{j}\) and \(\mathbb {F}_{\alpha \oplus \overline{0}} ^{j}=\mathbb {T}_{\alpha }^{j}\). Hence, we get \(\alpha \oplus \overline{0}=\alpha \).
xii) The proof is similar to the proof of (xi). \(\square \)
Remark 3
From Theorem 3, it is clear that “\(\otimes \)” and “\(\oplus \)”define a t-norm and a t-conorm on the set of IFVNMVs, respectively.
Weighted aggregation operators
Aggregation operators are very crucial while transforming the data that is represented by a fuzzy set to a more compact form. In this section, using operations discussed in Sect. 3, we give some weighted aggregation operators for classes of IFVNMVs. Throughout this section, we study with t-norm T, the dual t-conorm S of T and intuitionistic fuzzy t-norm \(\mathcal {T}\) that are generated by an algebraic generator g.
Weighted arithmetic aggregation operator
In the following, we define a weighted arithmetic aggregation operator for collections of IFVNMVs given with equal sequence lengths.
Definition 5
Let \(\left\{ \alpha _{i}=\left\langle (\mathbb {T}_{\alpha _{i} }^{,j})_{j=1}^{p},(\mathbb {I}_{\alpha _{i}}^{,j})_{j=1}^{p},(\mathbb {F} _{\alpha _{i}}^{,j})_{j=1}^{p}\right\rangle :i=1,...,n\right\} \) be a collection of IFVNMVs with equal sequence lengths \(p\in \mathbb {Z}^{+}\). Then, a weighted arithmetic aggregation operator \(WA-IFVNMV\) is defined by
where \(0\le \omega _{i}\le 1\) for any \(i=1,...,n\) with \({ {\displaystyle \sum \nolimits _{i=1}^{n}} }\omega _{i}=1\).
Theorem 4
Let \(\left\{ \alpha _{i}=\left\langle (\mathbb {T}_{\alpha _{i} }^{,j})_{j=1}^{p},(\mathbb {I}_{\alpha _{i}}^{,j})_{j=1}^{p},(\mathbb {F} _{\alpha _{i}}^{,j})_{j=1}^{p}\right\rangle :i=1,...,n\right\} \) be a collection of IFVNMVs with equal sequence lengths \(p\in \mathbb {Z}^{+}\) and let \(0\le \omega _{i}\le 1\) for any \(i=1,...,n\) with \({ {\sum \nolimits _{i=1}^{n}} }\omega _{i}=1\). Then, \(WA-IFVNMV(\alpha _{1},...,\alpha _{n})\) is an IFVNMV and we have
Proof
From Proposition 2 and Theorem 2, \(WA-IFVNMV(\alpha _{1},...,\alpha _{n})\) is an IFVNMV. For the second part of the proof, we conduct mathematical induction. For any \(j=1,...,p\), we obtain
Similar proof is valid for \(\mathbb {I}_{\omega _{1}\alpha _{1}\oplus \omega _{2}\alpha _{2}}^{j}\) and \(\mathbb {F}_{\omega _{1}\alpha _{1}\oplus \omega _{2}\alpha _{2}}^{j}\) for any \(j=1,...,p\) which yield that the statement is true for \(n=2\). Assume that
where \(A_{n}:= {\displaystyle \bigoplus \nolimits _{i=1}^{n}} \omega _{i}\alpha _{i}\). Then, we have for any \(j=1,...,p\) that
Similar proof is valid for \(\mathbb {I}_{A_{n}}^{j}\) and \(\mathbb {F}_{A_{n} }^{j}\) for any \(j=1,...,p\) which finishes the proof. \(\square \)
Proposition 3
\(WA-IFVNMV(\overline{\mathbf {0}},...,\overline{\mathbf {0}})= {\displaystyle \bigoplus \nolimits _{i=1}^{n}} \omega _{i}\overline{\mathbf {0}}\) and \(WA-IFVNMV(\overline{\mathbf {1} },...,\overline{\mathbf {1}})= {\displaystyle \bigoplus \nolimits _{i=1}^{n}} \omega _{i}\overline{\mathbf {1}}=\overline{\mathbf {1}}\).
Proof
From Theorem 4, we have
Note here that, \(g(0)=\infty \) and \(g^{-1}(\infty )=0\) stand for \(\lim \nolimits _{t\rightarrow 0^{+}}g(t)=\infty \) and \(h(1)=\infty \) and \(h^{-1} (\infty )=1\) stand for \(\lim \nolimits _{t\rightarrow 1^{-}}h(t)=\infty \). Similarly, it is seen that
\(\square \)
The following theorem shows that \(WA-IFVNMV\) is monotone.
Theorem 5
Let \(\left\{ \alpha _{i}=\left\langle (\mathbb {T}_{\alpha _{i} }^{,j})_{j=1}^{p},(\mathbb {I}_{\alpha _{i}}^{,j})_{j=1}^{p},(\mathbb {F} _{\alpha _{i}}^{,j})_{j=1}^{p}\right\rangle :i=1,...,n\right\} \) and \(\left\{ \beta _{i}=\left\langle (\mathbb {T}_{\beta _{i}}^{,j})_{j=1}^{p},(\mathbb {I} _{\beta _{i}}^{,j})_{j=1}^{p},(\mathbb {F}_{\beta _{i}}^{,j})_{j=1} ^{p}\right\rangle :i=1,...,n\right\} \) be two families of IFVNMVs such that \(\alpha _{i}\preceq \beta _{i}\) for any \(i=1,...,n\). Then,
and
Proof
Assume that \(\alpha _{i}\preceq \beta _{i}\) for any \(i=1,...,n\). Then, we have
Since h, \(h^{-1}\), g and \(g^{-1}\) are increasing, we have
and
which implies that \(\mathbb {T}_{WA-IFVNMV(\alpha _{1},...,\alpha _{n})} \le _{(int)}\mathbb {T}_{WA-IFVNMV(\beta _{1},...,\beta _{n})}\).
Similarly, we obtain
and
Therefore, we get \(WA-IFVNMV(\alpha _{1},...,\alpha _{n})\preceq WA-IFVNMV(\beta _{1},...,\beta _{n})\). Hence, \(WA-IFVNMV\) is monotone with respect to the partial order “\(\preceq \)”. \(\square \)
Weighted geometric aggregation operator
Definition 6
Let \(\left\{ \alpha _{i}=\left\langle (\mathbb {T}_{\alpha _{i} }^{,j})_{j=1}^{p},(\mathbb {I}_{\alpha _{i}}^{,j})_{j=1}^{p},(\mathbb {F} _{\alpha _{i}}^{,j})_{j=1}^{p}\right\rangle :i=1,...,n\right\} \) be a collection of IFVNMVs with equal sequence lengths \(p\in \mathbb {Z}^{+}\). Then, a weighted geometric aggregation operator \(WG-IFVNMV\) is defined by
where \(0\le \omega _{i}\le 1\) for any \(i=1,...,n\) with \({ {\displaystyle \sum \nolimits _{i=1}^{n}} }\omega _{i}=1\).
Theorem 6
Let \(\left\{ \alpha _{i}=\left\langle (\mathbb {T}_{\alpha _{i}}^{,j})_{j=1} ^{p},(\mathbb {I}_{\alpha _{i}}^{,j})_{j=1}^{p},(\mathbb {F}_{\alpha _{i}} ^{,j})_{j=1}^{p}\right\rangle :i=1,...,n\right\} \) be a collection of IFVNMVs with equal sequence lengths \(p\in \mathbb {Z}^{+}\) and let \(0\le \omega _{i} \le 1\) for any \(i=1,...,n\) with \({ {\displaystyle \sum \nolimits _{i=1}^{n}} }\omega _{i}=1\). Then, \(WG-IFVNMV(\alpha _{1},...,\alpha _{n})\) is an IFVNMV and we have
Proof
The proof is similar to the proof of Theorem 4. Therefore, we omit it. \(\square \)
Proposition 4
\(WG-IFVNMV(\overline{\mathbf {0}},...,\overline{\mathbf {0}})= {\displaystyle \bigoplus \nolimits _{i=1}^{n}} \omega _{i}\overline{\mathbf {0}}\) and \(WG-IFVNMV(\overline{\mathbf {1} },...,\overline{\mathbf {1}})= {\displaystyle \bigoplus \nolimits _{i=1}^{n}} \omega _{i}\overline{\mathbf {1}}=\overline{\mathbf {1}}\).
Proof
It can be proved similar to Proposition 3. \(\square \)
Remark 4
Similar to Theorem 5, it can be proved that
whenever \(\alpha _{i}\preceq \beta _{i}\) for any \(i=1,...,n\). Hence, \(WG-IFVNMV\) is monotone with respect to partial order “\(\preceq \)”.
Some particular cases of \(WA-IFVNMV\) and \(WG-IFVNMV\)
In this subsection, we study some particular cases of \(WA-IFVNMV\) and \(WG-IFVNMV\) by choosing particular additive generators.
-
(1)
Consider the generator g recalled in Example 1 and defined by \(g(t)=-\log t\). Then, \(WA-IFVNMV\) and \(WG-IFVNMV\) turn into following Algebraic weighted aggregation operators:
$$\begin{aligned}&WA_{A}-IFVNMV(\alpha _{1},...,\alpha _{n})\nonumber \\&:=\left( \left( \left\{ 1- {\textstyle \prod \limits _{i=1}^{n}} \left( 1-T_{\alpha _{i}}^{j,t}\right) ^{\omega _{i}}\right\} _{j=1} ^{p},\left\{ {\textstyle \prod \limits _{i=1}^{n}} \left( T_{\alpha _{i}}^{j,f}\right) ^{\omega _{i}}\right\} _{j=1}^{p}\right) \right. ,\nonumber \\&\left. \left( \left\{ {\textstyle \prod \limits _{i=1}^{n}} \left( I_{\alpha _{i}}^{j,t}\right) ^{\omega _{i}}\right\} _{j=1} ^{p},\left\{ 1- {\textstyle \prod \limits _{i=1}^{n}} \left( 1-I_{\alpha _{i}}^{j,f}\right) ^{\omega _{i}}\right\} _{j=1} ^{p}\right) \right. ,\nonumber \\&\left. \left( \left\{ {\textstyle \prod \limits _{i=1}^{n}} \left( F_{\alpha _{i}}^{j,t}\right) ^{\omega _{i}}\right\} _{j=1} ^{p},\left\{ 1- {\textstyle \prod \limits _{i=1}^{n}} \left( 1-F_{\alpha _{i}}^{j,f}\right) ^{\omega _{i}}\right\} _{j=1} ^{p}\right) \right) \end{aligned}$$(4.1)and
$$\begin{aligned}&WG_{A}-IFVNMV(\alpha _{1},...,\alpha _{n})\nonumber \\&:=\left( \left( \left\{ {\textstyle \prod \limits _{i=1}^{n}} \left( T_{\alpha _{i}}^{j,t}\right) ^{\omega _{i}}\right\} _{j=1} ^{p},\left\{ 1- {\textstyle \prod \limits _{i=1}^{n}} \left( 1-T_{\alpha _{i}}^{j,f}\right) ^{\omega _{i}}\right\} _{j=1} ^{p}\right) \right. ,\nonumber \\&\left. \left( \left\{ 1- {\textstyle \prod \limits _{i=1}^{n}} \left( 1-I_{\alpha _{i}}^{j,t}\right) ^{\omega _{i}}\right\} _{j=1} ^{p},\left\{ {\textstyle \prod \limits _{i=1}^{n}} \left( I_{\alpha _{i}}^{j,f}\right) ^{\omega _{i}}\right\} _{j=1}^{p}\right) \right. ,\nonumber \\&\left. \left( \left\{ 1- {\textstyle \prod \limits _{i=1}^{n}} \left( 1-F_{\alpha _{i}}^{j,t}\right) ^{\omega _{i}}\right\} _{j=1} ^{p},\left\{ {\textstyle \prod \limits _{i=1}^{n}} \left( F_{\alpha _{i}}^{j,f}\right) ^{\omega _{i}}\right\} _{j=1}^{p}\right) \right) \text {,} \end{aligned}$$(4.2)respectively.
-
(2)
Consider the additive generator g defined by \(g(t)=\log \frac{2-t}{t}\). Then, \(WA-IFVNMV\) and \(WG-IFVNMV\) turn into following Einstein weighted aggregation operators:
and
respectively.
An application of IFVNMVs to a classification problem
In this section, we give a classification method using IFVNMSs and aggregation operators defined in Section “Weighted aggregation operators”.
A simplified neutrosophic valued cosine similarity measure for IFVNMVs
Similarity measures are convenient tools in the classification. A cosine similarity measure between IFSs depends on the cosine of the angle of the vector representations of the membership and non-membership degrees (see e.g., [45]). Now, we propose a simplified neutrosophic valued cosine similarity measure. First, let us recall the notion of SNS and simplified neutrosophic value (SNV). A SNS [16] on a universal set \(X=\left\{ x_{1},...,x_{n}\right\} \) is given by
where \(T_{A},I_{A},F_{A}:X\rightarrow [0,1]\) are the truth, indeterminacy and falsity functions. For a fixed \(x\in X\),
is called a simplified neutrosophic value (SNV).
Definition 7
A simplified neutrosophic valued weighted cosine similarity measure between IFVNMVs \(\alpha \) and \(\beta \) with same sequence lengths p is given with
where \(0\le \omega _{j}\le 1\) for any \(j=1,...,p\) and \(\sum _{j=1}^{p}\omega _{j}=1\).
It is clear that \(CSN(\alpha ,\beta )\) is a SNV. Therefore, we need a score function to rank the values of CSN. Let \(A=(a,b,c)\) be a SNV. An improved score function N defined by
has been proposed by Nancy and Garg [25]. We use the score function N to rank the results of CSN.
Numerical example
In this sub-section, we consider a real-life example of classification. Before, we summarize the proposed method by the following simple algorithm:
Step 1: Consider the whole data set as \(X=\{x_1,...,x_n\}\), where n is the sample size of the data set.
Step 2: Separate the database as the training set \(T=\{ t_1, ... , t_m\}\) and testing set \(Y=\{y_1, ... , y_l\}\), where m and l are the sample sizes of the training and testing sets, respectively.
Step 3: According to the view of p experts, the value sizes are expressed as IFVNMVs.
Step 4: For each attribute \(x_i\) in data set, calculate the range as \(R=x_{(m)}-x_{(1)}\) where \(x_{(m)}\) is the maximum value and \(x_{(1)}\) is the minimum value of the data set. The range is divided into c categories using percentiles. Determine the levels and each level corresponds to an IFVNMV from Step 3.
Step 5: For each class in the training set, calculate the mean value \(\bar{X}\) for each attribute. The interval that \(\bar{X}\) is coming from determines the level. Obtain the IFVNMS representations that consists of IFVNMVs from Step 4 of each class using these levels and using a weighted aggregation operator, obtain the IFVNMV representation of each class.
Step 6: With the same algorithm, determine the IFVNMV representation of the each sample from testing set.
Step 7: Calculate the similarity measures using CSN (5.1) and obtain the scores from score function N (5.2). Then, classify each sample according to the maximum score function value.
It should be also noted that, these steps are repeated using different aggregation operator.
As an application, a real example of classification from UCI Machine Learning Repository is conducted to show the performance of the method. Recently, researchers have carried out some studies on iris dataset with the help of fuzzy logic. For example, Singh and Ganie [47,48,49] have proposed similarity and correlation measures for some various fuzzy sets and have applied them to a classification problem with Iris database. In these studies, the authors have introduced the conversion formula from crisp data to fuzzy data. Also, to assess the performance of the proposed measures a performance index, namely “Degree of confidence (DoC)”, has been introduced. In view of DoC, these proposed measures are found to outperform the existing compatibility measures and they have not proposed accuracy mean for result of classification. Moreover, Fei et al. [5] have introduced a vector valued similarity measure for IFSs and they have applied it to the same classification problem. Di Martino and Sessa [50] have proposed classification algorithm based on direct and inverse fuzzy transforms.
The data are for iris plants and consists of 150 samples. These samples are divided into three categories, namely Setosa, Versicolour and Virginica and each sample has four attributes, namely Sepal Length (SL), Sepal Width (SW), Petal Length (PL) and Petal Width (PW). In this example, 30 samples are randomly selected from each category as a training set and 20 of them are used as a testing set. First, each value size of the iris plant is represented by an IFVNMV by adapting Table 2 of [5]. For a fixed \(i=1,2,3\); \(\mathbb {T}^{i}\), \(\mathbb {I}^{i}\) and \(\mathbb {F}^{i}\) is considered the truth, indeterminacy and falsity IFV, respectively, given by the ith expert. The adapted values of IFVNMs are shown in Table 3.
The IFVNMVs of three classes are obtained as shown in Table 4 with four different aggregation operators.
Next, similarities are calculated between IFVNMVs of the three classes and the 20 testing samples of each class and score functions are calculated based on different aggregation operators (see Table 4). Table 5 is constructed using aggregation operator WA\(_A\)-IFVNMV for the sake of brevity. It can be seen that other aggregation operators give the same result as well.
It can be easily seen that, the accuracy is 100% in Setosa, 100% in Versicolour and 90% in Virginica class. The average accuracy is 97%.
Conclusion
In this study, we introduce the concept of intuitionistic fuzzy-valued neutrosophic multi-set (IFVNMS) by considering the sequences of intuitionistic fuzzy values instead of numbers. Therefore, more detailed information can be kept when transforming the data to fuzzy sets. In this manner, it prevents the loss of information. We present some set theoretic operations between IFVNMSs. Using general t-norms and t-conorms, we define some fundamental algebraic operations between intuitionistic fuzzy-valued neutrosophic values (IFVNMVs). With the help of these algebraic operations, we introduce some weighted arithmetic and geometric aggregation operators. These aggregation operators allow us to aggregate IFVNMSs to IFVNMVs. Thus, one may obtain more compact and rich representation of real data. By defining a simplified neutrosophic valued cosine similarity measure, we rank IFVNMVs in the simplified neutrosophic environment. After this, with the help of an improved score function for simplified neutrosophic values existing in the literature [25], we manage to rank results of the cosine similarity measure. We give an algorithm to give the applicability of the proposed theory to the classification. We also apply the algorithm to a real classification from UCI Machine Learning Repository and we show that the average accuracy is 97%. The steps how we used the theoretic part of this paper in the classification can be seen in Fig. 1.
The proposed theory is applicable in any multi-criteria decision making problem, pattern recognition and classification problems, especially problems with more than one decision makers. Therefore, this new theory will be a useful tool in decision and ranking problems such as robot selection, software selection, green suppliers selection or solid waste landfill site selection problems etc. In the future, we give some applications of the proposed theory to some multi-criteria decision making problems such as medical diagnosis and pattern recognition.
References
Zadeh LA (1965) Fuzzy sets. Inf Control 8(3):338–353
Atanassov KT (1999) Intuitionistic fuzzy sets. In: Intuitionistic fuzzy sets, Physica, Heidelberg, pp 1–137
Dymova L, Sevastjanov P (2012) The operations on intuitionistic fuzzy values in the framework of Dempster-Shafer theory. Knowl-Based Syst 35:132–143
Balasubramaniam P, Ananthi VP (2014) Image fusion using intuitionistic fuzzy sets. Inf Fusion 20:21–30
Fei L, Wang H, Chen L, Deng Y (2019) A new vector valued similarity measure for intuitionistic fuzzy sets based on OWA operators. Iran J Fuzzy Syst 16(3):113–126
Lin L, Yuan XH, Xia ZQ (2007) Multicriteria fuzzy decision-making methods based on intuitionistic fuzzy sets. J Comput Syst Sci 73:84–88
Melo-Pinto P, Couto P, Bustince H, Barrenechea E, Pagola M, Fernandez J (2013) Image segmentation using Atanassov’s intuitionistic fuzzy sets. Expert Syst Appl 40(1):15–26
Xiao F (2019) A distance measure for intuitionistic fuzzy sets and its application to pattern classification problems. IEEE Trans Syst Man Cybern Syst 51(6):3980–3992
de Amorim RC (2016) A survey on feature weighting based k-means algorithms. J Classif 33:210–242
Krawczaka M, Szkatułaa G (2020) On matching of intuitionistic fuzzy sets. Inf Sci 517:254–274
He X, Li Y, Qin K, Meng D (2020) Distance measures on intuitionistic fuzzy sets based on intuitionistic fuzzy dissimilarity functions. Soft Comput 24:523–541
Kumar PS (2020) Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set. Int J Syst Assur Eng Manag 11(1):189–222
Lohani QMD, Solanki R, Muhuri PK (2018) A convergence theorem and an experimental study of intuitionistic fuzzy c-mean algorithm over machine learning dataset. Appl Soft Comput 71:1176–1188
Smarandache F, (1998). A unifying field of logics. Neutrosophy: Neutrosophic probability, set and logic. American Research Press, Rehoboth
Wang H, Smarandache F, Zhang YQ, Sunderraman R (2010) Single valued neutrosophic sets. Multispace Multistruct 4:410–413
Ye J (2014) A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. J Intell Fuzzy Syst 26(5):2459–2466
Deli I, Broumi S (2015) Neutrosophic soft matrices and NSM decision making. J Intell Fuzzy Syst 28(5):2233–2241
Yager RR (1986) On the theory of Bags. Int J Gen Syst 13(1):23–37
Miyamoto S (2000) Fuzzy multisets and their generalizations. In: Lecture notes in computer science, Springer, Berlin, pp 225–235
Shinoj TK, Sunil JJ (2012) Intuitionistic fuzzy multisets and its application in medical diagnosis. World Acad Sci Eng Technol 6:1418–1421
Ye S, Ye J (2014) Dice similarity measure between single valued neutrosophic multisets and its application in medical diagnosis. Neutrosophic Sets Syst 6:48–53
Beliakov G, Bustince H, Goswami DP, Mukherjee UK, Pal NR (2011) On averaging operators for Atanassov’s intuitionistic fuzzy sets. Inf Sci 181:1116–1124
Liu PD, Chen SM (2016) Heronian aggregation operators of intuitionistic fuzzy numbers based on the Archimedan \(t-\)norm and \(t-\)conorm. In: Proceedings of the 2016 international conference on machine learning and cybernetics, Jeju, South Korea, 10–13 July
Liu P, You X (2018) Some linguistic intuitionistic fuzzy Heronian mean operators based on Einstein T-norm and T-conorm and their application to decision-making. J Intell Fuzzy Syst 35(2):2433–2445
Garg H, Rani D (2020) New generalised Bonferroni mean aggregation operators of complex intuitionistic fuzzy information based on Archimedean t-norm and t-conorm. J Exp Theor Artif Intell 32(1):81–109
Garg H, Arora R (2021) Generalized Maclaurin symmetric mean aggregation operators based on Archimedean t-norm of the intuitionistic fuzzy soft set information. Artif Intell Rev 54:3173–3213
Zhang X, Liu P, Wang Y (2015) Multiple attribute group decision making methods based on intuitionistic fuzzy frank power aggregation operators. J Intell Fuzzy Syst 29(5):2235–2246
Zhu WB, Shuai B, Zhang SH (2020) The linguistic interval-valued intuitionistic fuzzy aggregation operators based on extended hamacher T-Norm and S-Norm and their application. Symmetry 12(4):668
Chen J, Ye J (2017) Some single-valued neutrosophic Dombi weighted aggregation operators for multiple attribute decision-making. Symmetry 9(6):82
Peng JJ, Wang JQ, Wang J, Zhang HY, Chen XH (2016) Simplified neutrosophic sets and their applications in multi-criteria group decision-making problems. Int J Syst Sci 47(10):2342–2358
Peng JJ, Wang JQ, Wu XH, Wang J, Chen XH (2015) Multivalued 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
Ye J, Türkarslan E, Ünver M, Olgun M (2021) Algebraic and Einstein weighted operators of neutrosophic enthalpy values for multi-criteria decision making in neutrosophic multi-valued set settings. Granul Comput. https://doi.org/10.1007/s41066-021-00279-x
Jamil M, Abdullah S, Khan MY, Smarandache F, Ghani F (2019) Application of the Bipolar Neutrosophic Hamacher averaging aggregation operators to group decision making: an illustrative example. Symmetry 11:698
Wang L, Zhang H, Wang J (2017) Frank Choquet Bonferroni mean operators of bipolar neutrosophic sets and their application to multi-criteria decision-making problems. Int J Fuzzy Syst 20(1):13–28
Grabisch M, Marichal J. L, Mesiar R, Pap E (2009) Aggregation functions. Cambridge University Press, Encyclopedia of Mathematics and its Applications. No: 127
Chelly Dagdia Z, Elouedi Z (2020) A hybrid fuzzy maintained classification method based on dendritic cells. J Classif 37:18–41
Taheri M, Zolghadri M (2014) A margin-based model with a fast local search for rule weighting and reduction in fuzzy rule-based classification systems. Iran J Fuzzy Syst 11(3):55–75
Yuen KKF (2013) A cognitive style and aggregation operator model: a linguistic approach for classification and selection of the aggregation operators. Iran J Fuzzy Syst 10(1):29–60
Palarea-Albaladejo J, Martín-Fernández JA, Soto JA (2012) Dealing with Distances and Transformations for Fuzzy C-Means Clustering of Compositional Data. J Classif 29:144–169
Ye J (2017) Single-valued neutrosophic clustering algorithms based on similarity measures. J Classif 34(4):148–162
Deschrijver G, Cornelis C, Kerre EE (2004) On the representation of intuitionistic fuzzy t-norms and t-conorms. IEEE Trans Fuzzy Syst 12(1):45–61
Klir G, Yuan B (1995) Fuzzy sets and fuzzy logic: theory and applications. Prentice Hall, Upper Saddle River, NJ
Nguyen HT, Walker EA (1997) A first course in fuzzy logic. CRC Press, Boca Raton, Florida
Xia M, Xu Z, Zhu B (2012) Some issues on intuitionistic fuzzy aggregation operators based on Archimedean t-conorm and t-norm. Knowl-Based Syst 31:78–88
Ye J (2011) Cosine similarity measures for intuitionistic fuzzy sets and their applications. Math Comput Model 53(1–2):91–97
Nancy and Garg, H. (2016). An improved score function for ranking neutrosophic sets and its application to decision-making process. Int J Uncertain Quant 6(5):377–385
Singh S, Ganie AH (2021) Some novel q-rung orthopair fuzzy correlation coefficients based on the statistical viewpoint with their applications. J Ambient Intell Human Comput. https://doi.org/10.1007/s12652-021-02983-7
Singh S, Ganie AH (2021) Applications of a picture fuzzy correlation coefficient in pattern analysis and decision-making. Granul Comput. https://doi.org/10.1007/s41066-021-00269-z
Singh S, Ganie AH (2021) Applications of picture fuzzy similarity measures in pattern recognition, clustering, and MADM. Expert Syst Appl 168:114264. https://doi.org/10.1016/j.eswa.2020.114264
Di Martino F, Sessa S (2021) A classification algorithm based on multi-dimensional fuzzy transforms. J Ambient Intell Hum Comput. https://doi.org/10.1007/s12652-021-03336-0
Acknowledgements
The authors are grateful to the reviewers for carefully reading the manuscript and for offering many suggestions which resulted in an improved presentation.
Open Access
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Ünver, M., Türkarslan, E., elik, N. et al. Intuitionistic fuzzy-valued neutrosophic multi-sets and numerical applications to classification. Complex Intell. Syst. 8, 1703–1721 (2022). https://doi.org/10.1007/s40747-021-00621-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40747-021-00621-5
Keywords
- Intuitionistic fuzzy-valued neutrosophic multi-set
- Weighted arithmetic aggregation operator
- Weighted geometric aggregation operator
- Classification