Journal of Applied Mathematics

Volume 2013 (2013), Article ID 254797, 8 pages

http://dx.doi.org/10.1155/2013/254797

Research Article

Covering-Based Rough Sets on Eulerian Matroids

Bin Yang, Ziqiong Lin, and William Zhu

Lab of Granular Computing, Minnan Normal University, Zhangzhou 363000, China

Received 3 May 2013; Accepted 8 July 2013

Academic Editor: Zhihong Guan

Copyright © 2013 Bin Yang et al. 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.

Rough set theory is an efficient and essential tool for dealing with vagueness and granularity in information systems. Covering-based rough set theory is proposed as a significant generalization of classical rough sets. Matroid theory is a vital structure with high applicability and borrows extensively from linear algebra and graph theory. In this paper, one type of covering-based approximations is studied from the viewpoint of Eulerian matroids. First, we explore the circuits of an Eulerian matroid from the perspective of coverings. Second, this type of covering-based approximations is represented by the circuits of Eulerian matroids. Moreover, the conditions under which the covering-based upper approximation operator is the closure operator of a matroid are presented. Finally, a matroidal structure of covering-based rough sets is constructed. These results show many potential connections between covering-based rough sets and matroids.

1. Introduction

Various theories and methods have been proposed to deal with incomplete and insufficient information in classification, concept formation, and data analysis in data mining. For example, fuzzy set theory [1–3], rough set theory [4, 5], computing with words [6, 7], and linguistic dynamic systems [8] have been developed and applied to real-world problems. Classical rough sets were originally proposed by Pawlak as a useful tool for dealing with the fuzzy and uncertain problems in information systems and have already been an efficient tool for data pre-process and widely used in fields such as process control, economics, medical diagnosis, conflict analysis, and other fields [9–12]. Covering-based rough set has been proposed as a generalization of classical rough set and the study on it is necessary and important. Particularly, with the fast development of computer science and technology in recent years, how to use the effective mathematical tools to solve practical problems has become more and more essential. Of course, as an efficient tool, the study on covering-based rough sets is fetching in more and more researchers. Zhu [12] investigated some basic properties of covering-based rough sets and their comparisons with the corresponding ones of classical rough sets. Zhang et al. [10] investigated three types of covering-based rough sets with an axiomatic approach. In addition, some detailed works of covering-based rough sets can be found in the literatures [13–17]. Therefore, there is profound theoretical and practical significance to study the covering-based rough sets.

The concept of matroids was originally introduced by Whitney [18] in 1935 as a generalization of graph theory and linear algebra. Matroid theory is a structure that generalizes linear independence in vector spaces and has a variety of applications in many fields such as algorithm design [19] and combinatorial optimization [20]. In theory, matroid theory provides a good platform to connect it with other theories. Some interesting results about the connection between matroid theory and rough set theory can be found in the literatures [21–25].

In this paper, through Eulerian matroids, one type of covering-based approximation operators is represented through the perspective of Eulerian matroids. First, since the family of circuits of an Eulerian matroid is a covering, then the properties, such as irreducible, semireduced, and minimal description, are investigated from the viewpoint of coverings. Second, the second type of covering-based upper and lower approximation operators is represented by the circuits of the Eulerian matroid. In fact, some types of covering-based lower approximation operators are equal, and they can be represented by the circuits of the restriction matroids of Eulerian matroids. Moreover, we obtain the condition under which the covering-based upper approximation operator is the closure operator of a matroid. Finally, a matroidal structure of covering-based rough sets is constructed by a type of covering with some special properties.

The remainder of this paper is organized as follows. In Section 2, some basic concepts and properties related to covering-based rough sets and matroids are introduced. In Section 3, some properties of the covering induced by an Eulerian matroid are investigated. Moreover, the focus here is the covering-based approximation operators denoted by the circuits of Eulerian matroids. In Section 4, a matroidal structure of covering-based rough sets is constructed by a type of covering with some special properties. Section 5 concludes this paper.

2. Preliminaries

In this section, we review some fundamental definitions and results of covering-based rough sets and matroids.

2.1. Covering-Based Rough Sets

In this subsection, we recall some basic definitions and results of covering-based rough sets used in this paper. For detailed descriptions about covering-based rough sets, please refer to [9, 11, 12, 26].

