Four Operators of Rough Sets Generalized to Matroids and a Matroidal Method for Attribute Reduction

Rough sets provide a useful tool for data preprocessing during data mining. However, many algorithms related to some problems in rough sets, such as attribute reduction, are greedy ones. Matroids propose a good platform for greedy algorithms. Therefore, it is important to study the combination between rough sets and matroids. In this paper, we investigate rough sets and matroids through their operators, and provide a matroidal method for attribute reduction in information systems. Firstly, we generalize four operators of rough sets to four operators of matroids through the interior, closure, exterior and boundary axioms, respectively. Thus, there are four matroids induced by these four operators of rough sets. Then, we find that these four matroids are the same one, which implies the relationship about operators between rough sets and matroids. Secondly, a relationship about operations between matroids and rough sets is presented according to the induced matroid. Finally, the girth function of matroids is used to compute attribute reduction in information systems.

However, many optimization issues related to rough sets, including attribute reduction, are NP-hard.Therefore, the algorithms to deal with them are often greedy ones [27].Matroid theory [28][29][30] is a generalization of graph and linear algebra theories.It has been used in information coding [31] and cryptology [32].Recently, the combination between rough sets and matroids has attracted many interesting research.For example, Zhu and Wang [33] established a matroidal structure through the upper approximation number and studied generalized rough sets with matroidal approaches.Liu and Zhu [34] established a parametric matroid through the lower approximation operator of rough sets.Li et al. [35,36] used matroidal approaches to investigate rough sets through closure operators.Su and Zhu [37] presented three types of matroidal structures of covering-based rough sets.Wang et al. [38] induced a matroid named 2-circuit matroid by equivalence relations, and equivalently formulated attribute reduction with matroidal approaches.Wang and Zhu used matrix approaches to study the 2-circuit matroid [39], and used contraction operation in matroids to study some relationships between a subset and the upper approximation of this subset in rough sets [40].Unfortunately, all of these papers never study matroids and rough sets through the positive, negative and boundary operators of rough sets.Thus, it is necessary to further study rough sets and matroids by these operators in this paper.In addition, only Wang et al. [38] presented two equivalent descriptions of attribute reduction by closure operators and rank functions of matroids, respectively.We consider presenting a novel approach to attribute reduction through the girth function of matroids in this paper.
In this paper, we mainly use the positive operator, the negative operator and the boundary operator to study matroids and rough sets, and propose a method to compute attribute reduction in information systems through the girth function of matroids.Firstly, we generalize the positive (the lower approximation operator), upper approximation, negative and boundary operators of rough sets to the interior, closure, exterior and boundary operators of matroids respectively.Among them, the upper and lower approximation operators have been studied in [35].Thus, there are four matroids induced by these four operators of rough sets.Then, the relationship between these four matroids is studied, which implies the relationship about operators between rough sets and matroids.In fact, these four matroids are the same one.Secondly, a relationship about the restriction operation both in matroids and rough sets is proposed.Finally, a matroidal approach is proposed to compute attribute reduction in information systems through the girth function of matroids, and an example about attribute reduction is solved.Using this matroidal approach, we can compute attribute reduction through their results "2" and "∞".
The rest of this paper is organized as follows.Section 2 recalls some basic notions about rough sets, information systems and matroids.In Section 3, we generalize four operators of rough sets to four operators of matroids, respectively.In addition, we study the relationship between four matroids induced by these four operators of rough sets.Moreover, a relationship about operations between matroids and rough sets is presented.In Section 4, an equivalent formulation of attribute reduction through the girth function is presented.Based on the equivalent formulation, a novel method is proposed to compute attribute reduction in information systems.Finally, Section 5 concludes this paper and indicates further works.

Basic Definitions
In this section, we review some notions in Pawlak's rough sets, information systems and matroids.

Pawlak's Rough Sets and Information Systems
The definition of approximation operators is presented in [1,41].Let R an equivalence relation on U.For any X ⊆ U, a pair of approximation R(X) and R(X) of X are defined by where RN(x) = {y ∈ U : xRy}.R and R are called the upper and lower approximation operators with respect to R, respectively.In this paper, U is a nonempty and finite set called universe.Let −X be the complement of X in U and ∅ be the empty set.We have the following conclusions about R and R. Proposition 1. Refs.[1,41] Let R be an equivalence relation on U.For any X, Y ⊆ U, On the basis of the upper and lower approximation operators with respect to R, one can define three operators to divide the universe, namely, the negative operator NEG R , the positive operator POS R and the boundary operator BND R : An information system [38] is an ordered pair IS = (U, A), where U is a nonempty finite set of objects and A is a nonempty finite set of attributes such that a : U → V a for any a ∈ A, where V a is called the value set of a.For all B ⊆ A, the indiscernibility relation induced by B is defined as follows: Definition 1. (Reduct [38]) Let IS = (U, A) be an information system.For all B ⊆ A, B is called a reduct of IS, if the following two conditions hold:  Let M = (U, I) be a matroid.We shall often write U(M) for U and I(M) for I, particularly when several matroids are being considered.The members of I are the independent sets of M.
In order to make some expressions brief, some denotations are presented.Let A ⊆ 2 U .Then, The set of all circuits of M is defined as We call cl M (X) the closure of X in M. X is called a closed set if cl M (X) = X, and we denote the family of all closed sets of M by F(M).The closure axiom of a matroid is introduced in the following proposition.Proposition 2. (Closure axiom [29,30]) Let cl be an operator of U.Then, there exists one and only one matroid M such that cl = cl M iff cl satisfies the following four conditions: The following proposition shows the interior axiom of a matroid.Proposition 3. (Interior axiom [29,30]) Let int be an operator of U.Then, there exists one and only one matroid M such that int = int M iff int satisfies the following four conditions: Based on the closure operator cl M , the exterior operator ex M and the boundary operator bo M of M are defined as The following two propositions present the exterior and boundary axioms, respectively.Proposition 4. (Exterior axiom [42]) Let ex be an operator of U.Then, there exists one and only one matroid M such that ex = ex M iff ex M satisfies the following four conditions: Proposition 5. (Boundary axiom [42]) Let bo be an operator of U.Then, there exists one and only one matroid M such that bo = bo M iff bo satisfies the following five conditions: The following proposition shows some relationships between these above four operators, namely cl M , int M , ex M and bo M .Proposition 6. Ref. [42] Let M = (U, I) be a matroid.For all X ⊆ U, the following statements hold:

The Relationship about Operators between Rough Sets and Matroids
In this section, four matroids are induced by four operators of rough sets.These four matroids are induced by the lower approximation operator R (because R = POS R , we only consider R), the upper approximation operator R, the negative operator NEG R and the boundary operator BND R through the interior axiom, the closure axiom, the exterior axiom and the boundary axiom, respectively.Among them, the upper approximation operator R has been studied in [35].Then, the relationship between these four matroids are studied, and we find that these four are the same one.According to this work, we present the relationship about operators between rough sets and matroids.

Four Matroids Induced by Four Operators of Rough Sets
In this subsection, we generalize the positive operator (the lower approximation operator), the upper approximation operator, the negative operator and the boundary operator of rough sets to the interior operator, the closure operator, the exterior operator and the boundary operator of matroids, respectively.Firstly, the following lemma is proposed.Lemma 1. Refs.[1,41] Let R be an equivalence relation on U.For any x, y ∈ U, if x ∈ RN(y), then y ∈ RN(x).
The following proposition shows that the lower approximation operator R satisfies the interior axiom of matroids.
Inspired by Proposition 7, there is a matroid such that R is its interior operator.Definition 3. Let R be an equivalence relation on U. The matroid whose interior operator is R is denoted by M(R).We say M(R) is the matroid induced by R.
Proposition 8 determines the second matroid induced by R. Definition 4. Let R be an equivalence relation on U. The matroid whose closure operator is R is denoted by M(R).We say that M(R) is the matroid induced by R.

