Journal of Applied Mathematics

Volume 2012 (2012), Article ID 429737, 16 pages

doi:10.1155/2012/429737

Research Article

Matroidal Structure of Rough Sets Based on Serial and Transitive Relations

Yanfang Liu and William Zhu

Laboratory of Granular Computing, Zhangzhou Normal University, Zhangzhou 363000, China

Received 2 August 2012; Accepted 5 November 2012

Academic Editor: Hector Pomares

Copyright © 2012 Yanfang Liu and William Zhu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery, and data mining. The theory of matroids is a generalization of linear independence in vector spaces. It has been used in combinatorial optimization and algorithm design. In order to take advantages of both rough sets and matroids, in this paper we propose a matroidal structure of rough sets based on a serial and transitive relation on a universe. We define the family of all minimal neighborhoods of a relation on a universe and prove it satisfies the circuit axioms of matroids when the relation is serial and transitive. In order to further study this matroidal structure, we investigate the inverse of this construction: inducing a relation by a matroid. The relationships between the upper approximation operators of rough sets based on relations and the closure operators of matroids in the above two constructions are studied. Moreover, we investigate the connections between the above two constructions.

1. Introduction

The theory of rough sets [1] proposed by Pawlak is an extension of set theory for handling incomplete and inexact knowledge in information and decision systems. And it has been successfully applied to many fields, such as machine learning, granular computing [2], data mining, approximate reasoning, attribute reduction [3–6], and rule induction [7, 8]. For an equivalence relation on a universe, a rough set is a formal approximation of a crisp set in terms of a pair of sets which give the lower and the upper approximations of the original set. In order to meet many real applications, the rough sets have been extended to generalized rough sets based on relations [9–14] and covering-based rough sets [15–17]. In this paper, we focus on generalized rough sets based on relations.

Matroid theory [18] proposed by Whitney is a generalization of linear algebra and graph theory. And matroids have been used in diverse fields, such as combinatorial optimization, algorithm design, information coding, and cryptology. Since a matroid can be defined by many different but equivalent ways, matroid theory has powerful axiomatic systems. Matroids have been connected with other theories, such as rough sets [19–22], generalized rough sets based on relations [23, 24], covering-based rough sets [25, 26] and lattices [27–29].

Rough sets and matroids have their own application fields in the real world. In order to make use of both rough sets and matroids, researchers have combined them with each other and connected them with other theories. In this paper, we propose a matroidal structure based on a serial and transitive relation on a universe and study its relationships with the lower and upper approximations of generalized rough sets based on relations.

First, we define a family of sets of a relation on a universe, and we call it the family of all minimal neighborhoods of the relation. When the relation is serial and transitive, the family of all minimal neighborhoods satisfies the circuit axioms of matroids, then a matroid is induced. And we say the matroid is induced by the serial and transitive relation. Moreover, we study the independent sets of the matroid through the neighborhood and the lower and upper approximation operators of generalized rough sets based on relations, respectively. A sufficient and necessary condition, when different relations generate the same matroid, is investigated. And the relationships between the upper approximation operator of a relation and the closure operator of the matroid induced by the relation are studied. We employ a special type of matroids, called 2-circuit matroids, which is introduced in [22]. When a relation is an equivalence relation, the upper approximation operator of the relation is equal to the closure operator of the matroid induced by the relation if and only if the matroid is a 2-circuit matroid. In order to study the matroidal structure of the rough set based on a serial and transitive relation, we investigate the inverse of the above construction. In other words, we construct a relation from a matroid. Through the connectedness in a matroid, a relation can be obtained and proved to be an equivalence relation. A sufficient and necessary condition, when different matroids induce the same relation, is studied. Moreover, the relationships between the closure operator of a matroid and the upper approximation operator of the relation induced by the matroid are investigated. Especially, for a matroid on a universe, its closure operator is equal to the upper approximation operator of the induced equivalence relation if and only if the matroid is a 2-circuit matroid.

Second, the relationships between the above two constructions are studied. On the one hand, for a matroid on a universe, it can induce an equivalence relation, and the equivalence relation can generate a matroid; we prove that the circuit family of the original matroid is finer than one of the induced matroid. And the original matroid is equal to the induced matroid if and only if the circuit family of the original matroid is a partition. On the other hand, for a reflexive and transitive relation on a universe, it can generate a matroid, and the matroid can induce an equivalence relation, then the relationship between the equivalence relation and the original relation is studied. The original relation is equal to the induced equivalence relation if and only if the original relation is an equivalence relation.