Definition 1 (covering [11]). Let be a universe of discourse, a family of subsets of . If none of subsets in is empty, and , then is called a covering of  .

It is clear that a partition of   is certainly a covering of  , so the concept of a covering is an extension of the concept of a partition. In the following discussion, the universe of discourse is considered to be finite.

Definition 2 (covering-based approximation space [11]). Let be a universe of discourse and a covering of . The ordered pair is called a covering-based approximation space.

Definition 3 (minimal description [11]). Letting be a covering-based approximation space, , then set family

is called the minimal description of .

Definition 4 (unary covering [12]). Let be a covering of  . is called unary if  .

Definition 5 (representative element [12]). Let be a covering of  . If satisfies the following condition:

then is called a representative element of .

Definition 6 (representative covering [12]). Let be a covering of  . If , has a representative element, one says is representative.

Definition 7 (exact covering [12]). Let be a covering of  . If ,

one says the covering is exact.

The following lemma shows that the concepts of representative and exact coverings are equivalent.

Lemma 8 (see [12]). Let be a covering of  . is representative if and only if   is exact.

2.2. Matroids

Matroid theory was established as a generalization of graph theory and linear algebra. This theory was used to study abstract relations on a subset, and it used both of these areas of mathematics for its motivation, its basic examples, and its notation. With the rapid development of matroid theory in recent years, it has already become an effective mathematical tool to study other mathematic branches. In this subsection, we recall some definitions, examples, and results of matroids.

Definition 9 (matroid [27]). A matroid is an ordered pair , where is a finite set and a family of subsets of with the following three properties:

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

Any element of is called an independent set.

Example 10. Let be the graph as shown in Figure 1. Denote , that is, , . Then is a matroid, where .

Figure 1: A graph.

In fact, if a subset is not an independent set, then it is a dependent set of the matroid. In other words, the dependent set of a matroid generalizes the cycle in graphs. Based on the dependent set, we introduce other concepts of a matroid. For this purpose, several denotations are presented in the following definition.

Definition 11 (see [27]). Let be a family of subsets of  . One can denote

 , , , , , , where .

Definition 12 (base [27]). Let be a matroid. A maximal independent set in is called a base of , and one denotes the family of all bases of by , that is, .

Example 13 (continued from Example 10). According to Definition 12, we have .

A matroid and its bases are uniquely determined by each other. In other words, a matroid can also be defined from the viewpoint of the base.

Theorem 14 (base axiom [27]). Let be a family of subsets of  . Then there exists such that if and only if satisfies the following two conditions:

(B1);(B2) if and , then there exists such that .

Definition 15 (circuit [27]). Let be a matroid. A minimal dependent set in is called a circuit of , and one denotes the family of all circuits of by , that is,

Example 16 (continued from Example 10). According to Definition 15, we have .

Theorem 17 (circuit axiom [27]). Let , be a matroid and . Then satisfies the following three properties:

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

A matroid uniquely determines its circuits and vice versa. The following theorem shows that a matroid can be defined from the viewpoint of circuits.

Theorem 18 (see [27]). Let be a nonempty and finite set and a family of subsets of  . If satisfies (C1), (C2), and (C3) of Theorem 17, then there exists , such that .

Definition 19 (rank function [27]). Let , be a matroid. One can define the rank function of as follows: for all ,

is calledthe rank of in .

Based on the rank function of a matroid, one can define the closure operator, which reflects the dependency between a set and elements.

Definition 20 (closure [27]). Let be a matroid. The closure operator of is defined as for all . is called the closure of in .

3. Covering-Based Rough Sets on Eulerian Matroids

In this section, we provide equivalent formulations of some important concepts and properties of covering-based rough sets from the viewpoint of Eulerian matroids. Specifically, the covering-based upper and lower approximation operators are characterized by the circuits of matroids. For this purpose, some definitions and properties of the covering induced by an Eulerian matroid are presented.

The following definition introduces Eulerian matroids, which is a special kind of matroids, and has sound theoretical foundations and wide applications.

Definition 21 (Eulerian matroid [27]). Let , be a matroid. If there exist such that and , then one says is an Eulerian matroid.

Example 22. Let be the graph as shown in Figure 2. Denote does a cycle of , that is, . Then there exists a matroid such that , where . Clearly, is an Eulerian matroid.

Figure 2: A graph.

According to the above definition, it is clear that is a covering of . In other words, we construct a covering by an Eulerian matroid.

