Abstract
In this paper, a single-granulation dual hesitant fuzzy rough set model based on dual hesitant fuzzy tolerance relations is first introduced. By the combination of multi-granulation rough sets and the single-granulation dual hesitant fuzzy rough sets, we then develop a new multi-granulation rough set model, called a multi-granulation dual hesitant fuzzy rough set. In the multi-granulation framework, two types of multi-granulation dual hesitant fuzzy rough sets are proposed, which are named the optimistic multi-granulation dual hesitant fuzzy rough sets and pessimistic multi-granulation dual hesitant fuzzy rough sets. Finally, the relationships among the single-granulation dual hesitant fuzzy rough sets, optimistic multi-granulation dual hesitant fuzzy rough sets and pessimistic multi-granulation dual hesitant fuzzy rough sets are investigated.
Keywords
Introduction
Rough set theory, introduced by Pawlak [25, 26], is a new mathematical approach to cope with imprecision and uncertainty in data analysis, and can be regarded as a valid means of granular computing [27]. In Pawlak’s rough set model, a key and primitive notion is equivalence relation. However, the equivalence relation is a very stringent condition which limits the application of rough sets. Therefore, by replacing the equivalence relation with other binary relations, such as dominance, fuzzy, interval-valued fuzzy, intuitionistic fuzzy, hesitant fuzzy and interval-valued hesitant fuzzy, lots of researchers have proposed many new rough sets model [4, 61–63]. In recent years, from the perspective of granular computing, the generalization of Pawlak’s rough set model has become a new research focus. Since Qian and Liang [28] introduced multi-granulation rough set (MGRS) theory, lots of fruitful results about MGRS theory have been achieved [7, 52].
As one of the extensions of Zadeh’s fuzzy set [60], hesitant fuzzy (HF) set theory, initiated by Torra [36, 37], permits the membership degree of an element to a set having several possible values, and can express the hesitant information more comprehensively than other extensions of fuzzy set. Since the appearance of hesitant fuzzy set, it has attracted more and more scholars’ attention [2, 61]. Dual hesitant fuzzy (DHF) set, introduced by Zhu et al. [53], is a comprehensive set encompassing fuzzy sets, intuitionistic fuzzy sets [1], hesitant fuzzy sets, and fuzzy multisets [23] as special cases. Unlike a hesitant fuzzy set, a dual hesitant fuzzy set gives both membership degrees and nonmembership degrees which are respectively represented by two sets of possible values. By several possible values for the membership and nonmembership degrees, dual hesitant fuzzy sets are more objective than hesitant fuzzy sets to describe the vagueness of data or information. More recently, many authors have developed multiple attribute decision-making theories and methods under dual hesitant fuzzy environment. For example, Wang et al. [38] investigated the multiple attribute decision making problem based on the aggregation operators with dual hesitant fuzzy information. Ye [49] and Chen [3] proposed some correlation coefficient formulas for dual hesitant fuzzy sets and applied them to multiple attribute decision making under dual hesitant fuzzy environment. Meantime, Farhadinia [6] also presented an approach for deriving the correlation coefficient of dual hesitant fuzzy sets, and gave a practical example to illustrate the application of correlation coefficient for dual hesitant fuzzy sets in medical diagnosis.
It is well known that the combination of rough sets and other uncertain theories has always been a research hotspot. By integrating HF sets with rough sets, Yang et al. [50] first proposed the concept of hesitant fuzzy rough sets, and investigated an axiomatic approach of this model. The purpose of this paper is first to extend hesitant fuzzy rough sets into dual hesitant fuzzy environment and propose a dual hesitant fuzzy rough set model, called the single-granulation dual hesitant fuzzy rough set (SGDHFRS) from the perspective of granular computing. Furthermore, inspired by Qian et al.’s work, we then generalize the SGDHFRS to multi-granulation environment by the combination of DHF set theory and MGRS, and construct two types of multi-granulation dual hesitant fuzzy rough set (MGDHFRS) models in which set approximations are described by multiple DHF tolerance relations.
The rest of the paper is organized as follows. The next section reviews the basic concepts considered in the study. In Section 3, SGDHFRS theory is proposed and some properties of this model are examined.Section 4 introduces two types of MGDHFRS models in which set approximations are described by multiple DHF tolerance relations. And some of their properties are discussed. In Section 5, we establish the relationships among SGDHFRS, the optimistic MGDHFRS and pessimistic MGDHFRS. Finally, we conclude the paper in Section 6.
Preliminaries
In this section, we briefly recall the concepts of HF sets and DHF sets.
Hesitant fuzzy sets
Torra and Narukawa [36] and Torra [37] firstly proposed the concept of hesitant fuzzy sets defined as follows:
To be easily understood, Xia and Xu [41] denoted the HF set by a mathematical symbol:
For convenience, Xia and Xu [41] called a HF element, and denoted the set of all HF sets on U by HF (U).
Dual hesitant fuzzy sets
As an extension of hesitant fuzzy sets, dual hesitant fuzzy sets are defined by Zhu et al. [53] as follows.
For convenience, the pair is called a DHF element denoted by d = (h, g). The set of all DHF sets on U is denoted by DHF (U).
Here, we introduce several special DHF sets as follows: ,
1. is referred to as an empty DHF set if and only if and for all x ∈ U. In this paper, the empty DHF set is denoted by ∅.
2. is referred to as a full DHF set if and only if and for all x ∈ U. In this paper, the full DHF set is denoted by .
It’s worth noting that the number of values in different DHF elements may be different and the values of DHF elements are usually given in a disorder. Suppose that and stand for the number of values in and , respectively. To operate correctly, Ye [49] and Chen [3] gave the following assumptions:
(A1) For a DHF set , let σ : (1, 2, ⋯ , n) ⟶ (1, 2, ⋯ , n) be a permutation satisfying for s = 1, 2, …, n - 1, and be the sth largest value in ; let σ : (1, 2, ⋯ , m) ⟶ (1, 2, ⋯ , m) be a permutation satisfying for t = 1, 2, …, m - 1, and be the tth largest value in .
(A2) For two DHF sets and , when , , one can make them have the same number of elements by adding some elements to the DHF element which has less number of elements. In terms of the pessimistic principle, the smallest element will be added while in the opposite case, the optimistic principle may be adopted. In the present work, we use the latter case. Therefore, if , then should be extended by adding the maximum value in it until it has the same length as ; if , then should be extended by adding the maximum value in it until it has the same length as .
On the basis of the assumptions given by Ye [49] and Chen [3], we develop some new methods when operating the DHF elements, which are slightly different from the ones introduced by Farhadinia [6]. The adjusted operational laws are defined as follows.
(1) the complement of , denoted by , is given by
(2) the union of and , denoted by , is given by
(3) the intersection of and , denoted by , is given by
From Definition 2.5, we can easily verify that the following theorem holds.
In what follows, we first introduce the concept of the DHF subset as follows.
with 1 ≤ s ≤ k and 1 ≤ t ≤ l . We denote it by .
Obviously, we conclude that the following results hold: ,
That is, the notation ⊑ is reflexive, transitive and antisymmetric on DHF(U).
Single-granulation dual hesitant rough sets in the HF tolerance approximation space
Inspired by the concept of the HF relation in [50], we will further extend the HF relation into DHF environment and first introduce the concept of a DHF relation as follows.
where are two sets of some values in [0,1], denoting the possible membership degrees and non-membership degrees of the relationships between x and y respectively, with the conditions: 0 ≤ γ, η ≤ 1 and 0 ≤ γ + + η + ≤ 1, where for all (x, y) ∈ U × V, .
In particular, if U = V, we call a DHF relation on U. In what follows several special DHF relations are introduced as follows.
If a DHF relation on U is reflexive and symmetric, it is called a DHF tolerance relation on U.
Based on the above DHF relation, lower and upper DHF approximation operators are defined asfollows.
and are, respectively, called the single-granulation lower and upper approximations of with respect to . The pair is called a SGDHFRS of with respect to , and are referred to as single granulation lower and upper DHF rough approximation operators, respectively.
Clearly, the above definition implies the following equivalent forms:
(1) Since is a DHF tolerance relation, then ∀x ∈ U, there are and . From Equation (1), we have
On the other hand,
From the above discussions, we conclude that
(3) According to Definitions 3.3, we obtain
(5) The conclusion is straightforward by Equation (1). On the other hand, since is a DHF tolerance relation, then ∀x ∈ U, there are and . By Equation (2), we obtain
On the other hand, we have
From the above discussions, we conclude that □
(1) By virtue of Equation (1), we have
On the other hand,
From the above discussions, we conclude that the result (1) holds.
(3) Since , for all y
j
∈ U, then there are and . So it follows that
(5) It can be directly followed from the above result (3). □
In this section, we extend Qian et al.’s MGRS and Huang et al.’s IFMGRS theory into dual hesitant fuzzy environment. Meanwhile, we also generalize SGDHFRSs proposed in Section 3 to multi-granulation environment and propose MGDHFRSs in a DHF tolerance approximation space. Following the lines of Qian et al.’s MGRS model, we shall also present two types of MGDHFRSs induced by multiple DHF tolerance relations.
The optimistic multi-granulation dual hesitant fuzzy rough set in the DHF tolerance approximation space
The pair is called an optimistic MGDHFRS of with respect to . If , then is referred to as optimistic-definable in ; otherwise, is referred to as optimistic-undefinable in .
In that case, the optimistic MGDHFRSs become the SGDHFRSs in Definition 3.3, which indicates that SGDHFRSs are a special type of optimistic MGDHFRSs.
In that case, the optimistic MGDHFRSs convert into the optimistic IFMGRSs proposed by Huang et al. [7], which implies that the optimistic IFMGRSs are a special case of optimistic MGDHFRSs.
Let
Then by Definition 3.3, the single-granulation hesitant fuzzy lower and upper approximations of on fuzzy tolerance relations and can be calculated as follows, respectively:
On the other hand, according to Definition 4.1, we compute the optimistic multi-granulation dual hesitant fuzzy lower and upper approximations of on dual hesitant fuzzy tolerance relations and as follows:
Consequently, we can draw the conclusion that
In what follows we will establish the relationship between the optimistic MGDHFRSs and SGDHFRSs.
Meanwhile, we obtain
From the above discussions, we conclude that
(2) For all x ∈ U, according to Theorems 4.6, 3.5 and Definition 2.5, we have
On the other hand,
From the above discussions, we conclude that
(3) Since , by Theorem 3.5, then , which implies that and for x ∈ U. Then and . Hence, for all x ∈ U, there are and . According to Theorem 4.6, 3.5, we conclude that
(4) It is similar to the proof of the result (3).
(5) and (6) can be obtained from the conclusions (3) and (4), respectively. □
Theorem 4.8 states the basic properties about the optimistic multi-granulation DHF lower and upper approximations of two different concepts. Properties (1) and (2) say that the optimistic multi-granulation DHF lower approximation is included into the intersection of the two optimistic multi-granulation DHF lower approximations, while the optimistic multi-granulation DHF upper approximation includes the union of the two optimistic multi-granulation DHF upper approximations. Properties (3) and (4) show the monotone of the optimistic multi-granulation DHF lower and upper approximations with respect to the variety of the target concept. Meanwhile, it’s worthy noting that properties (1) and (2) in Theorem 4.8 are different from the ones in Theorem 3.5 which satisfy the multiplicativity and additivity.
The pair is called a pessimistic MGDHFRS of with respect to . If , then is referred to as pessimistic-definable in ; otherwise, is referred to as pessimistic-undefinable in .
In that case, the pessimistic MGDHFRSs become the SGDHFRSs in Definition 3.3, which indicates that SGDHFRSs are a special type of pessimistic MGDHFRSs.
In that case, the pessimistic MGDHFRSs convert into the pessimistic IFMGRSs proposed by Huang et al. [7], which implies that the pessimistic IFMGRSs are a special case of pessimistic MGDHFRSs.
Hence, we see that
In what follows we establish the relationship between the pessimistic MGDHFRSs and SGDHFRSs in Section 3, and investigate the properties of the pessimistic MGDHFRSs.
(1) For all x ∈ U, by virtue of Theorems 4.14, 3.5 and Definition 2.5, we have
From the above discussions, we conclude that
(2) For all x ∈ U, according to Theorems 4.2, 3 and Definition 2.2, we obtain
From the above discussions, we deduce that □
Theorem 4.16 states the basic properties about the pessimistic multi-granulation DHF lower and upper approximations of two different concepts. Properties (1) and (2) explain that the pessimistic multi-granulation DHF lower approximation is equal to the intersection of the two pessimistic multi-granulation DHF lower approximations, and the pessimistic multi-granulation DHF upper approximation is equivalent to the union of the two pessimistic multi-granulation DHF upper approximations. Properties (3) and (4) show the monotone of pessimistic multi-granulation DHF lower and upper approximations with respect to the variety of the target concept. Meanwhile, it should be noted that properties (1) and (2) in Theorem 4.16 are different from the ones in Theorem 4.8 which don’t satisfy the multiplicativity and additivity.
In the above section, we mainly discuss the properties of the optimistic and pessimistic MGDHFRSs. In this section, the relationships among SGDHFRS, the optimistic MGDHFRS and pessimistic MGDHFRS will be further established.
On the other hand,
From the above discussions, it follows that
(2) It is similar to the proof of the conclusion (1).
(3) For all x ∈ U, from Equation (1), we obtain
On the other hand,
Therefore, we conclude that
(4) It is similar to the proof of the conclusion (3). □
Theorem 5.1 states the relationship between the optimistic MGDHFRS and the SGDHFRS, and also reflects the connection between the pessimistic MGDHFRS and the SGDHFRS.
In what follows we will establish the relationship among SGDHFRS, optimistic MGDHFRS and pessimistic MGDHFRS.
Conclusion
DHF sets and rough sets are two new mathematical approaches to cope with imprecision and uncertainty in data analysis. Although lots of fruitful results about DHF sets and rough sets have been achieved, little attention has been paid to the research of combining DHF sets and rough sets. The novelty of the current paper lies in two aspects. On one hand, by combining DHF set theory and rough sets we first introduce a single-granulation dual hesitant fuzzy rough set model. On the other hand, the single-granulation dual hesitant fuzzy rough set is extended to multi-granulation environment, and a new multi-granulation rough set model, called a MGDHFRS, is proposed. By investigating the properties of MGDHFRSs, we conclude that many existing MGRS models are special types of MGDHFRS models, such as MGRSs [28], MGFRSs in a fuzzy tolerance approximation space [42] and IFMGRSs [7]. Since the presented MGDHFRS includes both ingredients of DHF sets and rough sets, it is more effective and flexible than both DHF sets and rough sets to handle imprecise and imperfect information. Therefore, the research about the applications of the presented MGDHFRS is very important and necessary to us.
In the future, the application of the presented MGDHFRS is the main research direction considered by our group. We also believe that the presented MGDHFRS is of great practical value in many applications.
Acknowledgments
The authors would like to thank the anonymous referees for their valuable comments and suggestions. This work is supported by the National Natural Science Foundation of China (No. 11461082) and the Research Project Funds for Higher Education Institutions of Gansu Province (No. 2015B-006).