The rest of this paper is organized as follows. In Section 2, we recall some basic definitions of generalized rough sets based on relations and matroids. In Section 3, we propose two constructions between relations and matroids. For a relation on a universe, Section 3.1 defines a family of sets called the family of all minimal neighborhoods and proves it to satisfy the circuit axioms of matroids when the relation is serial and transitive. The independent sets of the matroid are studied. And the relationships between the upper approximation operator of a relation and the closure operator of the matroid induced by the relation are investigated. In Section 3.2, through the circuits of a matroid, we construct a relation and prove it to be an equivalence relation. The relationships between the closure operator of the matroid and the upper approximation operator of the induced equivalence relation are studied. Section 4 represents the relationships between the two constructions proposed in Section 3. Finally, we conclude this paper in Section 5.

2. Preliminaries

In this section, we recall some basic definitions and related results of generalized rough sets and matroids which will be used in this paper.

2.1. Relation-Based Generalized Rough Sets

Given a universe and a relation on the universe, they form a rough set. In this subsection, we introduce some concepts and properties of generalized rough sets based on relations [13]. The neighborhood is important and used to construct the approximation operators.

Definition 2.1 ((neighborhood) see [13]). Let be a relation on . For any , we call the set the successor neighborhood of in . When there is no confusion, we omit the subscript .

In the following definition, we introduce the lower and upper approximation operators of generalized rough sets based on relations through the neighborhood.

Definition 2.2 ((lower and upper approximation operators) see [13]). Let be a relation on . A pair of operators are defined as follows: for all ,

are called the lower and upper approximation operators of , respectively. We omit the subscript when there is no confusion.

We present properties of the lower and upper approximation operators in the following proposition.

Proposition 2.3 (see [13]). Let be a relation on and the complement of in . For all ,

(1L);(1H);(2L);(2H);(3L);(3H);(4LH).

In [30], Zhu has studied the generalized rough sets based on relations and investigated conditions for a relation to satisfy some of common properties of classical lower and upper approximation operators. In the following proposition, we introduce one result used in this paper.

Proposition 2.4. Let be a relation on . Then,

In the following definition, we use the neighborhood to describe a serial relation and a transitive relation on a universe.

Definition 2.5 (see [13]). Let be a relation on .

(1) is serial ;(2) is transitive .

2.2. Matroids

Matroids have many equivalent definitions. In the following definition, we will introduce one that focuses on independent sets.

Definition 2.6 ((matroid) see [18]). A matroid is a pair consisting of a finite universe and a collection of subsets of called independent sets satisfying the following three properties:

(I1);(I2) if and , then ;(I3) if , and , then there exists such that , where denotes the cardinality of .

Since the above definition is from the viewpoint of independent sets to represent matroids, it is also called the independent set axioms of matroids. In order to make some expressions brief, we introduce several symbols as follows.

Definition 2.7 (see [18]). Let be a finite universe and a family of subsets of . Several symbols are defined as follows:

In a matroid, a subset is a dependent set if it is not an independent set. Any circuit of a matroid is a minimal-dependent set.

Definition 2.8 ((circuit) see [18]). Let be a matroid. Any minimal-dependent set in is called a circuit of , and we denote the family of all circuits of by , that is, .

A matroid can be defined from the viewpoint of circuits, in other words, a matroid uniquely determines its circuits, and vice versa.

Proposition 2.9 ((circuit axioms) see [18]). Let be a family of subsets of . Then there exists such that if and only if satisfies the following conditions:

(C1);(C2) if , and , then ;(C3) if , , and , then there exists such that .

The closure operator is one of the important characteristics of matroids. A matroid and its closure operator can uniquely determine each other. In the following definition, we use the circuits of matroids to represent the closure operator.

Definition 2.10 ((closure) see [18]). Let be a matroid and .

is called the closure of with respect to . And is the closure operator of .

3. Two Constructions between Matroid and Relation

In this section, we propose two constructions between a matroid and a relation. One construction is from a relation to a matroid, and the other construction is from a matroid to a relation.

3.1. Construction of Matroid by Serial and Transitive Relation

In [19], for an equivalence relation on a universe, we present a matroidal structure whose family of all circuits is the partition induced by the equivalence relation. Through extending equivalence relations, in this subsection, we propose a matroidal structure which is based on a serial and transitive relation. First, for a relation on a universe, we define a family of sets, namely, the family of all minimal neighborhoods.