Example 23 (continued from Example 22). It is easy to check that the set family , is a covering of .

Proposition 24. Let be an Eulerian matroid and . Then

Proof. It is obvious . Suppose . Hence . Suppose . Then there exists such that and . It is contradiction to (C2) of Theorem 17.

Example 25 (continued from Example 22). We have

In fact, the concepts of unary covering, representative covering, and exact covering play a vital role in covering-based rough sets. Based on the properties of the Eulerian matroid and the above proposition, the following remark is presented.

Remark 26. If is an Eulerian matroid, then is not a representative covering. In other words, is not an exact covering.

Example 27 (continued from Example 22). It is easy to know is not a representative and exact covering of .

Proposition 28. Let be an Eulerian matroid. Then is a unary covering if and only if is a partition of  .

Proof. (): Let be a unary covering of and . Then . If is not a partition of , then there exists such that there exist , and , that is, . It is contradictory.

(): It is straightforward.

Example 29 (continued from Example 22). Clearly, according to Proposition 28, since is not a partition of  , then is not a unary covering of  .

In covering-based rough sets, a pair of covering-based approximation operators are used to describe an object. In the following definition, a widely used pair of covering-based approximation operators are introduced.

Definition 30 (covering-based approximation set family [12]). Let be a covering of  . For any set , set families

are called the covering-based lower and upper approximation set families of , respectively.

Definition 31 (covering-based approximation operator [12]). Let be a covering of  . For any set ,

are called the covering-based lower and upper approximations of , respectively.

Definition 32 (restriction matroid [27]). Let be a matroid and . Suppose . Then is a matroid and called the restriction matroid of in . One denotes the restriction matroid of in as , that is, .

In the following proposition, a widely used pair of covering-based approximation operators are represented by the circuits of Eulerian matroids.

Proposition 33. Let be an Eulerian matroid and . Then

Proof. Let . According to Definition 30, we need to prove only . On one hand, for any , we have and . Since , then, for any , and hold. Hence, , that is, and . On the other hand, for any and any , it is easy to prove . Since and , then . Therefore, . Since , then holds.

Example 34. Let be a matroid, where and . Clearly, is an Eulerian matroid and a covering of  . Suppose , , and . Then

Similarly, according to the above proposition, we can obtain the following proposition.

Proposition 35. Let be an Eulerian matroid and . Then

Proof. It is easy to prove this proposition by Definition 31 and Proposition 33.

Example 36 (continued from Example 34). As shown in Example 34, the covering-based lower and upper approximation sets of , , and , respectively, are , , , , , .

The above proposition shows that the covering-based lower and covering-based upper approximation operators of covering-based rough sets can be denoted by the circuits of matroids. Li and Liu [21] have already proved the closure operator of matroids and covering-based upper approximation operator are equivalent if and only if the covering is unary. Based on their works, the following proposition can be presented.

Proposition 37. Let be an Eulerian matroid. For any , if and only if is a partition of .

Proof. According to Proposition 28, is a unary covering if and only if is a partition of . Hence, this proposition is easy to prove.

Example 38. Let be an Eulerian matroid, where and . Suppose , , and . Then , , and , and , and .

Proposition 39. Let be an Eulerian matroid. For any , if and only if  .

Proof. (): Suppose . Clearly, it is easy to see according to Proposition 33. If there exists such that , then . Thus . Clearly, it is a contradiction to . Then for any , that is, . Hence .

(): Suppose . Then there exists such that , that is, . Thus . Hence ; it is a contradiction to . Then .

In fact, the above proposition indicates that the independent sets of an Eulerian matroid can be judged from the viewpoint of covering-based rough sets.

Example 40 (continued from Example 38). Since , and , then , , and .

In fact, it is easy to find that the circuits of an Eulerian matroid contain a partition of the universe at least. Therefore, we study the relationships between the circuits of an Eulerian matroid and its subset family.

Proposition 41. Let be an Eulerian matroid and . Then there exists a partition such that and , where are the classical approximation operators.

Proof. It is easy to prove this proposition by Definition 31 and Proposition 35.

Example 42 (continued from Example 38). It is not difficult to find that . Hence, the covering-based upper and lower approximation operators are the classical upper and lower approximation operators, respectively.

Proposition 43. Let be an Eulerian matroid and . Then if and only if .

