Granular computing is a formal method to abstract and express knowledge,and the abstraction and trans-formation of granular structure is the key to multi-granular computing.Through decomposition and synthesis strate-gy,complex problem particles and simple problem particles can be mapped and aggregated,so as to obtain an effective method to solve complex problems.The decomposition and synthesis of knowledge particles in Cartesian product do-main under different data environments are studied in this paper.Firstly,the factorability of exact sets,fuzzy sets and intuitionistic fuzzy sets in binary discourse universe is discussed,and the discriminant conditions for their factorability are given and their essential properties are proved.Secondly,according to the discriminant conditions,the factorable conditions of exact knowledge grains and rough knowledge grains,fuzzy knowledge grains and fuzzy rough knowledge grains,intuitionistic fuzzy knowledge grains and intuitionistic fuzzy rough knowledge grains are obtained respectively,which further reveals the objective law of decomposition of different knowledge grains.Finally,algorithms for deter-mining the decomposability of exact sets,fuzzy sets and intuitionistic fuzzy sets in binary discourse universe are pro-posed.The study of binary knowledge granularity factorability is of great significance for perfecting the theory of in-formation granularity calculation and reducing the problem of high-dimensional data calculation.
关键词
粒计算/知识粒/模糊知识粒/直觉模糊知识粒/知识粒的分解
Key words
Particle calculation/Knowledge/Fuzzy knowledge grain/Intuitive fuzzy knowledge grain/Decomposition of knowledge granules
维普
万方数据