Definition 3.1 (the family of all minimal neighborhoods). Let be a relation on . We define a family of sets with respect to as follows:

We call the family of all minimal neighborhoods of .

In the following proposition, we will prove the family of all minimal neighborhoods of a relation on a universe satisfies the circuit axioms of matroids when the relation is serial and transitive.

Proposition 3.2. Let be a relation on . If is serial and transitive, then satisfies (C1), (C2), and (C3) in Proposition 2.9.

Proof. (C1): Since is a serial relation, according to (1) of Definition 2.5, then .

(C2): According to Definitions 3.1 and 2.7, it is straightforward that satisfies (C2).

(C3): If , and , then there exist , and such that . If , that is, , then and . Since is a transitive relation, according to (2) of Definition 2.5, we can obtain that and . According to Definition 3.1, we can obtain which is contradictory with . Therefore, for any , and , when is transitive, then, it is straightforward to see that satisfies (C3) in Proposition 2.9.

It is natural to ask the following question: “when the family of all minimal neighborhoods of a relation satisfies the circuit axioms of matroids, is the relation serial and transitive?”. In the following proposition, we will solve this issue.

Proposition 3.3. Let be a relation on . If satisfies (C1), (C2), and (C3) in Proposition 2.9, then is serial.

Proof. According to (C1) of Proposition 2.9 and Definition 3.1, for any . According to Definition 2.5, is serial.

When the family of all minimal neighborhoods of a relation satisfies the circuit axioms of matroids, the relation is not always a transitive relation as shown in the following example.

Example 3.4. Let and a relation on . Since , then . According to Proposition 2.9, satisfies the circuit axioms of matroids. We see that , but , so is not transitive.

In this paper, we consider that the family of all minimal neighborhoods of a relation can generate a matroid when the relation is serial and transitive.

Definition 3.5. Let be a serial and transitive relation on . The matroid with as its circuit family is denoted by , where . We say is the matroid induced by .

The matroid induced by a serial and transitive relation can be illustrated by the following example.

Example 3.6. Let and a serial and transitive relation on . Since , then . Therefore, where .

Generally speaking, a matroid is defined from the viewpoint of independent sets. In the following, we will investigate the independent sets of the matroid induced by a serial and transitive relation.

Proposition 3.7. Let be a serial and transitive relation on and the matroid induced by . Then,

Proof. According to Definition 3.5, .

: for all , that is, , according to Definitions 2.7 and 3.1, there exists such that . Hence , that is, . This proves that .: suppose , that is, . Then there exists such that , in other words, , that is, . This proves that .

To illustrate the independent sets of a matroid induced by a serial and transitive relation, the following example is given.

Example 3.8. Let and a serial and transitive relation on . Since , then . Therefore where ,.

The lower and upper approximation operators are constructed through the neighborhood in generalized rough sets based on relations. In the following proposition, we will study the independent sets of the matroid induced by a serial and transitive relation through the lower approximation operator.

Proposition 3.9. Let be a serial and transitive relation on and the matroid induced by . Then,

Proof. According to Definition 2.2 and Proposition 3.7, it is straightforward.

Because of the duality of the lower and upper approximation operators, we obtain the independent sets of the matroid induced by a serial and transitive relation through the upper approximation operator.

Corollary 3.10. Let be a serial and transitive relation on and the matroid induced by . Then,

Proof. According to (4LH) of Propositions 2.3 and 3.9, it is straightforward.

From Examples 3.6 and 3.8, we see that two different relations on a universe generate the same matroid. We study under what conditions two relations on a universe can generate the same matroid. If a relation is transitive, then the reflexive closure of the relation is transitive, but the symmetric closure of the relation is not always transitive. Therefore, we consider the relationship between the matroids induced by a serial and transitive relation and the reflexive closure of the relation. First, we introduce the reflexive closure of a relation on a nonempty universe.

Definition 3.11 ((reflexive closure of a relation) see [31]). Let be a nonempty universe and a relation on . We denote as the reflexive closure of , where .

The relationship between the two matroids induced by a serial and transitive relation and its reflexive closure is studied in the following proposition.

Proposition 3.12. Let be a serial and transitive relation on . Then .

Proof. According to Proposition 2.9, we need only to prove . According to Definition 3.1, and . According to Definition 3.11, , then .