Proof. : Suppose there exists such that . Then there exists such that and . Since , then . It is contradictory. Thus .

: Since holds for any , then .

Similarly, according to the above proposition, the following proposition can be presented.

Proposition 44. Let be an Eulerian matroid and . Then if and only if .

Since a family of circuits determines only one matroid, then the relationship between two coverings, which are induced by two Eulerian matroids, is presented in the following proposition.

Proposition 45. Let and be two Eulerian matroids. If , then there exists such that and .

In fact, the above proposition shows that different Eulerian matroids induce different covering-based approximation spaces and different covering-based approximation operators.

The above results show that many important concepts and properties of covering-based rough sets can be concisely characterized by corresponding concepts and properties in matroids. Therefore, covering-based rough sets may be efficient to study matroids.

4. The Eulerian Matroid Induced by a Covering

From the above definitions and properties, we know that the circuits of an Eulerian matroid can construct only one covering-based approximation space. Now, in this section, we wonder if a covering of forms the family of circuits of an Eulerian matroid, what conditions should the covering satisfies? For this purpose, the concepts of antichain and blocker are introduced.

Definition 46 (antichain [27]). Let be a family of subsets of . If, for any , and hold, then one says is an antichain of .

According to the above definition, it is easy to see that the family of circuits and the family of bases of a matroid are all antichains.

Definition 47 (blocker [27]). Let be an antichain of  . Then the blocker of can be denoted as follows:

Example 48. Let be a family of subsets of . Clearly, is an antichain of . Suppose is the blocker of . Then , .

Theorem 49 (see [27]). Let be a matroid. Then there exists another matroid on , whose family of all bases is equal to .

According to the above theorem, we introduce the concept of the dual matroid.

Definition 50 (dual matroid [27]). The matroid whose family of all bases is equal to is called the dual matroid of and is denoted as . In particular, if , is called an identically self-dual matroid.

Lemma 51 (see [27]). If is a matroid, then

Now, based on the above results, a matroidal structure of covering-based rough sets will be constructed. Firstly, the concept of Eulerian covering is defined in the following definition.

Definition 52 (Eulerian covering). An Eulerian covering is a covering of   with the following properties:

(EC1) is an antichain;(EC2) there exist such that is a partition of  , where ;(EC3) if , and , then there exists such that .

Example 53. Let and , , , . Clearly, is a covering of and satisfies (EC1), (EC2), and (EC3) of Definition 52; then is an Eulerian covering of  .

In fact, an Eulerian covering of a universe in compliance with the above definition satisfies the circuit axiom. In other words, it determines an Eulerian matroid.

Proposition 54. Let be an Eulerian covering of . Then satisfies (C1), (C2), and (C3) of Theorem 17.

Proof. It is easy to prove this proposition by Theorem 17 and Definition 52.

Example 55 (continued from Example 53). As shown in Example 53, is the family of circuits of an Eulerian matroid . Clearly, and .

Definition 56. Let be an Eulerian covering on . The Eulerian matroid whose circuit set is is denoted by .

In fact, a partition of a universe is an Eulerian covering. Hence, a matroidal structure of classical rough sets is constructed in the following proposition.

Proposition 57. Let be an equivalence relation on . Then there exists an Eulerian matroid such that .

Proof. It is easy to prove that every partition of is an Eulerian covering. Hence, the proof of this proposition has already been finished.

Proposition 58. Let be an equivalence relation on . Then

Proof. For any , it is obvious . Then according to Lemma 51, we know that .

Example 59. Let and . Then is the family of circuits of an Eulerian matroid induced by . In addition, suppose is the dual matroid of . Then

Proposition 60. Let be an Eulerian covering of and the dual matroid of . Then

Proof. It is easy to prove this proposition by Lemma 51 and Proposition 33.

Example 61 (continued from Example 53). An Eulerian covering of induces an Eulerian matroid . Suppose is the dual matroid of . Then .

5. Conclusions

In this paper, we studied one type of covering-based rough sets on Eulerian matroids. Via inducing a covering from the circuits of an Eulerian matroid, the covering-based approximation operators were represented from the viewpoint of Eulerian matroids. First, we studied the properties of the covering induced by an Eulerian matroid and the properties of the covering-based approximation operators through Eulerian matroids. Second, the relationships between two covering-based approximation spaces induced by two Eulerian matroids were explored. Finally, a matroidal structure of covering-based rough sets was constructed.