Proof. (EX1):
Proposition 9 determines the third matroid such that NEG R is its exterior operator.Definition 5. Let R be an equivalence relation on U. The matroid whose exterior operator is NEG R is denoted by M(NEG R ).We say M(NEG R ) is the matroid induced by NEG R .
In order to certify the boundary operator BND R satisfies the boundary axiom, the following two lemmas are proposed.Lemma 2. Refs.[1,41] Let R be an equivalence relation on U.For all X, Y ⊆ U, R(X Y) ⊆ R(X) R(Y).

Proof. (BO1):
According to Lemma 1, we know (BO4): When x = y or x ∈ X, it is straightforward.When y ∈ X, it does not hold.(In fact, we suppose y ∈ X.If y ∈ BND R (X {x}), according to Lemma 3, we know y ∈ X BND R (X {x}) ⊆ BND R (X), which is contradictory with y ∈ BND R (X {x}) − BND R (X).Hence, y ∈ X.) We only need to prove it for x = y and x, y ∈ X.
According to (5H) and (8LH Proposition 8 determines the fourth matroid such that BND R is its boundary operator.Definition 6.Let R be an equivalence relation on U. The matroid whose boundary operator is BND R is denoted by M(BND R ).We say that M(BND R ) is the matroid induced by BND R .

The Relationship between These Four Matroids
This subsection studies the relationship between these four matroids in the above subsection.In fact, these four matroids are the same one.
Theorem 1.Let R be an equivalence relation on U.Then, Proof.(1) On one hand, M(R) and M(R) have the same grand U. On the other hand, according to Definition 3, we know int (2) On one hand, M(R) and M(NEG R ) have the same grand U. On the other hand, according to Definition 4, we know cl M (3) On one hand, M(R) and M(NEG R ) have the same grand U. On the other hand, according to Definition 4, we have cl M Definition 7. Let R be an equivalence relation on U. The matroid whose interior operator, closure operator, exterior operator and boundary operator are R, R, NEG R and BND R is defined as M(R).We say that M(R) is the matroid induced by R.
According to the above definition, we have the relationship about operators between rough sets and matroids as Table 1: Table 1.The relationship about operators between rough sets and matroids.

The Relationship about Operations between Matroids and Rough Sets
In this subection, a relationship about the restriction operation both in matroids and rough sets is proposed.First of all, two definitions of these two operations are presented in the following two definitions.[29,30]) Let M = (U, I) be a matroid.For X ⊆ U, the restriction of M to X is defined as M|X = (X, I X ), where I X = {I ⊆ X : I ∈ I}.

