集族等价与基于粒的下近似算子研究  

On collections equivalence and the granule based lower approximation operators

作　　者：胡霞[1] 费鹏 杜卫锋[3] HU Xia;FEI Peng;DU Weifeng(School of Software and Service Outsourcing, Suzhou Institute of Industrial Technology, Suzhou 215104, China;Suzhou Chuangcai Software Co., Ltd., Suzhou 215128, China;School of Mathematics, Physics and Information Engineering, Jiaxing University,Jiaxing 314001, China)

机构地区：[1]苏州工业职业技术学院软件与服务外包学院,江苏苏州215104 [2]苏州市创采软件有限公司,江苏苏州215128 [3]嘉兴学院数理与信息工程学院,浙江嘉兴314001

出　　处：《智能系统学报》2018年第2期327-330,共4页CAAI Transactions on Intelligent Systems

基　　金：国家自然科学基金项目(61202109)

摘　　要：基于覆盖的粗集是推广经典粗集理论的方法之一,有基于元素、基于粒和基于子系统的3类定义上下近似的途径,以往大多数的文献往往从基于元素的角度出发进行定义。为了研究基于粒的近似算子特别是下近似算子的性质,借鉴格论中既约元、可约元等概念,提出了集族约简的概念。从集族约简出发,探讨了集族等价的概念与性质,并设计了集族约简的算法,得到了两个集族等价是两个集族生成相同的下近似运算的充要条件这一结果,为进一步开展一般二元关系下基于粒的近似算子的公理化方法的研究做了初步的理论方面的准备工作。Covering based rough set is one of the methods to extend the classical rough set theory.There are three kinds of approaches,the element based definition,the granule based definition,and the subsystem based definition,to define upper and lower approximation.Most of the literature in the past tends to define based on element.In order to study the properties of the granule based approximation operators,especially the lower approximation operator,referring the concepts of irreducible element and reducible element from lattice theory,the concept of collections reduct is put forward.Starting from the concept of collections reduct,the concept and properties of collections equivalence are discussed,and collections reduction algorithm is designed.The result that collections equivalence is the necessary and sufficient condition for generating the same lower approximation by collections is given here.The preliminary theoretical preparation is done here to further develop the axiomatization of the granule based approximation operators under general binary relation.

关 键 词：近似算子 约简 粗集 既约元 可约元 覆盖 粒 集族约简 

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