Matroidal Structure of Rough Sets from the Viewpoint of Graph Theory

Constructing structures with other mathematical theories is an important research field of rough sets. As one mathematical theory on sets, matroids possess a sophisticated structure. This paper builds a bridge between rough sets and matroids and establishes the matroidal structure of rough sets. In order to understand intuitively the relationships between these two theories, we study this problem from the viewpoint of graph theory. Therefore, any partition of the universe can be represented by a family of complete graphs or cycles. Then two different kinds of matroids are constructed and some matroidal characteristics of them are discussed, respectively. The lower and the upper approximations are formulated with these matroidal characteristics. Some new properties, which have not been found in rough sets, are obtained. Furthermore, by defining the concept of lower approximation number, the rank function of some subset of the universe and the approximations of the subset are connected. Finally, the relationships between the two types of matroids are discussed, and the result shows that they are just dual matroids.

[1]  Salvatore Greco,et al.  Fuzzy Similarity Relation as a Basis for Rough Approximations , 1998, Rough Sets and Current Trends in Computing.

[2]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[3]  Wei-Jiang Liu,et al.  Topological space properties of rough sets , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[4]  Daniel S. Yeung,et al.  Rough approximations on a complete completely distributive lattice with applications to generalized rough sets , 2006, Inf. Sci..

[5]  E. Bryniarski.  A calculus of rough sets of the first order , 1989 .

[6]  William Zhu,et al.  Matroidal approaches to generalized rough sets based on relations , 2011, Int. J. Mach. Learn. Cybern..

[7]  Qinghua Hu,et al.  Neighborhood rough set based heterogeneous feature subset selection , 2008, Inf. Sci..

[8]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[9]  Andrzej Skowron,et al.  Rough sets and Boolean reasoning , 2007, Inf. Sci..

[10]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[11]  Andrzej Skowron,et al.  Tolerance Approximation Spaces , 1996, Fundam. Informaticae.

[12]  Zhaohao Wang,et al.  Reduction of Neighborhood-Based Generalized Rough Sets , 2011, J. Appl. Math..

[13]  Yiyu Yao,et al.  Neighborhood systems and approximate retrieval , 2006, Inf. Sci..

[14]  Yiyu Yao,et al.  Generalization of Rough Sets using Modal Logics , 1996, Intell. Autom. Soft Comput..

[15]  A. Wasilewska.  Topological Rough Algebras , 1997 .

[16]  Hong Wang,et al.  Classification and reduction of attributes in concept lattices , 2006, 2006 IEEE International Conference on Granular Computing.

[17]  William Zhu,et al.  Transversal and Function Matroidal Structures of Covering-Based Rough Sets , 2011, RSKT.

[18]  Wen-Xiu Zhang,et al.  Rough sets on atomic Boolean lattices , 2005, 2005 IEEE International Conference on Granular Computing.

[19]  Yuhua Qian,et al.  Test-cost-sensitive attribute reduction , 2011, Inf. Sci..

[20]  D. West.  Introduction to Graph Theory , 1995 .

[21]  T. Medhat,et al.  Rough set theory for topological spaces , 2005, Int. J. Approx. Reason..

[22]  Robin J. Wilson,et al.  An Introduction to Matroid Theory , 1973 .

[23]  Daowu Pei,et al.  A generalized model of fuzzy rough sets , 2005, Int. J. Gen. Syst..

[24]  William Zhu,et al.  A Class of Covering-Based Fuzzy Rough Sets , 2007, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007).

[25]  Tsau Young Lin,et al.  A Review of Rough Set Models , 1997 .

[26]  H. Whitney.  On the Abstract Properties of Linear Dependence , 1935 .

[27]  Wen-Xiu Zhang,et al.  An axiomatic characterization of a fuzzy generalization of rough sets , 2004, Inf. Sci..

[28]  Peter J. Cameron.  Notes on matroids and codes , 2000 .

[29]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.

[30]  Yiyu Yao,et al.  A Comparative Study of Fuzzy Sets and Rough Sets , 1998 .

[31]  Guilin Qi,et al.  Rough operations on Boolean algebras , 2005, Inf. Sci..

[32]  D. Dubois,et al.  ROUGH FUZZY SETS AND FUZZY ROUGH SETS , 1990 .

[33]  Guilong Liu,et al.  Generalized rough sets over fuzzy lattices , 2008, Inf. Sci..

[34]  Fei-Yue Wang,et al.  Reduction and axiomization of covering generalized rough sets , 2003, Inf. Sci..

[35]  William Zhu,et al.  Generalized rough sets based on relations , 2007, Inf. Sci..

[36]  D. Vanderpooten.  Similarity Relation as a Basis for Rough Approximations , 1995 .

[37]  William Zhu,et al.  On Three Types of Covering-Based Rough Sets , 2014, IEEE Transactions on Knowledge and Data Engineering.

[38]  William Zhu,et al.  Topological approaches to covering rough sets , 2007, Inf. Sci..

[39]  Fei-Yue Wang,et al.  Topological Properties in Covering-Based Rough Sets , 2007, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007).