Journal of Frontiers of Computer Science and Technology ›› 2022, Vol. 16 ›› Issue (12): 2870-2878.DOI: 10.3778/j.issn.1673-9418.2103028

• Theory and Algorithm • Previous Articles     Next Articles

Research on Granular Conversion Computing in Algebraic Quotient Space

WEI Zongxuan(), WANG Jiayang   

  1. School of Computer Science and Engineering, Central South University, Changsha 410083, China
  • Received:2021-03-08 Revised:2021-10-28 Online:2022-12-01 Published:2021-11-03
  • About author:WEI Zongxuan, born in 1995, M.S. candidate. Her research interests include granular computing, intelligent information processing, etc.
    WANG Jiayang, born in 1963, Ph.D., professor, Ph.D. supervisor, senior member of CCF. His research interests include granular computing, intelligent information processing, decision sup-port, etc.
  • Supported by:
    National Natural Science Foundation of China(61772031);Natural Science Foundation of Hunan Province(2020JJ4753)


魏宗萱(), 王加阳   

  1. 中南大学 计算机学院,长沙 410083
  • 通讯作者: +E-mail:
  • 作者简介:魏宗萱(1995—),女,河北保定人,硕士研究生,主要研究方向为粒度计算、智能信息处理等。
  • 基金资助:


Granular computing is a problem processing paradigm based on multi-level structure, which has attracted extensive attention of domestic and foreign scholars in recent years. Granular transformation and problem solving are key issues of multi-granular computing. However, the algebraic quotient space model lacks discussion of these issues. In light of above problems, for the algebraic quotient space model, three complete clusters of algebraic quotient space are defined according to the algebraic quotient space construction methods, so as to analyze and demonstrate the closeness of granular conversion. Furthermore, for different granularity principles and modes, the complete algebraic granularity conversion methods are given from multiple angles. Next, the similarities and differences between different conversion methods and the relationship between granularity conversion results of the algebraic are discussed. In addition, in order to describe the solution results of algebraic problems after coarse grain and fine grain transformations, the consistency principle of solution results is proposed based on the granularity transformation method and algebraic solution rules. The reliability of the granularity conversion methods and the consistency principle is proven by theoretical analysis, and the effectiveness of the proposed methods is verified by an example. The example results are consistent with the theoretical analysis conclusions, which proves the correctness of the consistency principle. It solves the core problem of granular computing using algebraic quotient space model, and provides a theoretical basis for solving large-scale complex problems using algebraic granular computing.

Key words: granular computing, algebraic quotient space, multi-granularity, granularity conversion, consistency



关键词: 粒度计算, 代数商空间, 多粒度, 粒度转换, 一致性

CLC Number: