**1. Introduction**

Rough set theory was proposed by Pawlak [1,2] in 1982 as a tool to conceptualize, organize and analyze various types of data in data mining. There are other generalizations of his original concepts, for example by general binary relations [3], multi-granulations [4] and coverings [5]. Aiming at covering-based rough sets [6,7], they have been applied to decision rule synthesis [8,9], knowledge reduction [10,11] and other fields [12,13]. In theory, covering-based rough set theory has been connected with other theories. For example, it has been connected with lattice theory [14,15], matroid theory [16,17] and fuzzy set theory [18–23].

Zadeh's fuzzy set theory [24] addresses the problem of how to understand and manipulate imperfect knowledge. Recent investigations have shown that rough set and fuzzy set theories can be combined into various models, which are used for incomplete information in information systems. Dübois and Prade [25] first presented a fuzzy rough set model. Based on their work, some extended models and corresponding applications have been investigated in [26,27]. As far as fuzzy covering rough sets, D'eer et al. [28] discussed some fuzzy covering-based rough set models. Ma [18] proposed two new types of fuzzy covering rough set models. Inspired by Ma's work, Yang and Hu [29] investigated some types of fuzzy covering-based rough sets. Then, Yang and Hu studied other problems in fuzzy covering-based rough sets [30].

Intuitionistic fuzzy set (IFS) theory, as a straightforward extension of fuzzy set theory, was proposed by Atanassov [31]. The combination of IFS and rough set theories has attracted more interesting studies. For example, Zhang et al. [32] studied a general frame of IF rough sets. Huang et al. [33] presented an IF rough set model by combining *β*-neighborhoods induced by an IF *β*-covering. There are also other new notions and properties in Huang et al.'s IF rough set model, so it is necessary to investigate the IF rough set model further in this paper.

Recently, many researchers have studied decision making problems by rough set models [19,34], especially multiple criteria group decision making [20,23]. Multiple criteria group decision making (MCGDM) involves ranking from all feasible alternatives in conflicting and interactive criteria. After presenting the IF covering rough set model, Huang et al. also defined an optimistic multi-granulation IF rough set model. By investigation, multi-granulation IF rough set models have not been used for MCGDM problems. According to the characterizations of MCGDM problems, we construct the multi-granulation IF decision information systems and present a novel approach to MCGDM problems based on the optimistic multi-granulation IF rough set model in this paper.

The rest of this paper is organized as follows. Section 2 recalls some notions about covering-based rough sets and intuitionistic fuzzy sets. In Section 3, some properties of IF *β*-covering approximation space are investigated further. In Section 4, we investigate two IF covering rough set models. Among these two models, one is presented by Huang et al. [33], which concerns the IF sets; and the other is proposed by us, which concerns the crisp sets in an IF environment. In Section 5, we present a novel approach to MCGDM problems based on Huang et al.'s optimistic multi-granulation IF rough set model. This paper is concluded and further work is indicated in Section 6.

## **2. Basic Definitions**

This section reviews some fundamental notions related to covering-based rough sets and intuitionistic fuzzy sets. Suppose *U* is a nonempty and finite set called a universe.

**Definition 1.** *(Covering [35,36]) Let U be a universe and C a family of subsets of U. If none of the subsets in C are empty and* A *C* = *U, then C is called a covering of U.*

**Definition 2.** *(Neighborhood [35]) Let C be a covering of U. For any x* ∈ *U,*

$$N\_{\mathbf{C}}(\mathbf{x}) = \bigcap \{ \mathbf{K} \in \mathbf{C} : \mathbf{x} \in \mathbf{K} \},$$

*is called the neighborhood of x with respect to C. When the covering is clear, we omit the lowercase C in the neighborhood.*

**Definition 3.** *(Approximation operators [37]) Let C be a covering of U. For any X* ⊆ *U,*

$$SH\_{\mathcal{C}}(X) = \{ \mathbf{x} \in \mathcal{U} : N(\mathbf{x}) \cap X \neq \mathcal{O} \},$$

$$SL\_{\mathcal{C}}(X) = \{ \mathbf{x} \in \mathcal{U} : N(\mathbf{x}) \subseteq X \}.$$

*SHC*(*X*) *and SLC*(*X*) *are called the upper and lower approximation operators with respect to C.*

**Definition 4.** *(Intuitionistic fuzzy set [31]) Let U be a fixed set. An intuitionistic fuzzy set (IFS) A in U is defined as:*

$$A = \{ \langle \mathbf{x}, \mu\_A(\mathbf{x}), \nu\_A(\mathbf{x}) \rangle : \mathbf{x} \in \mathcal{U} \},$$

*where μA* : *U* → [0, 1] *is called the degree of membership of the element x* ∈ *U to A and νA* : *U* → [0, 1] *is called the degree of non-membership. They satisfy μA*(*x*) + *<sup>ν</sup>A*(*x*) ≤ 1 *for all x* ∈ *U. The family of all intuitionistic fuzzy sets in U is denoted by IF*(*U*)*.*

We call *a*, *b* with 0 ≤ *a*, *b* ≤ 1 and *a* + *b* ≤ 1 an IF value. As is well known, for two IF values *α* = *a*, *b* and *β* = *c*, *d*, *α* ≤ *β* ⇔ *a* ≤ *c* and *b* ≥ *d*.

For any family *γi* ∈ [0, 1], *i* ∈ *I*, *I* ⊆ N<sup>+</sup> (N<sup>+</sup> is the set of all positive integers), we write ∨*i*∈*Iγ<sup>i</sup>* for the supremum of {*<sup>γ</sup>i* : *i* ∈ *I*} and ∧*i*∈*Iγ<sup>i</sup>* for the infimum of {*<sup>γ</sup>i* : *i* ∈ *<sup>I</sup>*}. Some basic operations on *IF*(*U*) are shown as follows [31]: for any *A*, *B* ∈ *IF*(*U*),


#### **3. Some Properties of IF** *β***-Covering Approximation Space**

In this section, we introduce the notions of intuitionistic fuzzy (IF) *β*-covering approximation space. There are two concepts presented by Huang et al. in [33], which are IF *β*-covering and IF *β*-neighborhood in this approximation space. We mainly investigate some of their properties, and some new notions are presented.

#### *3.1. IF β-Neighborhood and IF β-Neighborhood System*

**Definition 5.** *([33]) Let U be a universe and β* = *a*, *b be an IF value. Then, we call C*F = {*<sup>C</sup>*1, *C*2, ..., *Cm*}*, with Ci* ∈ *IF*(*U*)(*i* = 1, 2, ..., *<sup>m</sup>*)*, an IF β-covering of U, if for any x* ∈ *U, there exists Ci* ∈ *C*F*, such that Ci*(*x*) ≥ *β. We also call* (*<sup>U</sup>*,*C*<sup>F</sup>) *an IF β-covering approximation space.*

Let Γ*β* = {**C** P1, **C** P2, ··· , **C** P*<sup>n</sup>*}. If any **C**F*i* (*i* = 1, 2, ..., *n*) is an IF *β*-covering of *U*, then we call (*<sup>U</sup>*, <sup>Γ</sup>*β*) a *n*-IF *β*-covering approximation space.

**Definition 6.** *([33]) Let C*F *be an IF β-covering of U and C*F = {*<sup>C</sup>*1, *C*2, ... , *Cm*}*. For each x* ∈ *U, the IF β-neighborhood N<sup>β</sup> x of x induced by C*F *can be defined as:*

$$
\widehat{\mathsf{N}}\_{\mathfrak{x}}^{\beta} = \cap \{ \mathsf{C}\_{i} \in \widehat{\mathsf{C}} : \mathsf{C}\_{i}(\mathfrak{x}) \ge \beta \}.
$$

Note that *Ci*(*x*) is an IF value *μCi* (*x*), *<sup>ν</sup>Ci* (*x*) in Definitions 5 and 6. Hence, *Ci*(*x*) ≥ *β* means *μCi*(*x*) ≥ *a* and *<sup>ν</sup>Ci*(*x*) ≤ *b* where IF value *β* = *a*, *b*.

**Remark 1.** *Let C*F *be an IF β-covering of U, β* = *a*, *b and C*F = {*<sup>C</sup>*1, *C*2,..., *Cm*}*. For each x* ∈ *U:*

$$
\widetilde{\mathcal{N}}\_x^\beta = \cap \{ \mathcal{C}\_i \in \widehat{\mathcal{C}} : \mu\_{\mathcal{C}\_i}(x) \ge a, \,\nu\_{\mathcal{C}\_i}(x) \le b \}.
$$

**Example 1.** *Let U* = {*<sup>x</sup>*1, *x*2, *x*3, *x*4, *<sup>x</sup>*5} *and C*F = {*<sup>C</sup>*1, *C*2, *C*3, *<sup>C</sup>*4}*, where:*

