Distance and Similarity Measures for Octahedron Sets and Their Application to MCGDM Problems

: In this paper, in order to apply the concept of octahedron sets to multi-criteria group decision-making problems, we deﬁne several similarity and distance measures for octahedron sets. We present a multi-criteria group decision-making method with linguistic variables in octahedron set environment. We give a numerical example for multi-criteria group decision-making problems.


Introduction
In real world, we frequently encounter with decision-making problems with uncertainty and vagueness that can be difficult to solve with the classical methods. A number of techniques have been developed to solve uncertinities; similarity measures are one of tools solving decision-making problems. Chen and Hsiao [1] studied some similarity measures for fuzzy sets introduced by Zadeh [2]. Pramanik and Mondal [3] defined the concept of weighted fuzzy similarity measure (called a tangent similarity measure) and applied it to medical diagnosis. Hwang and Yang [4] made a new similarity measure for intuitionistic fuzzy sets proposed by Atanassov [5]. Pramanik and Mondal [6] proposed intuitionistic fuzzy similarity measure based on tangent function and applied it to multi-attribute decision. Ren and Wang [7] introduced the notion of similarity measures for interval-valued intuitionstic fuzzy sets proposed by Atanassov and Gargov [8]. Baroumi and Smarandache [9] dealt with several similarity measures between neutrosophic sets and applied them to decision-making problems introduced by Smarandache [10]. Ye [11] defined a similarity measure for interval neutrosophic sets and applied it to decision-making method. Sahin and Liu [12] introduced various distance and similarity measures between single-valued neutrosophic hesitant fuzzy sets (see Reference [13,14]) and discussed MADM problems based on the single-valued neutrosophic hesitant fuzzy information. Kaur and Garg [15,16] applied it to decision-making and studied cubic intuitionistic fuzzy aggregation operators (see Reference [17,18]). Pramanik et al. [19] proposed a similarity measure for cubic neutrosophic sets and applied it a multi-criteria group decision-making (MCGDM) method.
Recently, Kim et al. [20] defined an octahedron set composed of an interval-valued fuzzy set, an intuitionistic set and a fuzzy set that will provide more information about uncertainty and vagueness. The purpose of this paper is to review recent research into the octahedron set applications with MCGDM method. This paper proposes a new methodology for the theory of octahedron set with defining several distance and similarity measures between octahedron sets. Moreover, we prove that each is distance and similarity measure. This new application offers some important insights into octahedron sets with MCGDM method based on a similarity measure for octahedron sets. The findings reported here shed new light on an application area of octahedron sets. This approach will prove useful in expanding our understanding of how the application of octahedron sets can be done. The findings of this study could have a number of important implications for future practice with analyzing our numerical example for MCGDM problems that is given in this paper. In order to apply the concept of octahedron sets to MCGDM problems, this paper is presented as follows: In Section 2, we list some basic notions that are needed in next section. In Section 3, we propose several distance and similarity measures between octahedron sets and prove that each is distance and similarity measure. In Section 4, we present a MCGDM method based on a similarity measure for octahedron sets environments. In addition, we give a numerical example for MCGDM problems to demonstrate the usefulness and applicability of our proposed method. There is a relatively small body of literature that is concerned with the application of soft octahedron sets. In recent years, there has been an increasing amount of literature on the application of set theories. One of the aim of this research was to improve the works on the application of octahedron sets by proposing suitable examples in this paper. All these findings will provide a base to researchers who want to work in the field of the application of octahedron sets and will help to strengthen the foundations of the other MCGDM problems in octahedron set environment, such as economic policy, foreign policy between countries, trade policy, financial policy, etc., by using big data.
Definition 1 (Reference [5]). For a nonempty set X, a mapping A : X → I ⊕ I is called an intuitionistic fuzzy set (briefly, IF set) in X, where, for each x ∈ X, A(x) = (A ∈ (x), A ∈ (x)), and A ∈ (x) and A ∈ (x) represent the degree of membership and the degree of nonmembership of an element x to A, respectively. Let (I ⊕ I) X denote the set of all IF sets in X and for each A ∈ (I ⊕ I) X , we write A = (A ∈ , A ∈ ). In particular,0 and1 denote the IF empty set and the IF whole set in X defined by, respectively: For each x ∈ X,0 (x) =0 and1(x) =1.
Refer to Reference [5] for the definitions of the inclusion, the equality , the intersection, and the union of intuitionistic fuzzy set and operations c , [ ], on (I ⊕ I) X .
The set of all closed subintervals of I is denoted by [I], and members of [I] are called interval numbers and are denoted by a, b, c,, etc., where a = [a − , a + ] and 0 ≤ a − ≤ a + ≤ 1. In particular, if a − = a + , then we write as a = a. Refer to Reference [20] for the definitions of the order and the equality of two interval numbers, as well as the infimum and the supremum of any interval numbers.
Definition 2 (Reference [22,23]). For a nonempty set X, a mapping A : X → [I] is called an interval-valued fuzzy set (briefly, an IVF set) in X. Let [I] X denote the set of all IVF sets in X. For each A ∈ [I] X and x ∈ X, A(x) = [A − (x), A + (x)] is called the degree of membership of an element x to A, where A − , A + ∈ I X are called a lower fuzzy set and an upper fuzzy set in X, respectively. For each A ∈ [I] X , we write A = [A − , A + ]. In particular, 0 and 1 denote the interval-valued fuzzy empty set and the interval-valued fuzzy empty whole set in X defined by, respectively: for each x ∈ X, 0(x) = 0 and 1(x) = 1.
Refer to Reference [22,23] for the definitions of the inclusion, the equality, the intersection, and the union of intuitionistic fuzzy set and operation c on [I] X .

