Knowledge Spaces and Reduction of Covering Approximation Spaces

Theory of covering rough sets is one kind of effective methods for knowledge discovery. In Bonikowski covering approximation spaces, all definable sets on the universe form a knowledge space. This paper focuses on the theoretic study of knowledge spaces of covering approximation spaces. One kind of dependence relations among covering approximation spaces is introduced, the relationship between the dependence relation and lower and upper covering approximation operators are discussed in detail, and knowledge spaces of covering approximation spaces are well characterized by them. By exploring the dependence relation between a covering approximation space and its sub-spaces, the notion of the reduction of covering approximation spaces is induced, and the properties of the reductions are investigated.

[1]  Chen Degang,et al.  A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets , 2007 .

[2]  Witold Pedrycz,et al.  Positive approximation: An accelerator for attribute reduction in rough set theory , 2010, Artif. Intell..

[3]  J. Kortelainen.  On relationship between modified sets, topological spaces and rough sets , 1994 .

[4]  Bernard Monjardet,et al.  The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey , 2003, Discret. Appl. Math..

[5]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[6]  Fei-Yue Wang,et al.  Covering Based Granular Computing for Conflict Analysis , 2006, ISI.

[7]  Daniel Vanderpooten,et al.  A Generalized Definition of Rough Approximations Based on Similarity , 2000, IEEE Trans. Knowl. Data Eng..

[8]  Yee Leung,et al.  Generalized fuzzy rough approximation operators based on fuzzy coverings , 2008, Int. J. Approx. Reason..

[9]  Jing-Yu Yang,et al.  Relationships among generalized rough sets in six coverings and pure reflexive neighborhood system , 2012, Inf. Sci..

[10]  Chris Cornelis,et al.  Partial order relation for approximation operators in covering based rough sets , 2014, Inf. Sci..

[11]  Urszula Wybraniec-Skardowska,et al.  Extensions and Intentions in the Ruogh Set Theory , 1998, Inf. Sci..

[12]  William Zhu,et al.  Relationship between generalized rough sets based on binary relation and covering , 2009, Inf. Sci..

[13]  Wen-Xiu Zhang,et al.  Measuring roughness of generalized rough sets induced by a covering , 2007, Fuzzy Sets Syst..

[14]  Qingguo Li,et al.  Reduction about approximation spaces of covering generalized rough sets , 2010, Int. J. Approx. Reason..

[15]  Fei-Yue Wang,et al.  Properties of the Fourth Type of Covering-Based Rough Sets , 2006, 2006 Sixth International Conference on Hybrid Intelligent Systems (HIS'06).

[16]  Jean-Claude Falmagne,et al.  Knowledge spaces , 1998 .

[17]  N. Zhang,et al.  Multiscale roughness measure for color image segmentation , 2012, Inf. Sci..

[18]  Caihui Liu,et al.  On multi-granulation covering rough sets , 2014, Int. J. Approx. Reason..

[19]  W. Zakowski.  APPROXIMATIONS IN THE SPACE (U,π) , 1983 .

[20]  Y. Yao.  Information granulation and rough set approximation , 2001 .

[21]  Yiyu Yao,et al.  The superiority of three-way decisions in probabilistic rough set models , 2011, Inf. Sci..

[22]  Bernard Monjardet,et al.  The presence of lattice theory in discrete problems of mathematical social sciences. Why , 2003, Math. Soc. Sci..

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

[24]  Yiyu Yao,et al.  Covering based rough set approximations , 2012, Inf. Sci..

[25]  Tianrui Li,et al.  Composite rough sets for dynamic data mining , 2014, Inf. Sci..