$$\begin{aligned} \mathbf{C}\_{1} &= \frac{(0.7,0.2)}{\mathbf{x}\_{1}} + \frac{(0.5,0.3)}{\mathbf{x}\_{2}} + \frac{(0.4,0.5)}{\mathbf{x}\_{3}} + \frac{(0.6,0.1)}{\mathbf{x}\_{4}} + \frac{(0.3,0.2)}{\mathbf{x}\_{5}}}{\mathbf{x}\_{6}}, \\ \mathbf{C}\_{2} &= \frac{(0.6,0.2)}{\mathbf{x}\_{1}} + \frac{(0.3,0.2)}{\mathbf{x}\_{2}} + \frac{(0.2,0.3)}{\mathbf{x}\_{3}} + \frac{(0.4,0.5)}{\mathbf{x}\_{4}} + \frac{(0.7,0.3)}{\mathbf{x}\_{5}}}{\mathbf{x}\_{6}}, \\ \mathbf{C}\_{3} &= \frac{(0.4,0.1)}{\mathbf{x}\_{1}} + \frac{(0.4,0.5)}{\mathbf{x}\_{2}} + \frac{(0.5,0.2)}{\mathbf{x}\_{3}} + \frac{(0.3,0.6)}{\mathbf{x}\_{4}} + \frac{(0.6,0.3)}{\mathbf{x}\_{5}}}{\mathbf{x}\_{6}}, \\ \mathbf{C}\_{4} &= \frac{(0.1,0.5)}{\mathbf{x}\_{1}} + \frac{(0.6,0.1)}{\mathbf{x}\_{2}} + \frac{(0.6,0.3)}{\mathbf{x}\_{3}} + \frac{(0.5,0.3)}{\mathbf{x}\_{4}} + \frac{(0.8,0.1)}{\mathbf{x}\_{5}}. \end{aligned}$$

*According to Definition 5, we know C* F *is an IF β-covering of U (β* = *a*, *b with* 0 ≤ *a* ≤ 0.6, 0.3 ≤ *b* ≤ 1*). Let β* = 0.5, 0.3*. Then, the IF β-neighborhoods are shown as follows:*

*N β x*1 = *C*1 ∩ *C*2 = (0.6,0.2) *x*1 + (0.3,0.3) *x*2 + (0.2,0.5) *x*3 + (0.4,0.5) *x*4 + (0.3,0.3) *x*5 , *N β x*2 = *C*1 ∩ *C*4 = (0.1,0.5) *x*1 + (0.5,0.3) *x*2 + (0.4,0.5) *x*3 + (0.5,0.3) *x*4 + (0.3,0.2) *x*5 , *N β x*3 = *C*3 ∩ *C*4 = (0.1,0.5) *x*1 + (0.4,0.5) *x*2 + (0.5,0.3) *x*3 + (0.3,0.6) *x*4 + (0.6,0.3) *x*5 , *N β x*4 = *C*1 ∩ *C*4 = (0.1,0.5) *x*1 + (0.5,0.3) *x*2 + (0.4,0.5) *x*3 + (0.5,0.3) *x*4 + (0.3,0.2) *x*5 , *N β x*5 = *C*2 ∩ *C*3 ∩ *C*4 = (0.1,0.5) *x*1+ (0.3,0.5) *x*2+ (0.2,0.3) *x*3+ (0.3,0.6) *x*4+ (0.6,0.3) *x*5

**Theorem 1.** *([33]) Let C* F *be an intuitionistic fuzzy β-covering of U and C* F = {*<sup>C</sup>*1, *C*2, ... , *Cm*}*. Then, the following statements hold:*

 .


For two different IF *β*-neighborhoods, a relationship between them is presented.

**Proposition 1.** *Let C* F *be an IF β-covering of U. For any x*, *y* ∈ *U, N β x* (*y*) ≥ *β if and only if N β y* ⊆ *N β x .*

**Proof.** Suppose the IF value *β* = *a*, *b*. (⇒): Since *N β x* (*y*) ≥ *β*, so