: for all , on the one hand, , then . On the other hand, . Since is serial, then there exists such that . Since is transitive, then . And , then . Therefore, , that is, . In other words, . Hence .: for all , that is, . If , then . If , that is, , then . If , then there exists such that and . Since is serial, then there exists such that . And is transitive, then . Therefore , that is, . Hence which is contradictory with . Since is serial, then there exists such that . Since is transitive, then . And , then , that is, which is contradictory with . Hence , that is, .

In fact, for a universe, any different relations generate the same matroid if and only if the families of all minimal neighborhoods are equal to each other according to Proposition 2.9.

It is known that the upper approximation operator induced by a reflexive and transitive relation is exactly the closure operator of a topology [11, 32, 33]. We see that a matroid has its own closure operator. In this paper, we will not discuss the relationship between the closure operator of a topology and one of a matroid. We will study the connection between the upper approximation operator of a rough set and the closure operator of a matroid. In the following, we investigate the relationship between the upper approximation operator of a relation and the closure operator of the matroid induced by the relation.

In a matroid, the closure of any subset contains the subset itself. When a relation on a universe is reflexive, the upper approximation of any subset contains the subset itself. If a relation is reflexive, then it is serial. According to Definition 3.1, a reflexive and transitive relation can induce a matroid. We will study the relationship between the upper approximation operator induced by a reflexive and transitive relation and the closure operator of the matroid induced by the relation. A counterexample is given in the following.

Example 3.13. Let and a reflexive and transitive relation on . Since , then . Therefore, . Since , then and .

From the above example, we see that the closure operator of the matroid induced by a reflexive and transitive relation dose not correspond to the upper approximation operator of the relation. A condition, when the closure operator contains the upper approximation operator, is studied in the following proposition. First, we present a remark.

Remark 3.14. Suppose is an equivalence relation on . According to Definition 2.2 and Proposition 2.4, s.t. . According to Definition 3.1, .

Proposition 3.15. Let be an equivalence relation on and the matroid induced by . If for all , then for all .

Proof. According to Definition 2.10, we need only to prove that s.t. . Since is an equivalence relation, and for all , then and for all . When , that is, , then s.t. , therefore s.t. . When , for all s.t. , then , that is, s.t. . To sum up, this completes the proof.

In fact, for an equivalence relation on a universe and any subset of the universe, its closure with respect to the induced matroid can be expressed by the union of its upper approximation with respect to the relation and the family of some elements whose neighborhood is equal to itself.

Proposition 3.16. Let be an equivalence relation on and the matroid induced by . If for all , then for all .

Proof. We need only to prove s.t. . Since is equivalence relation and for all , then for all . Therefore, it is straightforward to obtain s.t. , that is, .

Similarly, can the upper approximation operator of an equivalence relation contain the closure operator of the matroid induced by the equivalence relation when the cardinality of any circuit of the matroid is equal or greater than 2?

Proposition 3.17. Let be an equivalence relation on and the matroid induced by . If for all , then for all .

Proof. According to Definition 2.10, we need only to prove s.t. s.t. . For all s.t. , then . And , then there exists at least an element such that , that is, s.t. . To sum up, this completes the proof.

A sufficient and necessary condition, when the upper approximation operator of an equivalence relation is equal to the closure operator of the matroid induced by the equivalence relation, is investigated in the following theorem. First, we introduce a special matroid called 2-circuit matroid.

Definition 3.18 ((2-circuit matroid) see [22]). Let be a matroid. If for all , then we say is a 2-circuit matroid.

Theorem 3.19. Let be an equivalence relation on and the matroid induced by . is a 2-circuit matroid if and only if for all .

Proof. According to Definition 2.10, we need only to prove for all , if and only if s.t. for all .

: according to Propositions 3.15 and 3.17, it is straightforward.: we prove this by reductio.

On the one hand, suppose there exists such that . Suppose . Then . According to (1H) of Proposition 2.3, . Therefore which is contradictory with for all .

On the other hand, suppose there exists such that . Suppose , then s.t. . Since , then , which is contradictory with s.t. for all . Therefore, for all , .

3.2. Construction of Equivalence Relation by Matroid

In order to further study the matroidal structure of the rough set based on a serial and transitive relation, we consider the inverse of the construction in Section 3.1: inducing a relation by a matroid. Firstly, through the connectedness in a matroid, a relation can be obtained.

Definition 3.20 (see [34]). Let be a matroid. We define a relation on as follows: for all ,

We say is induced by .

