基于偏序关系粒范畴的构造方法  

Constructing method of granular category based on partial ordering relation

作　　者：李鸿[1,2] 

机构地区：[1]宿州学院信息工程学院智能信息处理实验室,安徽宿州234000 [2]中国矿业大学信息与电气工程学院,江苏徐州221008

出　　处：《计算机工程与应用》2015年第6期11-15,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61303183);安徽高校省级自然科学研究重点项目(No.kj2012a263)

摘　　要：目前粒计算理论还没有公认的统一模型,为了解决这个问题,从粒集出发,定义了粒的个体对象间的泛化-例化关系、粒之间的泛包含关系,证明了它们都是偏序关系且具有偏序关系的粒集是一个范畴;定义了粒集的泛交运算,并通过实例给出了基于偏序关系的粒范畴的构造方法,讨论了这种粒范畴的几个性质。这些研究成果说明了基于偏序关系的粒范畴的构造方法是行之有效的,为研究粒范畴的应用问题奠定了基础。This paper attempts to deal with model of Granular Computing theory. Starting with granular set, it defines the generalization-specialization relationship between the individual objects of a granule, the pan-inclusion relationship between the granules, and proves that they are the partial ordering relation, and the granular set with partial order relation is a category.Offering the pan-intersection operation of the granular set, it further illustrates the construction method of granular category based on partial ordering relation. It also discusses some properties of the granular category. The research results show that the method is effective to construct the granular category, laying the foundation for the application of the granular category.

关 键 词：粒 粒集 粒范畴 偏序关系 构造 粒计算 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]