Definition 8. (Restriction
Not that C(M|X) = {C ⊆ X : C ∈ C(M)}.For an equivalence relation R on U, there is also a definition of restriction of R. For any X ⊆ U, R|X is an equivalence relation called the restriction of R to X, where R|X = {(x, y) ∈ X × X : (x, y) ∈ R}, X × X is the product set of X and X.According to Definition 7, M(R|X) is a matroid on X.
In [38], the set of independent sets of M(R) is proposed in the following lemma.
Lemma 4. Ref. [38] Let R be an equivalence relation on U.Then,

A Matroidal Approach to Attribute Reduction through the Girth Function
In this section, a matroidal approach is proposed to compute attribute reduction in information systems through the girth function of matroids.

An Equivalent Formulation of Attribute Reduction through the Girth Function
Lemma 5. Ref. [15] Let R 1 and R 2 be two equivalence relations on U, respectively.Then, R 1 = R 2 if and only Based on Lemma 5, we propose a necessary and sufficient condition for two equivalence relations induce the same matroids.Proposition 12. Let R 1 and R 2 be two equivalence relations on U, respectively.Then, M(R Proof.According to Definition 7, M(R 1 ) and M(R 2 ) have the same grand U.According to Proposition 3, Proposition 7 and Lemma 5, An equivalent formulation of attribute reduction in information systems is presented from the viewpoint of matroids.Proposition 13.Let IS = (U, A) be an information system.For all B ⊆ A, B is a reduct of IS if and only if it satisfies the following two conditions: According to Definition 1, it is immediate.
In Proposition 13, the equivalent formulation of attribute reduction is not convenient for us to compute the attribute reduction.We consider to use the girth function of matroids to compute it.Definition 9. (Girth function [29,30]) Let M = (U, I) be a matroid.The girth g(M) of M is defined as: For all X ⊆ U, the girth function g M is defined as g M (X) = g(M|X).g M (X) is called the girth of X in M.
Lemma 7. Refs.[1,41] Let R 1 and R 2 be two equivalence relations on U, respectively.Then, for any x ∈ U, According to Corollary 2, the girth function of the matroid induced by attribute subsets is presented in the following proposition.Proposition 15.Let IS = (U, A) be an information system and X ⊆ U.Then, for all B ⊆ A, ∞, otherwise.
Proof.According to Lemma 7 and Corollary 2, it is immediate.
Note that R i in R i N denotes the equivalence relation induced by attribute R i ∈ A. According to the girth axiom, we know that a matroid is corresponding to one and only one girth function.
Proposition 16. (Girth axiom [29,30]) Let g : 2 U → Z + {0, ∞} be a function.Then, there exists one and only one matroid M such that g = g M iff g satisfies the following three conditions: Inspired by Propositions 13 and 16, we can use the girth function in matroids to compute attribute reduction.Theorem 2. Let IS = (U, A) be an information system.For all B ⊆ A, B is a reduct of IS if and only if it satisfies the following two conditions: (1) For all b ∈ B, there exists X ⊆ U such that g M(I ND(B)) (X) = g M(I ND(B−b)) (X).
Proof.According to Propositions 13 and 16, it is immediate.

The Process of the Matroidal Methodology
In this subsection, we give the process of the matroidal approach to compute attribute reduction in information systems according to the equivalent description in Section 4.1.
In order to obtain all results of an information system IS = (U, A), we need to compute g M(I ND(B)) (X) for all B ⊆ A and X ⊆ U based on Theorem 2. According to Definition 1, we know a reduct of IS will not be ∅.Hence, we only consider B ⊆ A and B = ∅.On the other hand, for all X ⊆ U and B ⊆ A, if |X| ≤ 1, then g M(I ND(B)) (X) = g M(I ND(A)) (X).According to Theorem 2, we only consider X whose |X| ≥ 2. Therefore, the process is shown as follows:

•
Input: , we compute all I ND(B i ) and I ND(A).

•
Step 3: Obtain all results of IS according to Theorem 2.

An Applied Example
Example 8. Let us consider the following information system IS = (U, A) as is shown in Table 2.
for 1 ≤ i ≤ 6 and g A denotes g M(I ND(A)) .All girth functions induced by attribute subsets as is shown in Table 3.

Conclusions
In this paper, we generalize four operators of rough sets to four operators of matroids through the interior axiom, the closure axiom, the exterior axiom and the boundary axiom, respectively.Moreover, we present a matroidal approach to compute attribute reduction in information systems.The main conclusions in this paper and the continuous work to do are listed as follows: 1.
There are four matroids induced by these four operators of rough sets.In fact, these four matroids are the same one, which implies the relationship about operators between rough sets and matroids.
In this work, we assume an equivalence relation.However, there are other structures have been used in rough set theory, among them, tolerance relations [43], similarity relations [44], and binary relations [15,45].Hence, they can suggest as a future research, the possibility of extending their ideas to these types of settings.

2.
The girth function of matroids is used to compute attribute reduction in information systems.This work can be viewed as a bridge linking matroids and information systems in the theoretical impact.In the practical impact, it is a novel method by which calculations will become algorithmic and can be implemented by a computer.Based on this work, we can use the girth function of matroids for attribute reduction in decision systems in the future.3.
In the future, we will further expand the research content of this paper based on some new studies on neutrosophic sets and related algebraic structures [46][47][48][49][50].

2. 2 . Matroids Definition 2 .
(Matroid[29,30]) Let U is a finite set, and I is a nonempty subset of 2 U (the set of all subsets of U). (U, I) is called a matroid, if the following conditions hold: (I1) If I ∈ I and I ⊆ I, then I ∈ I. (I2) If I 1 , I 2 ∈ I and |I 1 | < |I 2 |, then there exists e ∈ I 2 − I 1 such that I 1 {e} ∈ I, where |I| denotes the cardinality of I.

Table 2 .
An information system.

Table 3 .
Girth functions induced by attribute subsets.