The following example is to illustrate the construction of a relation from a matroid.

Example 3.21. Let be a matroid, where and . Since , then according to Definition 3.20, .

In fact, according to Definition 3.20, the relation induced by a matroid is an equivalence relation.

Proposition 3.22 (see [34]). Let be a matroid. Then is an equivalence relation on .

The following example is presented to illustrate that different matroids generate the same relation.

Example 3.23. Let be two matroids where and . Since , according to Definition 3.20, then , .

Similarly, we will study the relationship between the closure operator of a matroid and the upper approximation operator of the equivalence relation induced by the matroid in the following proposition.

Proposition 3.24. Let be a matroid and the relation induced by . If , then for all .

Proof. Since is an equivalence relation, according to Definition 2.10, we need only to prove s.t. s.t. . Since , then for all . For all s.t. , there exists at least one element such that . According to Definition 3.20, , that is, . Therefore s.t. . To sum up, this completes the proof.

The above proposition can be illustrated by the following example.

Example 3.25. Let be a matroid where and ,. Since ,  then . Therefore and   . Hence for all , .

According to Proposition 3.24, the closure operator of a matroid is contained in the upper approximation operator of the relation induced by the matroid, when the closure of empty set is equal to empty set. We consider an issue that when the closure of empty set is not equal to empty set, can the closure operator contain the upper approximation operator? A counterexample is given in the following.

Example 3.26. Let and a matroid on , where ,. Since , then . Since , then . Therefore, .

Under what condition the closure operator contains the upper approximation operator? In the following proposition, we study this issue.

Proposition 3.27. Let be a matroid and the relation induced by . If for all , then for all .

Proof. According to Proposition 3.22 and Definitions 2.2 and 2.10, we need only to prove s.t. s.t. . For all s.t. , then . According to Definition 3.20, there exists such that . Since for all , then , that is, . Therefore, s.t. . To sum up, this completes the proof.

In the following theorem, we investigate a sufficient and necessary condition when the closure operator of a matroid is equal to the upper approximation operator of the relation induced by the matroid.

Theorem 3.28. Let be a matroid and the relation induced by . For all , if and only if or is a 2-circuit matroid.

Proof. (1) Since , according to Definition 3.20, . According to Definition 2.10, for all , . And according to Definition 2.2, for all , . Therefore, for all . Similarly, if , then .

(2) According to Proposition 3.22 and Definitions 2.2 and 2.10, we need only to prove s.t. s.t. if and only if is a 2-circuit matroid.

: since is a 2-circuit matroid, then for all . s.t. s.t. s.t. , , s.t.   s.t. .: according to Propositions 3.24 and 3.27, it is straightforward.

4. Relationships between the Two Constructions

In this section, we study the relationships between the two constructions in Section 3. The first construction takes a relation and yields a matroid, and the second construction takes a matroid and then yields a relation. Firstly, given a matroid, it can generate an equivalence relation, and the equivalence relation can generate a matroid, then the connection between the original matroid and the induced matroid is built. In order to study the connection, we introduce the definition of the finer set family on a universe.

Definition 4.1. Let be two set families on . If for all , there exists such that , then we say is finer than and denote it as .

In the following proposition, we will represent the relationship between the circuits of a matroid and the circuits of the matroid induced by the equivalence relation which is generated by the original matroid.

Proposition 4.2. Let be a matroid. Then .

Proof. For all , suppose . According to Definition 3.20, we can obtain . According to Proposition 3.22, is an equivalence relation on , then . According to Definitions 3.1 and 3.5, . Since and , then there exists such that . According to Definition 4.1, .

In order to further comprehend Proposition 4.2, the following example is given.

Example 4.3. Let a matroid, where and . Since , according to Definition 3.20, ,, . According to Definitions 3.1 and 3.5, . Therefore .

A matroid can induce an equivalence relation, and the equivalence relation can generate a matroid, then a sufficient and necessary condition when the original matroid is equal to the induced matroid is studied in the following theorem.

Theorem 4.4. Let be a matroid. Then, if and only if is a partition on .

Proof. According to Proposition 3.7, we need only to prove if and only if is a partition on .

: according to Proposition 3.22, is an equivalence relation on . According to Definitions 3.1 and 3.5, . Since , then is a partition on .: if is a partition on , according to Definition 3.20, then . According to Definitions 3.1 and 3.5, then . Therefore .

