基于最小描述的覆盖粒计算模型  

Covering Model of Granular Computing Based on the Minimum Description

作　　者：于海[1] 詹婉荣[1] 

机构地区：[1]洛阳师范学院数学科学学院,河南洛阳471022

出　　处：《模糊系统与数学》2014年第6期158-162,共5页Fuzzy Systems and Mathematics

基　　金：国家自然科学基金资助项目(61272015);河南省教育厅科学技术研究项目(12B120010);河南省基础与前沿技术研究计划项目(122300410256)

摘　　要：在覆盖近似空间(U,C)中,基于最小描述定义了一种新的Zoom-in算子,并讨论了其性质。在论域U上,通过复合Zoom-in和Zoom-out算子,得到了具有对偶性的两对近似算子。同样在粒化论域C上,通过复合Zoom-out和Zoom-in算子,也得到了具有对偶性的两对近似算子。In the covering approximation space （U,C）, a new zoom-in operator is redefined based on the minimum description and its properties are also discussed. On the universe of discourse U, by combining the Zoom-in and Zoom-out operators, two pairs of approximation operators which have the duality property are obtained. Similarly, on the granulated universe of discourse C, by combining the Zoom-out and Zoom-in operators, the other two pairs of approximation operators which have the duality property are also obtained.

关 键 词：粒计算 覆盖 最小描述Zoom—in算子 Zoom—out算子 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]