A model of granular computing based on rough set theory

Ever since the introduction of the term of granular computing, we have witnessed a rapid development in the topic. Many models and methods of granular computing have been studied. In this paper, we propose a model of granular computing based on rough set theory. The standard rough set theory uses equivalence classes as granules to describe concepts. The partition induced by an equivalence relation forms a granulated view of the universe. Rough membership functions provide us with another view for interpreting rough set. By extending rough membership functions, this paper first examines a granulated view induced by a covering of the universe and defines the operations on the granules, then explores the connections of different levels in the granular structure induced by a partial order sequence of coverings. We indicate that many other granular structures are special cases of what we present here.

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

[2]  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..

[3]  Lotfi A. Zadeh,et al.  Some reflections on soft computing, granular computing and their roles in the conception, design and utilization of information/intelligent systems , 1998, Soft Comput..

[4]  Craig A. Knoblock.  Generating Abstraction Hierarchies , 1993 .

[5]  Yiyu Yao,et al.  Two views of the theory of rough sets in finite universes , 1996, Int. J. Approx. Reason..

[6]  Y. Yao,et al.  Generalized Rough Set Models , 1998 .

[7]  Bo Zhang,et al.  Theory and Applications of Problem Solving , 1992 .

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

[9]  Yiyu Yao,et al.  Generalized probabilistic rough set models , 1996, Soft Computing in Intelligent Systems and Information Processing. Proceedings of the 1996 Asian Fuzzy Systems Symposium.

[10]  Bo Zhang,et al.  The Quotient Space Theory of Problem Solving , 2003, Fundam. Informaticae.

[11]  Lech Polkowski,et al.  Approximate mathematical morphology. Rough set approach , 1999 .

[12]  Yiyu Yao,et al.  Information granulation and rough set approximation , 2001, Int. J. Intell. Syst..

[13]  Yiyu Yao,et al.  A Partition Model of Granular Computing , 2004, Trans. Rough Sets.

[14]  Craig A. Knoblock.  Generating abstraction hierarchies - an automated approach to reducing search in planning , 1993, The Kluwer international series in engineering and computer science.

[15]  Z..  INFORMATION SYSTEMS THEORETICAL FOUNDATIONS , 2022 .

[16]  Z. Pawlak,et al.  Rough membership functions , 1994 .

[17]  Y. Yao.  Granular Computing : basic issues and possible solutions , 2000 .

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