Similarly, a serial and transitive relation can generate a matroid, and the matroid can generate an equivalence relation, then the relationship between the original relation and the induced equivalence relation is studied as follows. First, we present a lemma about the transitivity of a relation.

Lemma 4.5. Let be a transitive relation on . For all , if , then .

Proof. Suppose , then there exists such that , that is, . According to Definition 2.5, . Since , then , which is contradictory with . Therefore, .

If a relation is reflexive, then it is also serial. Therefore, a reflexive and transitive relation can generate a matroid according to Definition 3.5.

Proposition 4.6. Let be a reflexive and transitive relation on . Then .

Proof. According to Definitions 3.20, 3.1, and 3.5, we can obtain that for all , if , then there exists such that , that is, . Since is reflexive and transitive, then , that is, . Since , according to Lemma 4.5, , then , that is, . Since , that is, , and is transitive, then . Since is reflexive, then for all . Hence .

The above proposition can be illustrated by the following example.

Example 4.7. Let and , a reflexive and transitive relation on . Since , then . Therefore, , ,. We can see that .

A sufficient and necessary condition, when the relation is equal to the induced equivalence relation, is investigated in the following theorem.

Theorem 4.8. Let be a serial and transitive relation on . Then, if and only if is an equivalence relation.

Proof. (⇒) according to Proposition 3.22, is an equivalence relation on . Since , then is an equivalence relation.

(⇐) is an equivalence relation, then . According to Definition 3.20 and Proposition 3.22, it is straightforward to prove that .

5. Conclusions

In order to broaden the theoretical and application fields of rough sets and matroids, their connections with other theories have been built. In this paper, we connected matroids and generalized rough sets based on relations. For a serial and transitive relation on a universe, we proposed a matroidal structure through the neighborhood of the relation. First, we defined the family of all minimal neighborhoods of a relation on a universe and proved it to satisfy the circuit axioms of matroids when the relation was serial and transitive. The independent sets of the matroid were studied, and the connections between the upper approximation operator of the relation and the closure operator of the matroid were investigated. In order to study the matroidal structure of the rough set based on a serial and transitive, we investigated the inverse of the above construction: inducing a relation by a matroid. Through the connectedness in a matroid, a relation was obtained and proved to be an equivalence relation. And the closure operator of the matroid was equal to the upper approximation operator of the induced equivalence relation if and only if the matroid was a 2-circuit matroid. Second, the relationships between the above two constructions were investigated. For a matroid on a universe, it induced an equivalence relation, and the equivalence relation generated a matroid, then the original matroid was equal to the induced matroid if and only if the circuit family of the original matroid was a partition on the universe. For a serial and transitive relation on a universe, it generated a matroid, and the matroid induced an equivalence relation, then the original relation was equal to the induced equivalence relation if and only if the original relation was an equivalence relation.

Acknowledgments

This work is supported in part by the National Natural Science Foundation of China under Grant no. 61170128, the Natural Science Foundation of Fujian Province, China, under Grant nos. 2011J01374 and 2012J01294, and the Science and Technology Key Project of Fujian province, China, under Grant no. 2012H0043.

References

Z. Pawlak, “Rough sets,” International Journal of Computer & Information Sciences, vol. 11, no. 5, pp. 341–356, 1982.

S. Calegari and D. Ciucci, “Granular computing applied to ontologies,” International Journal of Approximate Reasoning, vol. 51, no. 4, pp. 391–409, 2010.

M. A. Hall and G. Holmes, “Benchmarking attribute selection techniques for discrete class data mining,” IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 6, pp. 1437–1447, 2003.

D. Q. Miao, Y. Zhao, Y. Y. Yao, H. X. Li, and F. F. Xu, “Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model,” Information Sciences, vol. 179, no. 24, pp. 4140–4150, 2009.

F. Min, H. He, Y. Qian, and W. Zhu, “Test-cost-sensitive attribute reduction,” Information Sciences, vol. 18, pp. 4928–4942, 2011.

W. Zhang, G. Qiu, and W. Wu, “A general approach to attribute reduction in rough set theory,” Science in China Series F, vol. 50, no. 2, pp. 188–197, 2007.

Y. Chen, D. Miao, and R. Wang, “A rough set approach to feature selection based on ant colony optimization,” Pattern Recognition Letters, vol. 31, no. 3, pp. 226–233, 2010.

J. Dai and Q. Xu, “Approximations and uncertainty measures in incomplete information systems,” Information Sciences, vol. 198, pp. 62–80, 2012.

