Abstract
First we give notion of integral of intuitionistic fuzzy set and introduce intuitionistic fuzzy implicator and intuitionistic fuzzy inclusion measure. Then we propose a new measure of similarity between two intuitionistic fuzzy sets based on intuitionistic fuzzy inclusion measure. Examples are given to illustrate our notion and the application of this new similarity measure in multi-criteria decision making.
Keywords
Introduction
Similarity is a core element in achieving an understanding of variables that motivate behavior and mediate affect. The concept of similarity measure is used in a variety of scientific fields such as decision making, pattern recognition, machine learning and market prediction. In mathematics, geometric methods for assessing similarity are used in studies of congruence as well as in allied fields such as trigonometry. Topological methods are applied in fields such as semantics. Graph theory is widely used for assessing cladistic similarities in taxonomy. Fuzzy set theory [48] has also developed its own measures of similarity, which find application in areas such as management, medicine and meteorology [4, 17]. The comparisons of different fuzzy similarity measures as well as their aggregations have been studied by Beg and Ashraf [12, 13], Dengfeng and Chuntian [24], Fonck et al. [29], Wang et al. [45], Xu and Xia [47] and Zwick et al. [50]. Cross and Sudkamp [22] gave a notion of similarity by defining fuzzy valued assessment of the similarity of fuzzy sets over auniverse X . Theoretical and computational properties of the measures was further investigated with the relationships between them [43]. A review, or even a listing of all these similarity measures is impossible. Similarity also plays a key role in the modelling of preference and liking for products or brands, as well as motivations for product consumption. Atanassov [5, 6] introduced the notion of intuitionistic fuzzy set, which is a generalization of fuzzy set and it enriches fuzzy set theory with a notion of indeterminacy expressing hesitation or abstention. Dubois et al. [27] pointed some terminological difficulties in fuzzy set theory and intuitionistic fuzzy set theory in their remarkable paper. Intuitionistic fuzzy set theory has been further extended by several authors, Ban [10] gave the theory of intuitionistic fuzzy measure and its applications. Atanassove [7] in his book gave the detailed survey on the theory and applications of intuitionistic fuzzy set theory and also described new directions and research problems. Measures and integrals for the case of intuitionistic fuzzy sets was formulated in [9] but the concept of similarity measure between any two intuitionistic fuzzy sets based on intuitionistic fuzzy inclusion measure is not introduce so far. Intuitionistic fuzzy sets has been widely applied to decision making problems [15, 39]. One of the important measure amongst intuitionistic fuzzy sets is the measure of the similarity between two intuitionistic fuzzy sets, for which several studies have been proposed in the literature. Several of these, however, cannot satisfy the axioms of similarity, and provide counter-intuitive cases [18, 24].
Fuzzy set theory has limitation for the modelling of group decision problems in which vagueness appear in the form of membership and non-membership degrees simultaneously. To overcome this problem, in this paper we propose an algorithm based on intuitionistic fuzzy sets and similarity measure introduced in Section 3. First we propose a method to define an intuitionistic fuzzy relation on a finite universe of discourse by using an intuitionistic triangular norm and an intuitionistic similarity measure between two intuitionistic fuzzy sets. This intuitionistic similarity measure is defined by using an intuitionistic inclusion measure and an intuitionistic fuzzy implication. Our proposed measure takes into account two kinds of distances- one membership and other nonmembership. The remainder of this paper is organized as follows. In Section 2, basic concept of fuzzy sets, t-norm and t-conorm are presented. An overview of intuitionistic fuzzy set, complement, intersection and union of intuitionistic fuzzy sets, intuitionistic fuzzy implications and intuitionistic fuzzy inclusions between intuitionistic fuzzy sets are also discussed. In Section 3, we introduced a notion of integral of intuitionistic fuzzy set, new intuitionistic fuzzy implicator, intuitionistic fuzzy inclusion measure and intuitionistic fuzzy similarity measure between intuitionistic fuzzy sets. In Section 4, we suggest a multi-criteria decision making (MCDM) algorithm of alternatives. Conclusion of paper is given in the last section.
Basic concepts
Afuzzy set [49] A in the universe X is a mapping from X to [0, 1] and A (x) is called the degree of membership of x in A for any x ∈X . A fuzzy binary relation R between two crisp sets, X and Y, is a fuzzy subset of X × Y . In this paper, X represents a crisp universe of generic elements.
T (1, x) = x for all x ∈ X . (Boundary condition) T (x, y) = T (y, x) for all x, y ∈ X . (Commut-ativity) T (x, T (y, z)) = T (T (x, y) , z) for all x, y, z ∈ X . (Associativity) If w ≤ x and y ≤ z then T (w, y) ≤ T (x, z) for all w, x, y, z ∈ X . (Monotonicity)
To every t-norm T there corresponds a t-conorm S called the dual t-conorm, defined by: S (x, y) =1 - T (1 - x, 1 - y) .
Following are some popular choices for t-norms: The minimum operator M : M (x, y) = min(x, y) . The Lukasiewicz operator W : W (x, y) = max(x + y - 1, 0) . The product operator P : P (x, y) = xy .
The corresponding dual t-conorms are The maximum operator M∗ : M∗ (x, y) = max(x, y) . The bounded sum W∗ : W∗ (x, y) = min(x + y, 1) . The probabilistic sum P∗ : P∗ (x, y) = x + y - xy .
If for all x ∈ X, then the intuitionistic fuzzy set reduces to an ordinary fuzzy set.
An intuitionistic fuzzy set can be defined as a mapping from X to L∗ = {(x1, x2) in[0, 1] 2 | x1 + x2 ≤ 1} and is anintuitionistic fuzzy element. The collection of all the intuitionistic fuzzy sets in X is denoted by
Moreover, equipping L∗ with an ordering ≤ L ∗ defined as (x1, x2) ≤ L ∗ (y1, y2) ⇔ x1 ≤ y1 and x2 ≥ y2, (L∗, ≤ L ∗ ) assumes the structure of a complete, bounded lattice with greatest element 1 L ∗ = (1, 0) and smallest element 0 L ∗ = (0, 1) .
Equality =
L
∗
defined as (x1, x2) =
L
∗
(y1, y2) , ⇔x1 = y1 and x2 = y2 . The sup and inf operations on this lattice are derived from ≤
L
∗
as:
If for all x ∈ X then
If for all x ∈ X then
The intersection is defined by
The union is defined by
The complement is defined by , for all x = (x1, x2) ∈ L∗,
Following mappings and are intuitionistic Min t-norm and Max t-conorm:
Following mappings and are intuitionistic Lukasiewicz t-norm and t-conorm: = (max (0, x1 + y1 - 1) , min (1, x2 + 1 - y1, y2 + 1 - x1)),
y1 + 1 - x2) , max(0, x2 + y2 - 1)) ,
where x = (x1, x2) , y = (y1, y2) and x, y ∈ L∗ .
The greatest intuitionistic t-norm with respect to the ordering ≤ L ∗ is , while the smallest intuitionistic t-conorm with respect to ≤ L ∗ is .
Intuitionistic t-norms and intuitionistic t-conorms can be partitioned into two classes by the following:
An intuitionistic t-norm on L∗ (resp. intuitionistic t-conorm ) is called representable if there exists a t-norm T and its corresponding dual t-conorm S on [0, 1] (resp. a t-conorm S′ and its corresponding dual t-norm T′ on [0, 1]) such that, for x = (x1, x2) , y = (y1, y2) ∈ L∗, ); T and S (resp. S′ and T′) are called the representants of (resp. ). Clearly, intuitionistic Min t-norm and intuitionistic Max t-conorm are representable.
New concepts; integral, implication, inclusion and similaritymeasure of intuitionistic fuzzy sets
Up till now there does not exist a valid, general-purpose definition of similarity measure. There do exist several special-purpose definitions which have been employed with success in cluster analysis [31, 33], search [2, 3], classification [11, 35], recognition [28, 36] and diagnostics [1, 34]. In this section, first we give a notion of integral of intuitionistic fuzzy sets and then propose a new form of intuitionistic fuzzy implication, inclusion and give a similarity measure.
a1 ≤ b1 and b2 ≤ a2
a1 ≥ b1 and b2 ≥ a2
We define intuitionistic product t-norm and its respective intuitionistic product t-conorm as:
Intuitionistic fuzzy sets and given in Examples 3.4 and 3.5 are comparable intuitionistic fuzzy sets.Membership and non-membership functions of and are bounded and continuous on X .
Bustince and Burillo [20] study the structure of intutitionistic fuzzy relations and characterized it according to the structure of fuzzy relations.
An intuitionistic fuzzy binary relation from X to X is called an intuitionistic fuzzy relation on X .
reflexive if and only if for all x∈ X ;
symmetric if and only if for all x, y∈ X ;
sup- transitive if and only if for all x, z ∈ X .
Let a = (a1, a2) and b = (b1, b2) be two comparable intuitionistic fuzzy elements then an intuitionistic fuzzy implicator is defined as;
Also is given below
Definition 2.6 is very strong because if there exists an x0 ∈ X such that and then even if for most elements of X, is very close to the Therefore, if X is a closed and bounded subset of set of real numbers we can improve this definition of intuitionistic fuzzy set inclusion on X to overcome this problem.
Intuitionistic fuzzy set inclusion for intuitionistic fuzzy sets and (from Example 3.4 and 3.5) by using Definition 3.10 is given below:
Above example clearly shows that our newly proposed Definition 3.10 is better then 2 for intuitionistic fuzzy set inclusion.
Next based on our concept of intuitionistic fuzzy set inclusion, we define the intuitionistic similarity measure between intuitionistic fuzzy sets.
if
if such that then and
Let (By Equation (3.3))
and (By definition of )
and for all x ∈ X (By Equation (3.2))
and for all x ∈ X
and
(By Equation (3.3))
(As is commutative)
As given
for all x ∈ X
for all x ∈ X(By definition of
(By Equation (3.2)) By equation (3.3), we know that As
for all x ∈ X
for all x ∈ X (By definition of
(By definition of
By Equation (3.3), we know that By Definition (2.5, 1), we can write that for all x ∈ X . So we can write that It implies that
Similarly, we can prove that □
The intuitionistic similarity measure between and depends on the degree to which is included and not included in and the degree to which is included and not included in
It shows that the degree of similarity and non-similarity between and is 0.562506 and 0.29325, respectively.
if and only if for all x∈ X ;
if and only if for all x ∈ X or for all x ∈ X.
Let
⇔ (By using lemma 3.13, 1)
for all x ∈ X
for all x ∈ X . Let
or
Case 1. Consider that
for all x ∈ X
for all x ∈ X . Case 2. Consider that
for all x ∈ X
for all x ∈ X .
for all x ∈ X . □
Real world decision problems are very complex due to the uncertainty in knowledge and modelling. Fuzzy set theory [49] has been successfully applied to handle vagueness and imprecision in an information and it was used to model linguistic terms in decision making problems [26, 44]. The use of linguistic information by experts is quite often in group decision making problems [14, 41]. But fuzzy set theory has limitation for the modelling of group decision problems in which vagueness appear in the form of membership and non-membership degrees simultaneously. To overcome this problem, here we propose an algorithm based on intuitionistic fuzzy sets and similarity measure introduced in Section 3. Multi-criteria group decision making problem for intuitionistic fuzzy sets was discussed in [8] based on intuitionistic fuzzy relations.
Suppose we have a set of n criteria and a set of m alternatives. If there is for each criteria an evaluation on each alternative, then we obtain an m × n evaluation matrix. In this matrix, each evaluation is a linguistic term. Our algorithm is based on three main steps: let SCE = {S1, S2, …, S
n
} be the set of scenarios, ACT = {a1, a2, …, a
m
} be the set of actors, n, m are natural numbers. To obtain an m × n evaluation matrix E whose each element E
ij
(i ∈ [1, m] , j ∈ [1, n]) is a linguistic term evaluation for scenario S
j
w.r.t. actor a
i
: Each E
ij
in this matrix is an intuitionistic fuzzy set on the universe of discourse. To obtain an n × n intuitionistic fuzzy relation matrix r whose each element (i, j ∈ [1, n]) is the degree to which (S
i
, S
j
) is the member of the intuitionistic fuzzy relation
is determined based on the similarities between the evaluations for S
i
and S
j
w.r.t. different actors: MCDM techniques can be used to partition SCE based on the n × n intuitionistic fuzzy relation matrix r [38, 46].
Choosing an intuitionistic similarity measure of two fuzzy sets plays an important role in the aforementioned algorithm. According to Equation (3.3) and definition 3.10, this depends on choosing a suitable intuitionistic fuzzy implication.
Thus, it is shown that the degree of relationship and non-relationship between two policies, p1 and p2 is 0.3164 and 0.5005, respectively.
We defined an intuitionistic fuzzy inclusion on the universe of discourse {x} based on an Intuitionistic fuzzy implication There after, we introduced a general intuitionistic inclusion on a universe of discourse X and intuitionistic similarity measure between two intuitionistic fuzzy sets on X . Using this a decision making method has been developed that is capable of dealing with comparative linguistic expressions based on intuitionistic fuzzy sets. Examples have been given to illustrate the concept of intuitionistic fuzzy sets, intuitionistic similarity between two intuitionistic fuzzy sets, and intuitionistic fuzzy relation based on intuitionistic similarity between two intuitionistic fuzzy sets. An algorithm is described to make a MCDM method. In Step 2 of this algorithm, we have to obtain an intuitionistic fuzzy relation on the universe of discourse which is defined by the intuitionistic product t-norm and the intuitionistic similarity between two intuitionistic fuzzy sets. It is shown that to choose a suitable intuitionistic similarity between two intuitionistic fuzzy sets in this step depends on choosing a suitable intuitionistic fuzzy implication because of Lemma 3.13 and Definition 3.10. A simple example is constructed to show the usefulness of the method proposed.
Acknowledgements
The authors would like to thank the editors and the anonymous reviewers, whose insightful comments and constructive suggestions helped us to significantly improve the quality of this paper.
