Topological Approaches to the First Type of Covering-Based Rough Sets

Rough sets, a tool for data mining, deal with the vagueness and granularity in information systems. This paper studies covering-based rough sets from the topological view. We explore the relationship between the relative closure and the first type of covering upper approximation. The major contributions of this paper are that we use the definition of the relative closure and the relative interior to discuss the conditions under which the relative operators satisfy certain classical properties. The theorems we get generalize some of the results in Zhu's paper.

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

[2]  Fei-Yue Wang,et al.  Properties of the First Type of Covering-Based Rough Sets , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[3]  A. Skowron,et al.  On topology in information systems , 1988 .

[4]  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).

[5]  Li Jin.  The Covering Upper Approximation Sets and the Relative Closures , 2005 .

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

[7]  Meng Guang-wu.  LF-topological methods on the theory of covering generalized rough sets , 2008 .

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

[9]  Fei-Yue Wang,et al.  A New Type of Covering Rough Set , 2006, 2006 3rd International IEEE Conference Intelligent Systems.

[10]  YongXuan Huang,et al.  Topology Theory on Rough Sets , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).