M. Kryszkiewicz, “Rough set approach to incomplete information systems,” Information Sciences, vol. 112, no. 1–4, pp. 39–49, 1998.

Q. Liu and J. Wang, “Semantic analysis of rough logical formulas based on granular computing,” in Proceedings of the IEEE International Conference on Granular Computing, pp. 393–396, May 2006.

K. Qin, J. Yang, and Z. Pei, “Generalized rough sets based on reflexive and transitive relations,” Information Sciences, vol. 178, no. 21, pp. 4138–4141, 2008.

R. Slowinski and D. Vanderpooten, “A generalized definition of rough approximations based on similarity,” IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 2, pp. 331–336, 2000.

Y. Y. Yao, “Constructive and algebraic methods of the theory of rough sets,” Information Sciences, vol. 109, no. 1–4, pp. 21–47, 1998.

Y. Y. Yao, “Relational interpretations of neighborhood operators and rough set approximation operators,” Information Sciences, vol. 111, no. 1–4, pp. 239–259, 1998.

Z. Bonikowski, E. Bryniarski, and U. Wybraniec-Skardowska, “Extensions and intentions in the rough set theory,” Information Sciences, vol. 107, no. 1–4, pp. 149–167, 1998.

W. Zhu, “Topological approaches to covering rough sets,” Information Sciences, vol. 177, no. 6, pp. 1499–1508, 2007.

W. Zhu and F. Y. Wang, “Reduction and axiomization of covering generalized rough sets,” Information Sciences, vol. 152, pp. 217–230, 2003.

H. Lai, Matroid Theory, Higher Education Press, Beijing, China, 2001.

Y. Liu and W. Zhu, “Characteristic of partition-circuit matroid through approximation number,” in Proceedings of the IEEE International Conference on Granular Computing, pp. 376–381, 2012.

Y. Liu, W. Zhu, and Y. Zhang, “Relationship between partition matroid and rough set through k-rank matroid,” Journal of Information and Computational Science, vol. 8, pp. 2151–2163, 2012.

J. Tang, K. She, and W. Zhu, “Matroidal structure of rough sets from the viewpoint of graph theory,” Journal of Applied Mathematics, vol. 2012, Article ID 973920, 27 pages, 2012.

S. Wang, Q. Zhu, W. Zhu, and F. Min, “Matroidal structure of rough sets and its characterization to attribute reduction,” Knowledge-Based Systems, vol. 36, pp. 155–161, 2012.

W. Zhu and S. Wang, “Matroidal approaches to generalized rough sets based on relations,” International Journal of Machine Learning and Cybernetics, vol. 2, pp. 273–279, 2011.

S. Zhang, X. Wang, T. Feng, and L. Feng, “Reduction of rough approximation space based on matroid,” in Proceedings of the International Conference on Machine Learning and Cybernetics, vol. 2, pp. 267–272, 2011.

S. Wang and W. Zhu, “Matroidal structure of covering-based rough sets through the upper approximation number,” International Journal of Granular Computing, Rough Sets and Intelligent Systems, vol. 2, pp. 141–148, 2011.

S. Wang, Q. Zhu, W. Zhu, and F. Min, “Quantitative analysis for covering-based rough sets through the upper approximation number,” Information Sciences, vol. 220, pp. 483–491, 2013.

M. Aigner and T. A. Dowling, “Matching theory for combinatorial geometries,” Transactions of the American Mathematical Society, vol. 158, pp. 231–245, 1971.

H. Mao, “The relation between matroid and concept lattice,” Advances in Mathematics, vol. 35, pp. 361–365, 2006.

F. Matúš, “Abstract functional dependency structures,” Theoretical Computer Science, vol. 81, no. 1, pp. 117–126, 1991.

W. Zhu, “Generalized rough sets based on relations,” Information Sciences, vol. 177, no. 22, pp. 4997–5011, 2007.

P. Rajagopal and J. Masone, Discrete Mathematics for Computer Science, Saunders College, Toronto, Canada, 1992.

J. Kortelainen, “On relationship between modified sets, topological spaces and rough sets,” Fuzzy Sets and Systems, vol. 61, no. 1, pp. 91–95, 1994.

L. Yang and L. Xu, “Topological properties of generalized approximation spaces,” Information Sciences, vol. 181, no. 17, pp. 3570–3580, 2011.

J. G. Oxley, Matroid Theory, Oxford University Press, 1993.