Acknowledgments

This work is in part supported by the National Science Foundation of China under Grant nos. 61170128, 61379049, and 61379089, the Natural Science Foundation of Fujian Province, China, under Grant no. 2012J01294, the Fujian Province Foundation of Higher Education under Grant no. JK2012028, and the Education Department of Fujian Province under Grant no. JA12222.

References

Z. Pawlak, “Rough sets and fuzzy sets,” Fuzzy Sets and Systems, vol. 17, no. 1, pp. 99–102, 1985.

B. Sun, Z. Gong, and D. Chen, “Fuzzy rough set theory for the interval-valued fuzzy information systems,” Information Sciences, vol. 178, no. 13, pp. 2794–2815, 2008.

L. A. Zadeh, “Fuzzy sets,” Information and Control, vol. 8, no. 3, pp. 338–353, 1965.

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

Z. Pawlak, Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Academic, Boston, Mass, USA, 1991.

F. Wang, “Outline of a computational theory for linguistic dynamic systems: toward computing with words,” International Journal of Intelligent Control and Systems, vol. 2, pp. 211–224, 1998.

L. A. Zadeh, “Fuzzy logic = computing with words,” IEEE Transactions on Fuzzy Systems, vol. 4, no. 2, pp. 103–111, 1996.

F. Wang, “Modeling, analysis and synthesis of linguistic dynamic systems: a computational theory,” in Proceedings of the IEEE International Workshop on Architecture for Semiotic Modeling and Situation Control in Large Complex Systems, pp. 173–178, 1995.

Y. Yao and B. Yao, “Covering based rough set approximations,” Information Sciences, vol. 200, pp. 91–107, 2012.

Y. L. Zhang, J. Li, and W. Z. Wu, “On axiomatic characterizations of three pairs of covering based approximation operators,” Information Sciences, vol. 180, no. 2, pp. 274–287, 2010.

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

W. Zhu, “Relationship between generalized rough sets based on binary relation and covering,” Information Sciences, vol. 179, no. 3, pp. 210–225, 2009.

I. Couso and D. Dubois, “Rough sets, coverings and incomplete information,” Fundamenta Informaticae, vol. 108, no. 3-4, pp. 223–247, 2011.

T. Deng and Y. Chen, “On reduction of morphological covering rough sets,” in Fuzzy Systems and Knowledge Discovery, vol. 4223 of Lecture Notes in Computer Science, pp. 266–275, Springer, Berlin, Germany, 2006.

T. Feng, J. Mi, and W. Wu, “Covering-based generalized rough fuzzy sets,” in Rough Set and Knowledge Technology, vol. 4062 of Lecture Notes in Computer Science, pp. 208–215, Springer, Berlin, Germany, 2006.

T. J. Li, “Rough approximation operators in covering approximation spaces,” in Rough Sets and Current Trends in Computing, vol. 4259 of Lecture Notes in Computer Science, pp. 174–182, Springer, Berlin, Germany, 2006.

Q. Liu, F. Min, H. Cai, and G. Yang, “Converting decision tables,” in Proceedings of the 11th World Congress of International Fuzzy Systems Association, pp. 1391–1396, 2005.

H. Whitney, “On the abstract properties of linear dependence,” American Journal of Mathematics, vol. 57, no. 3, pp. 509–533, 1935.

J. Edmonds, “Matroids and the greedy algorithm,” Mathematical Programming, vol. 1, pp. 127–136, 1971.

E. Lawler, Combinatorial Optimization: Networks and Matroids, Dover Publications, Mineola, NY, USA, 2001.

X. Li and S. Liu, “Matroidal approaches to rough sets via closure operators,” International Journal of Approximate Reasoning, vol. 53, no. 4, pp. 513–527, 2012.

Y. Liu, W. Zhu, and Y. Zhang, “Relationship between partion matrioid and rough set through k-rank matroid,” Journal of Information and Computational Science, vol. 8, pp. 2151–2163, 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.

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.

B. Yang and W. Zhu, “Matroidal structure of generalized rough sets based on symmetric and transitive relations,” in Proceedings of the 26th Annual IEEE Canadian Conference on Electrical and Computer Engineering (CCECE '13), pp. 1–5, Regina, Canada, May 2013.

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

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