$$\mu\_{\widetilde{\mathcal{M}}\_{\mathbf{z}}^{\delta}}(y) = \mu\_{\bigcap\_{\substack{\boldsymbol{\mathcal{O}}\_{\mathbf{c}}(\mathbf{x}) \geq \mathbf{z} \\ \boldsymbol{\mathsf{v}}\_{\mathbf{c}}(\mathbf{x}) \leq b \end{subarray}} \mathsf{C}\_{\mathbf{i}}(y) = \bigwedge\_{\substack{\boldsymbol{\mu}\_{\mathbf{C}\_{i}}(\mathbf{x}) \geq \mathbf{z} \\ \boldsymbol{\mu}\_{\mathbf{C}\_{i}}(\mathbf{x}) \leq b \end{subarray}} \mu\_{\mathbf{C}\_{i}}(y) \geq \mu\_{\boldsymbol{\nu}} \mathsf{V}\_{\widetilde{\mathcal{M}}\_{\mathbf{z}}^{\delta}}(y) = \nu\_{\underset{\substack{\boldsymbol{\mathcal{O}}\_{\mathbf{c}}(\mathbf{x}) \geq \mathbf{z} \\ \boldsymbol{\mu}\_{\mathbf{C}\_{i}}(\mathbf{x}) \geq \mathbf{z} \\ \boldsymbol{\mu}\_{\mathbf{C}\_{i}}(\mathbf{x}) \leq b}} \mathsf{C}\_{\mathbf{i}}(y) = \bigvee\_{\substack{\boldsymbol{\mathcal{O}}\_{\mathbf{c}}(\mathbf{x}) \geq \mathbf{z} \\ \boldsymbol{\mu}\_{\mathbf{C}\_{i}}(\mathbf{x}) \leq b \end{subarray}} \mathsf{C}\_{\mathbf{i}}(y) = \bigvee\_{\substack{\boldsymbol{\mathcal{O}}\_{\mathbf{c}}(\mathbf{x}) \geq \mathbf{z} \\ \boldsymbol{\mu}\_{\mathbf{C}\_{i}}(\mathbf{x}) \geq b \end{split}$$

Hence,

$$\{\mathbb{C}\_{i}\in\widehat{\mathbf{C}}:\mu\_{\mathbb{C}i}(\mathbf{x})\geq a,\nu\_{\mathbb{C}i}(\mathbf{x})\leq b\}\subseteq\{\mathbb{C}\_{i}\in\widehat{\mathbf{C}}:\mu\_{\mathbb{C}i}(\mathbf{y})\geq a,\nu\_{\mathbb{C}i}(\mathbf{y})\leq b\}.$$

Therefore, for each *z* ∈ *U*,

$$\begin{array}{c} \mu\_{\overline{N}\_{x}^{\beta}}(z) = \bigwedge\_{\mu\_{\underline{C}\_{i}}(x) \ge a} \mu\_{\underline{C}\_{i}}(z) \ge \bigwedge\_{\mu\_{\underline{C}\_{i}}(y) \ge a} \mu\_{\underline{C}\_{i}}(z) = \mu\_{\overline{N}\_{y}^{\beta}}(z), \\ \nu\_{\underline{V}\_{i}^{\beta}}(x) \le b \qquad \qquad \nu\_{\underline{C}\_{i}}(y) \le b \\ \nu\_{\overline{N}\_{x}^{\beta}}(z) = \bigvee\_{\mu\_{\underline{C}\_{i}}(x) \ge a} \nu\_{\underline{C}\_{i}}(z) \le \bigvee\_{\mu\_{\underline{C}\_{i}}(y) \ge a} \nu\_{\underline{C}\_{i}}(z) = \nu\_{\overline{N}\_{y}^{\beta}}(z). \end{array}$$

Hence, *N β y* ⊆ *N β x* .

(⇐): For any *x*, *y* ∈ *U*, since *N β y* ⊆ *N β x* , so *<sup>μ</sup>Nβx* (*y*) ≥ *<sup>μ</sup>Nβy* (*y*) ≥ *a*, *<sup>ν</sup>Nβx* (*y*) ≤ *<sup>ν</sup>Nβy* (*y*) ≤ *b*. Therefore *N β x* (*y*) ≥ *β*.

By the notion of IF *β*-neighborhood, we propose the following definition of the IF *β*-neighborhood system of *x* ∈ *U*.

**Definition 7.** *Let C* F *be an IF β-covering of U and C* F = {*<sup>C</sup>*1, *C*2, ... , *Cm*}*. For each x* ∈ *U, the IF β-neighborhood system* N Q*β C*F(*x*) *of x induced by C* F *is defined as:*

$$\overline{\mathcal{N}}\_{\widehat{\mathbb{C}}}^{\mathbb{A}}(\mathfrak{x}) = \{ \mathsf{C}\_{i} \in \widehat{\mathsf{C}} : \mathsf{C}\_{i}(\mathfrak{x}) \geq \beta \}.$$

According to Definition 6, we know *N β x* = ∩N Q*β* **C** F (*x*) for each *x* ∈ *U*. Let **C** P 1, **C** P 2 be two IF *β*-coverings of *U*. The statement does not hold: if N Q*β* **C** P 1 (*x*) = <sup>N</sup><sup>Q</sup>*β***C**<sup>P</sup>2 (*x*) for each *x* ∈ *U*, then **C**P1 = **<sup>C</sup>**<sup>P</sup>2. The following example can illustrate it.

**Example 2.** *(Continued from Example 1) Let β* = 0.5, 0.3*, C* P 1 = *C* F ∪ {*<sup>C</sup>*5}*, where C*5 = (0.2,0.5) *x*1 + (0.5,0.4) *x*2 + (0.4,0.6) *x*3 + (0.3,0.4) *x*4 + (0.3,0.5) *x*5 *. Then,* NQ*βC*F (*xi*) *and* <sup>N</sup><sup>Q</sup>*βC*<sup>P</sup>1(*xi*) *(i* = 1, 2, 3, 4, 5*) are listed in Table 1.*


**Table 1.** N Q*β* **C** F (*xi*) and <sup>N</sup><sup>Q</sup>*β***C**<sup>P</sup>1(*xi*) (*i* = 1, 2, 3, 4, 5).

*Hence,* N Q*β C* F (*xi*) = <sup>N</sup><sup>Q</sup>*βC*<sup>P</sup>1 (*xi*) *for any i* = 1, 2, 3, 4, 5*, but C*F = *<sup>C</sup>*<sup>P</sup>1*.*

Inspired by this statement, we consider in which conditions two IF *β*-coverings generate the same *β*-neighborhood system for any element of the universe. In order to find the conditions, we introduce two new concepts in IF *β*-covering approximation space firstly.

**Definition 8.** *Let C* F *be an IF β-covering of U and C* ∈ *C* F *. If there exists x* ∈ *U such that <sup>C</sup>*(*x*) ≥ *β, then C is called an IF β-dependent element of C* F *; otherwise, C is called an IF β-independent element of C* F *. If every element in C* F *is an IF β-dependent element, then C* F *is IF β-dependent; otherwise, C* F *is IF β-independent.*

**Example 3.** *(Continued from Example 2) Let β* = 0.5, 0.3*. Then, C*5 *is an IF β-independent element of C* P 1 *and Ci* (*i* = 1, 2, 3, 4) *are IF β-dependent elements of C* P 1*. Hence, C* P 1 *is IF β-independent and C* F *is IF β-dependent.*

**Proposition 2.** *Let C* F *be an IF β-covering of U and C* ∈ *C* F *. If C is an IF β-independent element of C* F *, then C* F − {*C*} *is still an IF β-covering of U.*

**Proof.** According to Definitions 5 and 8, it is straightforward.

**Proposition 3.** *Let C* F *be an IF β-covering of U, C be an IF β-independent element of C* F *and C*1 ∈ *C* F − {*C*}*. Then, C*1 *is an IF β-independent element of C* F *iff C*1 *is an IF β-independent element of C* F − {*C*}*.*

**Proof.** According to Definitions 5 and 8, it is straightforward.

According to Propositions 2 and 3, it is still an IF *β*-covering after deleting all IF *β*-independent elements of an IF *β*-covering.

**Definition 9.** *Let C* F *be an IF β-covering of U and B* F ⊆ *C* F *. If B* F *is the set of all IF β-dependent elements of C* F *, then B* F *is called the IF β-base of C* F *and is denoted as* <sup>Δ</sup>*β*(*C*<sup>F</sup>)*.*

**Proposition 4.** *Let C* F *be an IF β-covering of U. For any x* ∈ *U,*

$$
\overline{\mathcal{N}}\_{\widehat{\mathcal{C}}}^{\beta}(\mathfrak{x}) = \overline{\mathcal{N}}\_{\Delta^{\beta}(\widehat{\mathcal{C}})}^{\beta}(\mathfrak{x}).
$$

**Proof.** According to Definitions 8, 9 and Proposition 2, it is straightforward.

**Theorem 2.** *Let C* P 1*, C* P 2 *be two IF β-coverings of U. For any x* ∈ *U,*

$$
\widehat{\mathcal{N}}\_{\widehat{\mathcal{C}\_1}}^{\beta}(\mathfrak{x}) = \overline{\mathcal{N}}\_{\widehat{\mathcal{C}\_2}}^{\beta}(\mathfrak{x}) \text{ iff } \Delta^{\beta}(\widehat{\mathcal{C}\_1}) = \Delta^{\beta}(\widehat{\mathcal{C}\_2}).
$$

**Proof.** By Proposition 4 and Definition 7, it is straightforward.

**Corollary 1.** *Let C* P 1*, C* P 2 *be two IF β-coverings of U. For any x* ∈ *U, if* <sup>Δ</sup>*β*(*C*<sup>P</sup>1) = <sup>Δ</sup>*β*(*C*<sup>P</sup>2)*, then Nβx* = *N*<sup>Q</sup> *βx , where N β x and N* Q *β x are the β-neighborhoods induced by C* P 1 *and C* P 2*, respectively.*

**Proof.** According to Theorem 2, <sup>Δ</sup>*β*(**C**<sup>P</sup>1) = <sup>Δ</sup>*β*(**C**<sup>P</sup>2) ⇒ <sup>N</sup><sup>Q</sup>*β***C**<sup>P</sup>1 (*x*) = <sup>N</sup><sup>Q</sup>*β***C**<sup>P</sup>2 (*x*) ⇒ ∩N<sup>Q</sup>*β***C**<sup>P</sup>1 (*x*) = ∩N<sup>Q</sup>*β***C**<sup>P</sup>2 (*x*) ⇒ *N β x* = *N* Q *β x* .

*3.2. β-Neighborhood*

> In this subsection, the definition of *β*-neighborhood is presented by the IF *β*-neighborhood.

**Definition 10.** *Let* (*<sup>U</sup>*,*<sup>C</sup>* F ) *be an IF β-covering approximation space and C* F = {*<sup>C</sup>*1, *C*2, ... , *Cm*}*. For each x* ∈ *U, we define the β-neighborhood Nβx of x as:*

$$
\overline{N}\_x^\beta = \{ y \in \mathcal{U} : \tilde{N}\_x^\beta(y) \ge \beta \}.
$$

Note that *N β x* (*y*) is an IF value *μNβx* (*y*), *<sup>ν</sup>Nβx* (*y*) in Definition 10. Based on this, the *β*-neighborhood can be represented by the following remark.

**Remark 2.** *Let C* F *be an IF β-covering of U, β* = *a*, *b and C* F = {*<sup>C</sup>*1, *C*2,..., *Cm*}*. For each x* ∈ *U,*

$$\overline{N}\_x^\beta = \{ y \in \mathcal{U} : \mu\_{\overline{N}\_x^\beta}(y) \ge a, \nu\_{\overline{N}\_x^\beta}(y) \le b \}.$$

**Example 4.** *(Continued from Example 1) Let β* = 0.5, 0.3*, then we have:*

$$\begin{aligned} \overline{N}\_{x\_1}^{\mathfrak{f}} &= \{ \mathfrak{x}\_1 \}, \overline{N}\_{x\_2}^{\mathfrak{f}} = \{ \mathfrak{x}\_2, \mathfrak{x}\_4 \}, \overline{N}\_{x\_3}^{\mathfrak{f}} = \{ \mathfrak{x}\_3, \mathfrak{x}\_5 \}, \\ \overline{N}\_{x\_4}^{\mathfrak{f}} &= \{ \mathfrak{x}\_2, \mathfrak{x}\_4 \}, \overline{N}\_{x\_5}^{\mathfrak{f}} = \{ \mathfrak{x}\_5 \}. \end{aligned}$$

The following theorem shows the basic properties of *β*-neighborhoods.

**Theorem 3.** *Let C* F *be an IF β-covering of U and C* F = {*<sup>C</sup>*1, *C*2,..., *Cm*}*. Then:*


**Proof.** (1) According to the first statement in Theorem 1, we know *N β x* (*x*) ≥ *β* for each *x* ∈ *U*. Hence, *x* ∈ {*y* ∈ *U* : *N β x* (*y*) ≥ *β*} = *Nβx* for each *x* ∈ *U*. (2) For any *x*, *y*, *z* ∈ *U*, *x* ∈ *Nβy* ⇔ *Nβy* (*x*) ≥ *β* ⇔ *Nβx* ⊆ *Nβy* , and *y* ∈ *Nβz* ⇔ *Nβz* (*y*) ≥ *β* ⇔ *Nβy* ⊆ *Nβz* . Hence, *N β x* ⊆ *N β z* . By Proposition 1, we have *N β z* (*x*) ≥ *β*, i.e., *x* ∈ *Nβz* .

The following proposition shows a relationship between *Nβx* and *Nβy* .

**Proposition 5.** *Let C* F *be an IF β-covering of U and C* F = {*<sup>C</sup>*1, *C*2, ... , *Cm*}*. Then, for any x* ∈ *U, x* ∈ *Nβy iff Nβx* ⊆ *Nβy .*

**Proof.** (⇒): For any *z* ∈ *N<sup>β</sup> x* , we know *N<sup>β</sup> x* (*z*) ≥ *β*. Since *x* ∈ *N<sup>β</sup> y* , so *N<sup>β</sup> y* (*x*) ≥ *β*. According to (2) in Theorem 1, we have *N<sup>β</sup> y* (*z*) ≥ *β*. Hence, *z* ∈ *N<sup>β</sup> y* . Therefore, *N<sup>β</sup> x* ⊆ *N<sup>β</sup> y* . (⇐): According to (1) in Theorem 3, *x* ∈ *N<sup>β</sup> x* for all *x* ∈ *U*. Since *N<sup>β</sup> x* ⊆ *N<sup>β</sup> y* , so *x* ∈ *N<sup>β</sup> y* .

A relationship between IF *β*-neighborhoods and *β*-neighborhoods is proposed in the following proposition.

**Proposition 6.** *Let C*F *be an IF β-covering of U. For any x*, *y* ∈ *U, N<sup>β</sup> x* ⊆ *N<sup>β</sup> y iff N<sup>β</sup> x* ⊆ *N<sup>β</sup> y .*

**Proof.** For any *x*, *y* ∈ *U*, *N<sup>β</sup> x* ⊆ *N<sup>β</sup> y* ⇔ *N<sup>β</sup> y* (*x*) ≥ *β* ⇔ *x* ∈ *N<sup>β</sup> y* ⇔ *N<sup>β</sup> x* ⊆ *N<sup>β</sup> y* .

#### **4. Two Intuitionistic Fuzzy Covering Rough Set Models**

In this section, we investigate two IF covering rough set models on the basis of the IF *β*-neighborhoods and the *β*-neighborhoods, respectively. Firstly, one model is presented by Huang et al., and we study the properties of the IF lower and upper approximations of each IF set further. Secondly, we propose another new model, which concerns crisp sets in an IF environment. Moreover, some properties of the approximations are investigated. Finally, the relationships between these two IF covering rough set models with other rough set models are revealed.

*4.1. Characterizations of Huang et al.'s Intuitionistic Fuzzy Covering Rough Set Model*

Huang et al. [33] presented an IF covering rough set model.

**Definition 11.** *([33]) Let* (*<sup>U</sup>*,*C*<sup>F</sup>) *be an IF β-covering approximation space. For each A* ∈ *IF*(*U*) *where A* = {*<sup>x</sup>*, *μA*(*x*), *<sup>ν</sup>A*(*x*) : *x* ∈ *<sup>U</sup>*}*, we define the intuitionistic fuzzy (IF) covering upper approximation C*(*A*) *and lower approximation C* ∼(*A*) *of A as:*

$$
\begin{split}
\widehat{\mathsf{C}}(A) &= \{ \langle \mathsf{x}, \vee\_{\mathcal{Y} \in \mathcal{U}} [\mu\_{\overline{\mathsf{N}}\_{\mathtt{x}}^{\beta}}(\mathcal{y}) \wedge \mu\_{A}(\mathcal{y})], \wedge\_{\mathcal{Y} \in \mathcal{U}} [\nu\_{\overline{\mathsf{N}}\_{\mathtt{x}}^{\beta}}(\mathcal{y}) \vee \nu\_{A}(\mathcal{y})] \rangle : \mathtt{x} \in \mathsf{U} \}, \\
\mathsf{C}(A) &= \{ \langle \mathsf{x}, \wedge\_{\mathcal{Y} \in \mathcal{U}} [\nu\_{\overline{\mathsf{N}}\_{\mathtt{x}}^{\beta}}(\mathcal{y}) \vee \mu\_{A}(\mathcal{y})], \vee\_{\mathcal{Y} \in \mathcal{U}} [\mu\_{\overline{\mathsf{N}}\_{\mathtt{x}}^{\beta}}(\mathcal{y}) \wedge \nu\_{A}(\mathcal{y})] \rangle : \mathtt{x} \in \mathsf{U} \}.
\end{split}
$$

If **C**(*A*) = **C** ∼(*A*), then *A* is called the first type of IF covering rough set.

**Example 5.** *(Continued from Example 1) Let β* = 0.5, 0.3*, A* = (0.6,0.3) *x*1 + (0.4,0.5) *x*2 + (0.3,0.2) *x*3 + (0.5,0.3) *x*4 + (0.7,0.2) *x*5*.*

$$
\widetilde{\mathcal{C}}(A) = \{ \langle \mathbf{x}\_1, 0.6, 0.3 \rangle, \langle \mathbf{x}\_2, 0.5, 0.2 \rangle, \langle \mathbf{x}\_3, 0.6, 0.3 \rangle, \langle \mathbf{x}\_4, 0.5, 0.2 \rangle, \langle \mathbf{x}\_5, 0.6, 0.3 \rangle \},
$$

$$
\underline{\mathcal{C}}(A) = \{ \langle \mathbf{x}\_1, 0.4, 0.3 \rangle, \langle \mathbf{x}\_2, 0.4, 0.5 \rangle, \langle \mathbf{x}\_3, 0.3, 0.4 \rangle, \langle \mathbf{x}\_4, 0.4, 0.5 \rangle, \langle \mathbf{x}\_5, 0.3, 0.3 \rangle \}.
$$

Some characterizations of Huang et al.'s IF covering rough set model are shown in the following proposition.

**Proposition 7.** *([33]) Let* (*<sup>U</sup>*,*C*<sup>F</sup>) *be an IF β-covering approximation space. Then, for all A*, *B* ∈ *IF*(*U*)*,*

*1. C* ∼(*U*) = *U, C*(∅) = ∅*;*


$$\text{5.} \quad \underline{\mathsf{C}}(A \cup B) \supseteq \underline{\mathsf{C}}(A) \cup \underline{\mathsf{C}}(B), \\ \underline{\mathsf{C}}(A \cap B) \subseteq \stackrel{\sim}{\mathsf{C}}(A) \cap \stackrel{\sim}{\mathsf{C}}(B).$$

Besides these characterizations shown in Proposition 7, there are other characterizations that should be investigated.

**Example 6.** *(Continued from Example 1) Let β* = 0.5, 0.3*.*

$$\mathcal{C}(L) = \{ \langle \mathbf{x}\_1, 0.6, 0.2 \rangle, \langle \mathbf{x}\_2, 0.5, 0.2 \rangle, \langle \mathbf{x}\_3, 0.6, 0.3 \rangle, \langle \mathbf{x}\_4, 0.5, 0.2 \rangle, \langle \mathbf{x}\_5, 0.6, 0.3 \rangle \},$$

$$\underline{\mathcal{C}}(\mathcal{D}) = \{ \langle \mathbf{x}\_1, 0.2, 0.6 \rangle, \langle \mathbf{x}\_2, 0.2, 0.5 \rangle, \langle \mathbf{x}\_3, 0.3, 0.6 \rangle, \langle \mathbf{x}\_4, 0.2, 0.5 \rangle, \langle \mathbf{x}\_5, 0.3, 0.6 \rangle \}.$$

According to Example 6, we know **C** (*U*) = *U* and **C** ∼ (∅) = ∅ in an IF *β*-covering approximation space. However, there are **C** (*U*) = *U* and **C** ∼(∅) = ∅ based on some conditions.

**Proposition 8.** *Let* (*<sup>U</sup>*,*<sup>C</sup>* F ) *be an IF β-covering approximation space with β* = *a*, *b and C* F = {*<sup>C</sup>*1, *C*2,..., *Cm*}*. C* ∼(∅) = ∅ *iff* <sup>∨</sup>*y*∈*UμNβx*(*y*) = 1, <sup>∧</sup>*y*∈*UνNβx*(*y*) = 0 *for any x* ∈ *U.*

**Proof.**

$$\begin{split} \mathop{\mathbf{C}}(\mathcal{Q}) = \bigotimes \quad \Leftrightarrow \mathop{\mathbf{C}}(\mathcal{U}) = \mathcal{U} \\ \Leftrightarrow \mathop{\vee}\_{\mathcal{Y} \in \mathcal{U}} [\mu\_{\overline{\mathcal{N}}\_{x}^{\beta}}(\mathcal{y}) \wedge \mu\_{\mathcal{U}}(\mathcal{y})] &= 1, \wedge\_{\mathcal{Y} \in \mathcal{U}} [\nu\_{\overline{\mathcal{N}}\_{x}^{\beta}}(\mathcal{y}) \vee \nu\_{\mathcal{U}}(\mathcal{y})] = 0, (\forall \mathbf{x} \in \mathcal{U}) \\ \Leftrightarrow \mathop{\vee}\_{\mathcal{Y} \in \mathcal{U}} \mu\_{\overline{\mathcal{N}}\_{x}^{\beta}}(\mathcal{y}) &= 1, \wedge\_{\mathcal{Y} \in \mathcal{U}} \nu\_{\overline{\mathcal{N}}\_{x}^{\beta}}(\mathcal{y}) = 0, (\forall \mathbf{x} \in \mathcal{U}). \end{split}$$

∼

∼

∼

∼

∼

**Remark 3.** *Let* (*<sup>U</sup>*,*<sup>C</sup>* ) *be an IF β-covering approximation space. The IF covering approximation operators C and C in Definition 11 do not satisfy the following statements: for all A*, *B* ∈ *IF*(*U*)*,*

*1. C* (*C* (*A*)) = *C* (*A*)*, C* (*C* (*A*)) = *C* (*A*)*;*

∼

F


In order to illustrate this remark, the following example is introduced.

**Example 7.** *(Continued from Example 1) Let β* = 0.5, 0.3*, and:*

 $A = \frac{(0.6, 0.3)}{x\_1} + \frac{(0.4, 0.5)}{x\_2} + \frac{(0.3, 0.2)}{x\_3} + \frac{(0.5, 0.3)}{x\_4} + \frac{(0.7, 0.2)}{x\_5}$   $C\_1 = \frac{(0.7, 0.2)}{x\_1} + \frac{(0.5, 0.3)}{x\_2} + \frac{(0.4, 0.5)}{x\_3} + \frac{(0.6, 0.1)}{x\_4} + \frac{(0.3, 0.2)}{x\_5}$ 

*then:*

*C* (*A*) = {*<sup>x</sup>*1, 0.6, 0.3,*<sup>x</sup>*2, 0.5, 0.2,*<sup>x</sup>*3, 0.6, 0.3,*<sup>x</sup>*4, 0.5, 0.2,*<sup>x</sup>*5, 0.6, 0.3}, *C* ∼ (*A*) = {*<sup>x</sup>*1, 0.4, 0.3,*<sup>x</sup>*2, 0.4, 0.5,*<sup>x</sup>*3, 0.3, 0.4,*<sup>x</sup>*4, 0.4, 0.5,*<sup>x</sup>*5, 0.3, 0.3}, *C* (*C* (*A*)) = {*<sup>x</sup>*1, 0.6, 0.3,*<sup>x</sup>*2, 0.5, 0.3,*<sup>x</sup>*3, 0.6, 0.3,*<sup>x</sup>*4, 0.5, 0.3,*<sup>x</sup>*5, 0.6, 0.3}, *C* ∼ (*C* ∼ (*A*)) = {*<sup>x</sup>*1, 0.3, 0.4,*<sup>x</sup>*2, 0.3, 0.5,*<sup>x</sup>*3, 0.3, 0.4,*<sup>x</sup>*4, 0.3, 0.5,*<sup>x</sup>*5, 0.3, 0.3}, *C* (*<sup>C</sup>*1) = {*<sup>x</sup>*1, 0.6, 0.2,*<sup>x</sup>*2, 0.5, 0.2,*<sup>x</sup>*3, 0.4, 0.3,*<sup>x</sup>*4, 0.5, 0.2,*<sup>x</sup>*5, 0.3, 0.3}, *C* ∼ (*<sup>C</sup>*1) = {*<sup>x</sup>*1, 0.3, 0.3,*<sup>x</sup>*2, 0.3, 0.4,*<sup>x</sup>*3, 0.3, 0.5,*<sup>x</sup>*4, 0.3, 0.4,*<sup>x</sup>*5, 0.3, 0.3}, (*C* (*A*)) = {*<sup>x</sup>*1, 0.3, 0.6,*<sup>x</sup>*2, 0.2, 0.5,*<sup>x</sup>*3, 0.3, 0.6,*<sup>x</sup>*4, 0.2, 0.5,*<sup>x</sup>*5, 0.3, 0.6}, (*C* ∼ (*A*)) = {*<sup>x</sup>*1, 0.3, 0.4,*<sup>x</sup>*2, 0.5, 0.4,*<sup>x</sup>*3, 0.4, 0.3,*<sup>x</sup>*4, 0.5, 0.4,*<sup>x</sup>*5, 0.3, 0.3}, *C* ((*C* (*A*)) ) = {*<sup>x</sup>*1, 0.3, 0.5,*<sup>x</sup>*2, 0.3, 0.5,*<sup>x</sup>*3, 0.3, 0.5,*<sup>x</sup>*4, 0.3, 0.5,*<sup>x</sup>*5, 0.3, 0.5}, *C* ∼((*C* ∼(*A*)) ) = {*<sup>x</sup>*1, 0.3, 0.4,*<sup>x</sup>*2, 0.3, 0.4,*<sup>x</sup>*3, 0.3, 0.4,*<sup>x</sup>*4, 0.3, 0.4,*<sup>x</sup>*5, 0.3, 0.3}.

*Hence, C* ∼ (*C* ∼ (*A*)) = *C* ∼ (*A*)*, C* (*C* (*A*)) = *C* (*A*)*, C* ∼ ((*C* ∼ (*A*)) ) = (*C* ∼ (*A*)) *, C* ((*C* (*A*)) ) = (*C* (*A*)) *, C* ∼(*<sup>C</sup>*1) = *C*1 *and C* (*<sup>C</sup>*1) = *C*1*.*

A condition for **C** ∼(*A*) ⊆ *A* ⊆ **C** (*A*) is proposed in the following proposition.

**Proposition 9.** *Let* (*<sup>U</sup>*,*<sup>C</sup>* F ) *be an IF β-covering approximation space with β* = *a*, *b and C* F = {*<sup>C</sup>*1, *C*2,..., *Cm*}*. Then, the following statements are equivalent:*


**Proof.** (1) ⇒ (2): According to (1), we know *<sup>μ</sup>Nβx* (*x*) = 1 and *<sup>ν</sup>Nβx* (*x*) = 0 for each *x* ∈ *U*. For each *A* ∈ *IF*(*U*),

$$\begin{split} \mu\_{\widetilde{\mathsf{C}}(A)}(\mathbf{x}) &= \wedge\_{\mathcal{Y}\in\mathcal{U}} [\nu\_{\widetilde{\mathsf{N}}\_{\mathbf{x}}^{\mathfrak{S}}}(\mathbf{y}) \vee \mu\_{A}(\mathbf{y})] \\ &= (\wedge\_{\mathcal{Y}\in\mathcal{U}-\{\mathbf{x}\}} [\nu\_{\widetilde{\mathsf{N}}\_{\mathbf{x}}^{\mathfrak{S}}}(\mathbf{y}) \vee \mu\_{A}(\mathbf{y})]) \wedge [\nu\_{\widetilde{\mathsf{N}}\_{\mathbf{x}}^{\mathfrak{S}}}(\mathbf{x}) \vee \mu\_{A}(\mathbf{x})] \\ &\leq \nu\_{\widetilde{\mathsf{N}}\_{\mathbf{x}}^{\mathfrak{S}}}(\mathbf{x}) \vee \mu\_{A}(\mathbf{x}) \\ &= \mu\_{A}(\mathbf{x}). \end{split}$$
 
$$\begin{split} \nu\_{\widetilde{\mathsf{C}}(A)}(\mathbf{x}) &= \vee\_{\mathcal{Y}\in\mathcal{U}} [\mu\_{\widetilde{\mathsf{N}}\_{\mathbf{x}}^{\mathfrak{S}}}(\mathbf{y}) \wedge \nu\_{A}(\mathbf{y})] \\ &= (\vee\_{\mathcal{Y}\in\mathcal{U}-\{\mathbf{x}\}} [\mu\_{\widetilde{\mathsf{N}}\_{\mathbf{x}}^{\mathfrak{S}}}(\mathbf{y}) \wedge \nu\_{A}(\mathbf{y})]) \vee [\mu\_{\widetilde{\mathsf{N}}\_{\mathbf{x}}^{\mathfrak{S}}}(\mathbf{x}) \wedge \nu\_{A}(\mathbf{x})] \\ &\geq \mu\_{\widetilde{\mathsf{N}}\_{\mathbf{x}}^{\mathfrak{S}}}(\mathbf{x}) \wedge \nu\_{A}(\mathbf{x}) \\ &= \nu\_{A}(\mathbf{x}). \end{split}$$

Hence, **C** ∼ (*A*) ⊆ *A*.

(2) ⇒ (3): According to (2) and the duality, it is immediate.

(3) ⇒ (1): For any *x* ∈ *U*, let *μ*<sup>1</sup>*x* (*x*) = 1, *<sup>ν</sup>*1*x* (*x*) = 0, elsewhere *μ*<sup>1</sup>*x* (*y*) = 0, *<sup>ν</sup>*1*x* (*y*) = 1 for all *y* ∈ *U* − {*x*}. Hence, 1*x* ∈ *IF*(*U*). Since *A* ⊆ **C** (*A*) for any *A* ∈ *IF*(*U*), so:

$$\mu\_{\tilde{N}\_x^{\beta}}(\mathbf{x}) = \mu\_{\tilde{\mathbf{C}}(1\_x)}(\mathbf{x}) \ge \mu\_{1\_x}(\mathbf{x}) = 1,\\ \nu\_{\tilde{N}\_x^{\beta}}(\mathbf{x}) = \nu\_{\tilde{\mathbf{C}}(1\_x)}(\mathbf{x}) \le \nu\_{1\_x}(\mathbf{x}) = 0.$$

Therefore, *<sup>μ</sup>Ci*(*x*) ≥ *a*, *<sup>ν</sup>Ci*(*x*) ≤ *b* ⇒ *<sup>μ</sup>Ci*(*x*) = 1, *<sup>ν</sup>Ci*(*x*) = 0 for each *x* ∈ *U*, *i* ∈ {1, 2, . . . , *<sup>m</sup>*}. *4.2. An Intuitionistic Fuzzy Covering Rough Set Model for Crisp Subsets*

F

In [18], Ma presented a fuzzy covering rough set model for crisp subsets. Inspired by his work, we propose an IF covering rough set model for crisp subsets.

**Definition 12.** *Let* (*<sup>U</sup>*,*<sup>C</sup>* ) *be an IF β-covering approximation space. For each crisp subset X* ∈ *P*(*U*) *(P*(*U*) *is the power set of U), the IF covering upper approximation C*(*X*) *and lower approximation C*(*X*) *of X are defined as:*

$$
\overline{\mathcal{C}}(\mathcal{X}) = \{ \mathfrak{x} \in \mathcal{U} : \overline{\mathcal{N}}\_{\mathfrak{x}}^{\mathfrak{f}} \cap \mathcal{X} \neq \mathcal{O} \},
$$

$$
\underline{\mathcal{C}}(\mathcal{X}) = \{ \mathfrak{x} \in \mathcal{U} : \overline{\mathcal{N}}\_{\mathfrak{x}}^{\mathfrak{f}} \subseteq \mathcal{X} \}.
$$

If **C**(*X*) = **<sup>C</sup>**(*X*), then *X* is called the second type of IF covering rough set.

**Example 8.** *(Continued from Example 4) Let β* = 0.5, 0.3*, X* = {*<sup>x</sup>*1, *<sup>x</sup>*2}*, Y* = {*<sup>x</sup>*2, *x*4, *<sup>x</sup>*5}*. Then:*

$$\begin{aligned} \overline{\mathcal{C}}(X) &= \{ \mathbf{x}\_1, \mathbf{x}\_2, \mathbf{x}\_4 \}, \underline{\mathbf{C}}(X) = \{ \mathbf{x}\_1 \}, \\ \overline{\mathcal{C}}(Y) &= \{ \mathbf{x}\_2, \mathbf{x}\_3, \mathbf{x}\_4, \mathbf{x}\_5 \}, \underline{\mathbf{C}}(Y) = \{ \mathbf{x}\_2, \mathbf{x}\_4, \mathbf{x}\_5 \}, \\ \overline{\mathcal{C}}(U) &= \mathcal{U}, \underline{\mathbf{C}}(U) = \mathcal{U}, \overline{\mathcal{C}}(\mathcal{O}) = \mathcal{O}, \underline{\mathbf{C}}(\mathcal{O}) = \mathcal{O}. \end{aligned}$$

The basic characterizations of the IF covering rough set model for crisp subsets are investigated in the following proposition.

**Proposition 10.** *Let* (*<sup>U</sup>*,*<sup>C</sup>* F ) *be an IF β-covering approximation space. Then, for all X*,*Y* ∈ *<sup>P</sup>*(*U*)*,*


**Proof.** According to Definitions 10 and 12, it is immediate.

#### *4.3. Relationships between These Two Models and Some Other Rough Set Models*

These two types of IF covering rough set models introduced above can be viewed as a bridge linking intuitionistic fuzzy sets and covering-based rough sets. In these models, **C** , **C** ∼ are IF approximation operators, and **C**, **C** are crisp approximation operators in the IF environment. Firstly, we present the relationship between the IF covering rough set model defined in Section 4.1 and the generalized IF rough set model proposed by Zhou et al. in [38].

**Definition 13.** *([38]) Let U be a universe of discourse and R* ∈ *IFR*(*U* × *<sup>U</sup>*)*. For any A* ∈ *IF*(*U*)*, the upper approximation R* (*A*) *and lower approximation R* (*A*) *of A are defined as:*

∼

$$\begin{aligned} \tilde{R}(A) &= \{ \langle \mathbf{x}, \vee\_{\mathcal{Y} \in \mathcal{U}} [\mu\_{\mathcal{R}}(\mathbf{x}, \mathbf{y}) \wedge \mu\_{A}(\mathbf{y})], \wedge\_{\mathcal{Y} \in \mathcal{U}} [\nu\_{\mathcal{R}}(\mathbf{x}, \mathbf{y}) \vee \nu\_{A}(\mathbf{y})] \rangle : \mathbf{x} \in \mathcal{U} \}, \\ \tilde{R}(A) &= \{ \langle \mathbf{x}, \wedge\_{\mathcal{Y} \in \mathcal{U}} [\nu\_{\mathcal{R}}(\mathbf{x}, \mathbf{y}) \vee \mu\_{A}(\mathbf{y})], \vee\_{\mathcal{Y} \in \mathcal{U}} [\mu\_{\mathcal{R}}(\mathbf{x}, \mathbf{y}) \wedge \nu\_{A}(\mathbf{y})] \rangle : \mathbf{x} \in \mathcal{U} \}. \end{aligned}$$

For an IF *β*-covering **C**F of *U*, one can define an IF relation *R* on the universe *U* as:

$$\mu\_{\mathbb{R}}(\mathbf{x}, \mathbf{y}) = \mu\_{\tilde{\mathcal{N}}\_{\mathbf{x}}^{\beta}(\mathbf{y})'} \nu\_{\mathbb{R}}(\mathbf{x}, \mathbf{y}) = \nu\_{\tilde{\mathcal{N}}\_{\mathbf{x}}^{\beta}(\mathbf{y})} \text{ for any } \mathbf{x}, \mathbf{y} \in \mathcal{U}.$$

The induced IF relation *R* is related to all *C* ∈ **C**F. Hence, the IF covering rough set model defined in Section 4.1 can be viewed as a generalized IF rough set model presented by Zhou and Wu in Definition 13: for each *A* ∈ *IF*(*U*),

$$\begin{split} \widetilde{\mathsf{C}}(A) &= \{ \langle \mathsf{x}, \vee\_{\mathcal{Y} \in \mathcal{U}} [\mu\_{\mathcal{R}}(\mathsf{x}, \mathsf{y}) \wedge \mu\_{A}(\mathsf{y})], \wedge\_{\mathcal{Y} \in \mathcal{U}} [\nu\_{\mathcal{R}}(\mathsf{x}, \mathsf{y}) \vee \nu\_{A}(\mathsf{y})] \rangle : \mathsf{x} \in \mathsf{U} \} = \widetilde{\mathsf{R}}(A), \\ \underline{\mathsf{C}}(A) &= \{ \langle \mathsf{x}, \wedge\_{\mathcal{Y} \in \mathcal{U}} [\nu\_{\mathcal{R}}(\mathsf{x}, \mathsf{y}) \vee \mu\_{A}(\mathsf{y})], \vee\_{\mathcal{Y} \in \mathcal{U}} [\mu\_{\mathcal{R}}(\mathsf{x}, \mathsf{y}) \wedge \nu\_{A}(\mathsf{y})] \rangle : \mathsf{x} \in \mathsf{U} \} = \underline{\mathsf{R}}(A). \end{split}$$

Then, we present the relationship between the IF covering rough set model defined in Section 4.2 and a covering-based rough set model in Definition 3 proposed by Samanta and Chakraborty in [37].

**Proposition 11.** *Let* (*<sup>U</sup>*,*C*<sup>F</sup>) *be an IF β-covering approximation space and C*F = {*<sup>C</sup>*1, *C*2,..., *Cm*}*.*

*.*


**Proof.** (1) Since **C**F = {*<sup>C</sup>*1, *C*2, ... , *Cm*} is an IF *β*-covering on *U*, so for any *x* ∈ *U*, there exists *Ci* ∈ **C**F such that *Ci*(*x*) ≥ *β*. Thus, *x* ∈ *Ki*. Hence, **C** = {*<sup>K</sup>*1, *K*2,..., *Km*} is a covering of *U*.

(2) Since **C** = {*<sup>K</sup>*1, *K*2,..., *Km*} is a covering of *U* with *Ki* = {*x* ∈ *U* : *Ci*(*x*) ≥ *β*}, so:

$$\begin{aligned} \widetilde{N}\_{x}^{\beta} &= \{ y \in \mathcal{U} : \widetilde{N}\_{x}^{\beta}(y) \ge \beta \} \\ &= \{ y \in \mathcal{U} : (\bigcap\_{\mathbb{C}\_{i}(x) \ge \beta} \mathbb{C}\_{i})(y) \ge \beta \} \\ &= \{ y \in \mathcal{U} : (\bigcap\_{\mathbb{C} \in K\_{i}} \mathbb{C}\_{i})(y) \ge \beta \} \\ &= \{ y \in \mathcal{U} : x \in K\_{i} \Rightarrow y \in K\_{i}, i = 1, 2, \dots, m \} \\ &= \cap \{ K\_{i} \in \mathbb{C} : x \in K\_{i} \} \\ &= N\_{\mathbb{C}}(x). \end{aligned}$$

According to Proposition 11, for any fixed *β* = *a*, *b* (0 ≤ *a*, *b* ≤ 1 and *a* + *b* ≤ 1), an IF *β*-covering **C**F of *U* induces a covering **C** of *U*. Then, the second type of intuitionistic fuzzy covering rough set model defined in Subsection 4.2 can be viewed as a covering-based rough set model in Definition 3: for each *X* ∈ *<sup>P</sup>*(*U*),

$$\mathfrak{C}(X) = \{ \mathbf{x} \in \mathcal{U} : \overline{\mathcal{N}}\_{\mathbf{x}}^{\mathfrak{f}} \cap X \neq \mathcal{O} \} = \{ \mathbf{x} \in \mathcal{U} : \mathcal{N}\_{\mathbf{C}}(\mathbf{x}) \cap X \neq \mathcal{O} \} = S\mathcal{H}\_{\mathbf{C}}(X),$$

$$\underline{\mathfrak{C}}(X) = \{ \mathbf{x} \in \mathcal{U} : \overline{\mathcal{N}}\_{\mathbf{x}}^{\mathfrak{f}} \subseteq X \} = \{ \mathbf{x} \in \mathcal{U} : \mathcal{N}\_{\mathbf{C}}(\mathbf{x}) \subseteq X \} = S\mathcal{L}\_{\mathbf{C}}(X).$$

#### **5. An Application to Multiple Criteria Group Decision Making**

In [33], Huang et al. also defined an optimistic multi-granulation IF rough set model. In this section, we present a novel approach to MCGDM based on the optimistic multi-granulation IF rough set model. We investigate the basic description of an MCGDM problem under the framework of multi-granulation spaces. Then, we put forth a general decision making methodology for MCGDM problems by means of the optimistic multi-granulation IF rough set model in the case of patient ranking.

#### *5.1. An Optimistic Multi-Granulation IF Rough Set Model*

Let **C** F be an IF *β*-covering of *U*. For each *x* ∈ *U*,

$$\begin{aligned} \mathrm{\bar{N}}\_{\mathrm{x}}^{\beta} &= \cap \{ \mathbb{C}\_{i} \in \mathbb{C} : \mathbb{C}\_{i}(\mathbf{x}) \ge \beta \}. \\ \mathrm{\bar{N}}\_{\mathbb{C}}^{\beta} = \{ \bar{N}\_{\mathrm{x}}^{\beta} : \mathbf{x} \in \mathsf{U} \}, \text{ where } \mu\_{\bar{N}\_{\mathbb{C}}^{\beta}}(\mathbf{x}, y) = \mu\_{\bar{N}\_{\mathbb{C}}^{\beta}}(y) \text{ and } \nu\_{\bar{N}\_{\mathbb{C}}^{\beta}}(\mathbf{x}, y) = \nu\_{\bar{N}\_{\mathbb{C}}^{\beta}}(y) \text{ for any } y \in \mathsf{U}. \end{aligned}$$

**Definition 14.** *([33]) Let U* = {*<sup>x</sup>*1, *x*2, ··· , *xm*} *be a universe,* (*<sup>U</sup>*, <sup>Γ</sup>*β*) *be a n-IF β-coverings approximation space with* Γ*β* = {*C* P 1,*C* P 2, ··· ,*C* P *n*} *and* (*<sup>U</sup>*, <sup>N</sup>Γ*β* ) *be the IF β-neighborhood (graded neighborhood) approximation space induced by the n-IF β-covering approximation space* (*<sup>U</sup>*, <sup>Γ</sup>*β*)*. For each A* ∈ *IF*(*U*) *where A* = {*xj*, *<sup>μ</sup>A*(*xj*), *<sup>ν</sup>A*(*xj*) : 1 ≤ *j* ≤ *<sup>m</sup>*}*, the optimistic upper approximation* <sup>N</sup>Γ*β* (*o*)(*A*) *and lower approximation* <sup>N</sup>Γ*β* (*o*)(*A*) *of A are defined as:*

$$\begin{aligned} \overline{\mathfrak{N}\_{\Gamma\_{\beta}}}^{(o)}(A) &= \{ \langle \boldsymbol{\pi}\_{i\prime} \boldsymbol{\mu}\_{\overline{\mathfrak{N}\_{\Gamma\_{\beta}}}^{(o)}(A)}(\boldsymbol{\pi}\_{i}), \boldsymbol{\nu}\_{\overline{\mathfrak{N}\_{\Gamma\_{\beta}}}^{(o)}(A)}(\boldsymbol{\pi}\_{i}) \rangle : 1 \le i \le m \}, \\ \underline{\mathfrak{N}\_{\Gamma\_{\beta}}}^{(o)}(A) &= \{ \langle \boldsymbol{\pi}\_{i\prime} \boldsymbol{\mu}\_{\underline{\mathfrak{N}\_{\Gamma\_{\beta}}}^{(o)}(A)}(\boldsymbol{\pi}\_{i}), \boldsymbol{\nu}\_{\underline{\mathfrak{N}\_{\Gamma\_{\beta}}}^{(o)}(A)}(\boldsymbol{\pi}\_{i}) \rangle : 1 \le i \le m \}. \end{aligned}$$

*where:*

$$\begin{array}{lcl}\mu\_{\overline{\mathfrak{N}\_{\beta}}^{(o)}(A)}(\mathbf{x}\_{i})&=\bigwedge\_{k=1}^{n}\bigvee\_{j=1}^{m}[\mu\_{\overline{\mathfrak{N}\_{\beta}}^{\beta}}(\mathbf{x}\_{i\prime},\mathbf{x}\_{j})\wedge\mu\_{A}(\mathbf{x}\_{j})](1\leq i\leq m),\\\nu\_{\overline{\mathfrak{N}\_{\beta}}^{(o)}(A)}(\mathbf{x}\_{i})&=\bigvee\_{k=1}^{n}\bigwedge[\nu\_{\overline{\mathfrak{N}\_{\beta}}^{\beta}}(\mathbf{x}\_{i\prime},\mathbf{x}\_{j})\vee\nu\_{A}(\mathbf{x}\_{j})](1\leq i\leq m),\\\mu\_{\overline{\mathfrak{N}\_{\beta}}^{(o)}(A)}(\mathbf{x}\_{i})&=\bigvee\_{k=1}^{n}\bigwedge[\nu\_{\overline{\mathfrak{N}\_{\beta}}^{\beta}}(\mathbf{x}\_{i\prime},\mathbf{x}\_{j})\vee\mu\_{A}(\mathbf{x}\_{j})](1\leq i\leq m),\\\nu\_{\overline{\mathfrak{N}\_{\beta}}^{(o)}(A)}(\mathbf{x}\_{i})&=\bigwedge\_{k=1}^{n}\bigvee\_{j=1}^{m}[\mu\_{\overline{\mathfrak{N}\_{\beta}}^{\beta}}(\mathbf{x}\_{i\prime},\mathbf{x}\_{j})\wedge\nu\_{A}(\mathbf{x}\_{j})](1\leq i\leq m).\end{array}$$

#### *5.2. The Problem of Multiple Criteria Group Decision Making*

Let *U* = {*xk* : *k* = 1, 2, ··· , *l*} be the set of patients and *V* = {*yj*|*j* = 1, 2, ··· , *m*} be the *m* main symptoms (for example, fever, cough, and so on) for a disease *B*. Assume that the duty doctor *X* invites *n* experts *Ri* (*i* = 1, 2, ··· , *n*) to evaluate every patient *xk* (*k* = 1, 2, ··· , *l*).

Assume that every expert *Ri* (*i* = 1, 2, ··· , *n*) believes each patient *xk* ∈ *U* (*k* = 1, 2, ··· , *l*) has a symptom value *Cij* (*j* = 1, 2, ··· , *m*), denoted by *Cij*(*xk*) = *μCij*(*xk*), *<sup>ν</sup>Cij*(*xk*), where *<sup>μ</sup>Cij*(*xk*) ∈ [0, 1] is the degree that expert *Ri* confirms patient *xk* has symptom *yj*, *<sup>ν</sup>Cij*(*xk*) ∈ [0, 1] is the degree that expert *Ri* confirms patient *xk* does not have symptom *yj* and *<sup>μ</sup>Cij*(*xk*) + *<sup>ν</sup>Cij*(*xk*) ≤ 1.

Let *β* = *a*, *b* be the critical value. If any patient *xk* ∈ *U*, there is at least one symptom *yj* ∈ *V* such that the symptom value *Cij* for the patient *xk*, which is diagnosed by the expert *Ri*, is not less than *β*, respectively, then Γ*β* = {**C** P 1, **C** P 2, ··· , **C** P *<sup>n</sup>*}, where **C** F *i* = {*Ci*1, *Ci*2, ··· , *Cim*}, for all 1 ≤ *i* ≤ *n*, is a *n*-IF *β*-coverings of *U* for some IF value *β*.

The IF *β*-neighborhood *N β x* of *x* induced by **C** F *i* (1 ≤ *i* ≤ *n*) is an IFS:

$$\begin{aligned} \hat{N}\_x^\beta &= \cap \{ \mathcal{C}\_{ij} \in \hat{\mathcal{C}}\_i : \mathcal{C}\_{ij}(\mathbf{x}) \ge \beta, j = 1, 2, \dots, m \}. \\ \hat{N}\_{\widehat{\mathbf{C}}\_i}^\beta &= \{ \hat{N}\_x^\beta : \mathbf{x} \in \mathcal{U} \}, \text{ where } \mu\_{\widehat{N}\_x^\beta}(\mathbf{x}, \mathbf{x}) = \mu\_{\widehat{N}\_x^\beta}(\mathbf{x}\_l) \text{ and } \nu\_{\widehat{N}\_{\widehat{C}\_l}^\beta}(\mathbf{x}, \mathbf{x}\_l) = \nu\_{\widehat{N}\_x^\beta}(\mathbf{x}\_l) \text{ for any } t = 1, 2, \dots, l. \end{aligned}$$

*μN<sup>β</sup>* **C** P *i* (*<sup>x</sup>*, *xt*) denotes the minimum value among the degree of sickness of every patient *xt* (*t* = 1, 2, ··· , *l*) according to the diagnoses of the expert *Ri* (*i* = 1, 2, ··· , *n*), respectively. *<sup>ν</sup>N<sup>β</sup>* **C** P *i* (*<sup>x</sup>*, *xt*) denotes the maximum value among the degree of non-sickness of every patient *xt* (*t* = 1, 2, ··· , *l*) according to the diagnoses of the expert *Ri* (*i* = 1, 2, ··· , *n*), respectively.

If *c* is a possible degree and *d* is an impossible degree of the disease *B* of every patient *xk* ∈ *U* that is diagnosed by the duty doctor *X*, denoted by *<sup>A</sup>*(*xk*) = *c*, *d*, then the decision maker (the duty doctor *X*) for the MCGDM problem needs to know how to evaluate whether or not the patients *xk* ∈ *U* have the disease *B*.

#### *5.3. Decision Making Methodology and Process*

In this subsection, we give an approach to decision making for the problem of MCGDM with the above characterizations by means of the optimistic multi-granulation IF rough set model. According to the characterizations of the MCGDM problem in Subsection 5.2, we construct the multi-granulation intuitionistic fuzzy decision information systems and present the process of decision making under the framework of optimistic multi-granulation IF rough set model.



$$\sum\_{i=1}^{n} \widetilde{\mathcal{R}}\_i(A) \; : \;= \underline{\zeta} \underline{\mathfrak{N}\_{\Gamma\_{\beta}}}(\boldsymbol{\alpha}) + (1 - \boldsymbol{\zeta}) \overline{\mathfrak{N}\_{\Gamma\_{\beta}}}(\boldsymbol{\alpha}) .$$

• **Step 5**: Computing:

$$s(\mathbf{x}) = \mu\_{\sum\_{i=1}^n \bar{R}\_i(A)}(\mathbf{x}) - \nu\_{\sum\_{i=1}^n \bar{R}\_i(A)}(\mathbf{x}) \text{ for any } \mathbf{x} \in \mathcal{U}.$$

• **Step 6**: Obtain the ranking for all *s*(*x*) by using the principle of numerical size.

According to the above process, we can ge<sup>t</sup> the decision making according to the ranking. In Step 3, *ζ* reflects the preference of the decision maker for the risk of decision making problems. The decision maker can adjust *ζ* according to the goal in the real world. In Step 4, *n* ∑ *i*=1 *R i*(*A*) can be regarded as the compromise rule with the right weight *ζ* from the view of risk decision making with uncertainty. We define *n* ∑ *i*=1 *R i*(*A*) = {*xk*, *ζμ*<sup>N</sup>Γ*β* (*o*)(*A*)(*xk*)+(<sup>1</sup> − *<sup>ζ</sup>*)*μ*NΓ*β* (*o*)(*A*)(*xk*), *ζν*<sup>N</sup>Γ*β* (*o*)(*A*)(*xk*) + (1 − *<sup>ζ</sup>*)*<sup>ν</sup>*NΓ*β* (*o*)(*A*)(*xk*) : 1 ≤ *k* ≤ *l*}.

#### *5.4. An Applied Example*

Assume that *U* = {*<sup>x</sup>*1, *x*2, *x*3, *x*4, *<sup>x</sup>*5} is a set of patients. According to the patients' symptoms, we write *V* = {*y*1, *y*2, *y*3, *y*4} to be four main symptoms (fever, cough, sore and headache) for a disease *B*. Assume that the duty doctor *X* invites two experts *Ri* (*i* = 1, 2) to evaluate every patient *xk* (*k* = 1, 2, ··· , 5) as in Tables 2 and 3.

**Table 2.** Symptom values of expert *R*1 for every patient *xk* (*k* = 1, 2, ··· , 5).



**Table 3.** Symptom values of expert *R*2 for every patient *xk* (*k* = 1, 2, ··· , 5).

Let *β* = 0.5, 0.3 be the critical value. Then, Γ*β* = {**C** P 1, **C** P <sup>2</sup>}, where **C** F *i* = {*Ci*1, *Ci*2, *Ci*3, *Ci*4}, for all *i* = 1, 2, is a 2-IF *β*-coverings of *U*. *N β* **C**P *i*(*i* = 1, 2) are shown in Tables 4 and 5, respectively.


**Table 4.** *N β* **C**P

.

.



Assume that the duty doctor *X* diagnosed the value *A* = (0.6,0.3) *x*1 + (0.4,0.5) *x*2 + (0.3,0.2) *x*3 + (0.5,0.3) *x*4 + (0.7,0.2) *x*5 of the disease *B* of every patient. Then:

$$\begin{aligned} \overline{\mathfrak{N}\_{\Gamma\_{\beta}}}^{(o)}(A) &= \frac{(0.6, 0.3)}{\underline{\mathfrak{x}\_{1}}} + \frac{(0.5, 0.3)}{\underline{\mathfrak{x}\_{2}}} + \frac{(0.5, 0.3)}{\underline{\mathfrak{x}\_{3}}} + \frac{(0.5, 0.2)}{\underline{\mathfrak{x}\_{4}}} + \frac{(0.5, 0.3)}{\underline{\mathfrak{x}\_{5}}}, \\ \underline{\mathfrak{N}\_{\beta}}^{(o)}(A) &= \frac{(0.4, 0.3)}{\underline{\mathfrak{x}\_{1}}} + \frac{(0.4, 0.5)}{\underline{\mathfrak{x}\_{2}}} + \frac{(0.3, 0.4)}{\underline{\mathfrak{x}\_{3}}} + \frac{(0.4, 0.4)}{\underline{\mathfrak{x}\_{4}}} + \frac{(0.4, 0.3)}{\underline{\mathfrak{x}\_{5}}}. \end{aligned}$$

Let *ζ* = 0.7. Then:

$$\begin{array}{ll} \sum\_{i=1}^{2} \check{R}\_{i}(A) &= 0.7 \mathfrak{N}\_{\Gamma\_{\beta}}(o) + (1 - 0.7) \overline{\mathfrak{N}\_{\Gamma\_{\beta}}}^{(o)}(A) \\ &= \frac{(0.46, 0.3)}{x\_{1}} + \frac{(0.43, 0.44)}{x\_{2}} + \frac{(0.36, 0.37)}{x\_{3}} + \frac{(0.43, 0.34)}{x\_{4}} + \frac{(0.43, 0.3)}{x\_{5}}. \end{array}$$

Hence, we can obtain *s*(*xk*) (*k* = 1, 2, ··· , 5) in Table 6.

**Table 6.** *s*(*xk*) (*k* = 1, 2, ··· , 5).


According to the principle of numerical size, we have:

$$s(\mathfrak{x}\_2) = s(\mathfrak{x}\_3) < s(\mathfrak{x}\_4) < s(\mathfrak{x}\_5) < s(\mathfrak{x}\_1).$$

Therefore, the doctor *X* diagnoses the patient *x*1 as more likely to be sick with the disease *B*.
