The Re-Granulation on Topological Structure of Granular Computing

Granular computing is an important research hotspot in artificial intelligence field. As one of the most important granular computing models, the quotient space theory mainly focuses on converting the fine granularity (original topological space) into the coarse granularity (quotient space). However, the granulation is an information decreasing and irreversible process which cannot be recovered losslessly from quotient space to original space. Therefore, this paper focuses on study the regranulation on topological structure of granular computing: Firstly, it defines concept of re-granulation which provides a mathematical method for reversibly transforming coarse granularity to fine one; Secondly, by theorems and examples it presents two reversible conditions of re-granulation --- defining a bijective mapping or keeping every open-set being saturated set on original space, which guarantee the information unchanging while restoring the problem from quotient space to original space. This paper has provided a formal computing framework for the reversibility of granularity on topological structure of granular computing.

[1]  Jiayang Wang,et al.  The Models of Granular System and Algebraic Quotient Space in Granular Computing , 2016 .

[2]  Deyu Li,et al.  Theory and method of granular computing for big data mining , 2015 .

[3]  Li Li,et al.  A New Granular Computing Model Based on Algebraic Structure , 2019, Chinese Journal of Electronics.

[4]  Lotfi A. Zadeh,et al.  THE BIRTH AND EVOLUTION OF FUZZY LOGIC , 1990 .

[5]  Giampiero Chiaselotti,et al.  Knowledge pairing systems in granular computing , 2017, Knowl. Based Syst..

[6]  Guoyin Wang,et al.  A multi-granularity decomposition mechanism of complex tasks based on density peaks , 2018, Big Data Min. Anal..

[7]  T. Y. Lin,et al.  GRANULAR COMPUTING: From Rough Sets and Neighborhood Systems to Information Granulation and Computing with Words , 1997 .

[8]  Yiyu Yao,et al.  On the System Algebra Foundations for Granular Computing , 2009, Int. J. Softw. Sci. Comput. Intell..

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

[10]  Saroj K. Meher,et al.  Adaptive Granular Neural Networks for Remote Sensing Image Classification , 2018, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing.

[11]  Theresa Beaubouef,et al.  Rough Sets , 2019, Lecture Notes in Computer Science.

[12]  Liang Ji,et al.  Theory and method of granular computing for big data mining , 2015 .

[13]  Aditi Sharan,et al.  Multi-view Ensemble Learning Using Rough Set Based Feature Ranking for Opinion Spam Detection , 2018, Advances in Intelligent Systems and Computing.

[14]  Andrzej Skowron,et al.  Local rough set: A solution to rough data analysis in big data , 2018, Int. J. Approx. Reason..

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

[16]  Yiyu Yao A triarchic theory of granular computing , 2016 .

[17]  Alain Trouvé,et al.  Inconsistency of Template Estimation by Minimizing of the Variance/Pre-Variance in the Quotient Space , 2017, Entropy.

[18]  Jehn-Ruey Jiang,et al.  Particle Swarm Optimization for Charger Deployment in Wireless Rechargeable Sensor Networks , 2016, 2016 26th International Telecommunication Networks and Applications Conference (ITNAC).

[19]  Sankar K. Pal,et al.  Pattern Recognition Algorithms for Data Mining: Scalability, Knowledge Discovery, and Soft Granular Computing , 2004 .