Now, members of
, and are called octahedron numbers. Furthermore, we define the following order relations between ā and b (see Reference [20]): From the above orders, we can define the inf and the sup of octahedron numbers as follows.
It is obvious that, for each A ∈ 2 X , χ A = [χ A , χ A ], (χ A , χ A c ), χ A ∈ O(X) and then 2 X ⊂ O(X), where 2 X denotes the set of all subsets of X and χ A denotes the characteristic function of A. Furthermore, we can easily see that, for each A = A, λ ∈ C(X), A = A, (A − , A + ), λ , A = A, (λ, λ c ), λ ∈ O(X) and then C(X) ⊂ O(X). In this case, we denote A, (A − , A + ), λ and A, (λ, λ c ), λ as A A and A λ , respectively. In fact, we can consider octahedron sets as a generalization of cubic sets.
Definition 5 (Reference [20]). Let X be a nonempty set, and let A = A, A, λ , B = B, B, µ ∈ O(X). Then, we can define following order relations between A and B: Definition 6 (Reference [20]). Let X be a nonempty set, and let (A j ) j∈J = ( A j , A j , λ j ) j∈J be a family of octahedron sets in X. Then, the Type i-union ∪ i and Type i-intersection ∩ i of (A j ) j∈J , (i = 1, 2, , 3,4), are defined as follows, respectively: Let R be the real space. Then, for any intervals A = [a 1 , Throughout this paper, let X = {x 1 , x 2 , x 3 , · · · , x n } be a universal set.

Distance and Similarity Measures between Octahedron Sets
In this case, d(A, B) is called the distance measure between A and B.
In this case, d(A, B) is called the similarity measure between A and B.
In fact, distance measure and similarity measure from Definitions 7 and 8, we can easily see that Now, we give some types of distance measures between two octahedron sets in the following: Then, d GN is a distance measure on O(X) (see Propositions 1 and 2). In particular, if δ = 1, then d GN reduces an octahedron normalized Hamming distance and denoted by d NH : If δ = 2, then d GN reduces an octahedron normalized Euclidean distance and denoted by d NE : In fact, d GN can be viewed as a most generalized case of distance measures.
(2) (Generalized octahedron normalized Hausdorff distance) We define d GNH : O(X) × O(X) → I is the mapping defined as: for any A, B ∈ O(X), Then, d GNH is a distance measure on O(X) (see Propositions 3 and 4). In particular, if δ = 1, then d GNH reduces an octahedron normalized Hamming-Hausdorff distance and denoted by d NHH : If δ = 2, then d GNH reduces an octahedron normalized Euclidean-Hausdorff distance and denoted by d NEH : In many practical situations, the weight of each element x i ∈ X should be taken into account. For example, in MADM problems, since the considered attribute has different importance in general, we need to be assigned with different weights. Since an octahedron set has three types of degree (an interval-valued fuzzy membership degree, an intuitionistic fuzzy membership degree and a fuzzy membership degree) and each degree may have different importance according to a decision-maker, different weights can be assigned to each element in each degree. We assume that the weights denote the weights assigned to interval-valued fuzzy membership degree, intuitionistic fuzzy membership degree and fuzzy membership degree of an octahedron set. Now, we give some types of weighted distance measures between two octahedron sets in the following: Then, d GW is a weighted distance measure on O(X) (The proof is omitted). In particular, if δ = 1, then d GW reduces an octahedron weighted Hamming distance and denoted by d W H : If δ = 2, then d GW reduces an octahedron weighted Euclidean distance and denoted by d WE : (2) (Generalized octahedron weighted Hausdorff distance) We define d GW H : O(X) × O(X) → I is the mapping defined as: For any A, B ∈ O(X), Then, d GW H is a weighted distance measure on O(X) (The proof is omitted). In particular, if δ = 1, then d GW H reduces an octahedron weighted Hamming-Hausdorff distance and denoted by d W HH : If δ = 2, then d GW H reduces an octahedron weighted Euclidean-Hausdorff distance and denoted by d WEH : Thus, we have In addition, by the definition of d NH , Thus, we get This completes the proof.  Proof. Since the proofs of (DM 2 ) and (DM 3 ) are easy from the definition of d GNH , we will show only (DM 1 ) and (DM 4 ).
(DM 4 ) Suppose A, B, C ∈ O(X) such that A ⊂ 1 B ⊂ 1 C, and let x i ∈ X. Then, we have Thus, we get . This completes the proof.   (2) In fact, (Octahedron similarity measure corresponding to d NH ) In fact, (Octahedron similarity measure corresponding to d NE ) In fact, (2) (Generalized octahedron similarity measure corresponding to d GNH ) In fact, (Octahedron similarity measure corresponding to d NHH ) In fact, (Octahedron similarity measure corresponding to d NEH ) In fact, (3) (Generalized octahedron similarity measure corresponding to d GW ) In fact, In fact, (Octahedron similarity measure corresponding to d WE ) (A, B). (10) In fact, (3) (Generalized octahedron similarity measure corresponding to d GW H ) In fact, In fact, (Octahedron similarity measure corresponding to d WEH ) In fact, From Propositions 1-4, and the duality between distance measures and similarity measures, we can prove that (2)-(13) are similarity measures. But, we will show directly that (3) satisfies the conditions that are defined in Definition 8.
Similarly, we can prove that s NH (A, C) ≤ s NH (B, C). Therefore, s NH a similarity measure on O(X).
Step 1. Formation of ideal octahedron set decision matrix. Ideal octahedron set decision matrix is an important matrix for similarity measure of MCGDM given in the following form: where A ij = A ij , A ij , λ ij , i = 1, 2, · · · , n, j = 1, 2, · · · , m.
Step 3. Determination of attribute weight. All attributes are not equally important in a decision-making situation. Every decision-maker provides their own opinion regarding to the attribute weight in terms of linguistic variables that can be converted into octahedron set. Let w k (β j ) denote the attribute weight for the attribute β j given by the k-th decision-maker in terms of octahedron set. We convert into w k (β j ) into fuzzy number as follows: where , and each of the above values denote the value of the octahedron set corresponding to (k, β j ). Then, aggregate weight for the criteria β j can be determined as follows: where Σ r k=1 W j = 1.
Step 4. Calculation of weighted similarity measure. We calculate weighted similarity measure between the ideal matrix M and the k-th decision matrix M k as follows: where for each x r ∈ X and k = 1, 2, · · · , r.
Step 5. Ranking of alternatives. In order to rank alternatives, we give the following formula: where i = 1, 2, · · · , n. We can arrange alternatives according to the descending order values of ρ i . The highest value of ρ i reflects the best alternative.

Example 4 (Numerical example).
In order to solve a MCGDM problem, we adapt "Illustrative example" given by Ye [11] to demonstrate the applicablility and effectiveness of the proposed method. Assume that an investment company wants to invest a sum of money in the best option. The investment company is composed of a decision-making committee comprised of three members, say k 1 , k 2 , k 3 to make a panel of four alternatives to invest money. The alternatives Car company (α 1 ), Food company (α 2 ), Computer company (α 3 ), and Arm company (α 4 ). Decision-makers take decision based on the criteria, namely risk analysis (β 1 ), growth analysis (β 2 ), environment impact (β 3 ), and criteria weights, which are given by the decision-makers in terms of linguistic variables that can be converted into octahedron set (see Table 1).   By using Equations (18) and (19), we get the following attribute weights: Step 4. Calculation of weighted similarity measures. By using Formula (20), we obtain weighted similarity measures between the ideal matrix M and the k s -th decision matrix M k s (s = 1, 2, 3) as follows: Step 5. Ranking of alternatives. In order to rank the alternatives according to the descending value of ρ i , by using Equations (22)-(24), we obtain ρ i (i = 1, 2, 3, 4): ρ 1 = 0.196, ρ 2 = 0.199, ρ 3 = 0.232, ρ 4 = 0.193.
Then, ρ 3 > ρ 2 > ρ 1 > ρ 4 . Thus, the ranking order is as follows: So, we can see that Computer company (α 3 ) is the best alternative for money investment.

Conclusions
With this paper, we wished to renew an interest in the systematic study of the relationships between multi-criteria group decision-making (MCGDM) method with respect to octahedron set theory. For this purpose, various distance and similarity measures for octahedron sets were defined, and some of their properties were proved. The usefulness and interest of this correspondence of new defined distance and similarity measures will of course be enhanced if there is a way of returning from the transforms, that is to say, if there is a new method that characterize our proposed similarity measure. In Section 4, all the studies came to fruition, and we took up a result, MCGDM method based on a similarity measure for octahedron sets environments, which plays a pivotal role for demonstrating the usefulness of giving numerical examples. The detailed application of MCGDM method was carried out by introducing a a numerical example in the closing of Section 4. It considered some of the new results and consequences, which could be useful from the point of view of octahedron set theory, which were not studied at all. All these findings will provide a base to researchers who want to work in the field of the application of octahedron sets and will help to strengthen the foundations of the other MCGDM problems in octahedron set environment, such as economic policy, foreign policy between countries, trade policy, financial policy, etc., by using big data.