Stratified rough sets and granular computing

This paper examines granulation structures for stratified rough set approximations. With respect to different level of granulations, various approximations are obtained. Two special types of granulation structures are investigated. A nested sequence of granulations by equivalence relations leads to a nested sequence of rough set approximations. A hierarchical granulation, characterized by a special class of equivalence relations, leads to a more general approximation structure.

[1]  Tony T. Lee,et al.  An Infornation-Theoretic Analysis of Relational Databases—Part I: Data Dependencies and Information Metric , 1987, IEEE Transactions on Software Engineering.

[2]  Jiawei Han,et al.  Data-Driven Discovery of Quantitative Rules in Relational Databases , 1993, IEEE Trans. Knowl. Data Eng..

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

[4]  Lotfi A. Zadeh,et al.  Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic , 1997, Fuzzy Sets Syst..

[5]  Z. Pawlak.  Granularity of knowledge, indiscernibility and rough sets , 1998, 1998 IEEE International Conference on Fuzzy Systems Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36228).

[6]  A. Skowron,et al.  Towards adaptive calculus of granules , 1998, 1998 IEEE International Conference on Fuzzy Systems Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36228).

[7]  Yiyu Yao.  Granular Computing using Neighborhood Systems , 1999 .