Properties of the First Type of Covering-Based Rough Sets

Rough set theory has been proposed by Pawlak as a tool for dealing with the vagueness and granularity in information systems. The core concepts of classical rough sets are lower and upper approximations based on equivalence relations, or partitions. This paper studies covering-based generalized rough sets. In this setting, a covering can also generate a lower approximation operation and an upper approximation operation, but some of common properties of classical lower and upper approximation operations are no longer satisfied. We investigate conditions for a covering under which these properties hold for the covering-based lower and upper approximation operations

[1]  Fei-Yue Wang,et al.  Binary Relation Based Rough Sets , 2006, FSKD.

[2]  Yun-He Pan,et al.  A minimal axiom group for rough set based on quasi-ordering , 2004, Journal of Zhejiang University. Science.

[3]  Jingtao Yao,et al.  The STP model for solving imprecise problems , 2006, 2006 IEEE International Conference on Granular Computing.

[4]  Yiyu Yao,et al.  Peculiarity Oriented Multidatabase Mining , 2003, IEEE Trans. Knowl. Data Eng..

[5]  Yiyu Yao,et al.  Subsystem Based Generalizations of Rough Set Approximations , 2005, ISMIS.

[6]  Yiyu Yao,et al.  Constructive and Algebraic Methods of the Theory of Rough Sets , 1998, Inf. Sci..

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

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

[9]  Fei-Yue Wang,et al.  Outline of a Computational Theory for Linguistic Dynamic Systems: Toward Computing with Words , 1998 .

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

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

[12]  Yiyu Yao,et al.  On Generalizing Pawlak Approximation Operators , 1998, Rough Sets and Current Trends in Computing.

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

[14]  Tsau Young Lin.  Granular computing on binary relations: Analysis of conflict and Chinese wall security policy , 2002 .

[15]  BonikowskiZbigniew,et al.  Extensions and intentions in the rough set theory , 1998 .

[16]  Zheng Pei,et al.  On the topological properties of fuzzy rough sets , 2005, Fuzzy Sets Syst..

[17]  Wei-Zhi Wu,et al.  Generalized fuzzy rough sets , 2003, Inf. Sci..

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

[19]  Tsau Young Lin,et al.  Rough Approximate Operators: Axiomatic Rough Set Theory , 1993, RSKD.

[20]  Fei-Yue Wang,et al.  Relationships among three types of covering rough sets , 2006, 2006 IEEE International Conference on Granular Computing.

[21]  Michiro Kondo,et al.  On the structure of generalized rough sets , 2006, Inf. Sci..

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

[23]  F. Zhu,et al.  Logical properties of rough sets , 2000, Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.

[24]  Wei-Zhi Wu,et al.  Constructive and axiomatic approaches of fuzzy approximation operators , 2004, Inf. Sci..

[25]  Feng Liu,et al.  The Inconsistency in Rough Set Based Rule Generation , 2000, Rough Sets and Current Trends in Computing.

[26]  Fei-Yue Wang,et al.  On the abstraction of conventional dynamic systems: from numerical analysis to linguistic analysis , 2005, Inf. Sci..

[27]  Yiyu Yao,et al.  Relational Interpretations of Neigborhood Operators and Rough Set Approximation Operators , 1998, Inf. Sci..

[28]  Gianpiero Cattaneo,et al.  Algebraic Structures for Rough Sets , 2004, Trans. Rough Sets.

[29]  Zheng Pei,et al.  The Relationship Among Several Knowledge Reduction Approaches , 2005, FSKD.

[30]  Marzena Kryszkiewicz,et al.  Rough Set Approach to Incomplete Information Systems , 1998, Inf. Sci..

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

[32]  Witold Pedrycz,et al.  Granular computing: an introduction , 2001, Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569).

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

[34]  Tsau Young Lin,et al.  Granular computing: structures, representations, and applications , 2003 .

[35]  Yiyu Yao,et al.  Granular Computing: basic issues and possible solutions , 2007 .

[36]  Wei-Zhi Wu,et al.  Rough set approximations VS. measurable spaces , 2006, 2006 IEEE International Conference on Granular Computing.

[37]  Yee Leung,et al.  On characterizations of (I, J)-fuzzy rough approximation operators , 2005, Fuzzy Sets Syst..

[38]  Lotfi A. Zadeh,et al.  The concept of a linguistic variable and its application to approximate reasoning-III , 1975, Inf. Sci..

[39]  Lotfi A. Zadeh,et al.  The concept of a linguistic variable and its application to approximate reasoning - II , 1975, Inf. Sci..

[40]  Lotfi A. Zadeh,et al.  Fuzzy logic = computing with words , 1996, IEEE Trans. Fuzzy Syst..

[41]  Yiyu Yao,et al.  A Three-layered Conceptual Framework of Data Mining , 2004 .

[42]  Guilong Liu.  The transitive closures of matrices over distributive lattices , 2006, 2006 IEEE International Conference on Granular Computing.

[43]  Qing Liu,et al.  Semantic analysis of rough logical formulas based on granular computing , 2006, 2006 IEEE International Conference on Granular Computing.