检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:罗来鹏 范自柱 LUO Laipeng;FAN Zizhu(School of Sciences,East China Jiaotong University,Nanchang 330013,China)
机构地区:[1]华东交通大学理学院
出 处:《华侨大学学报(自然科学版)》2019年第5期694-700,共7页Journal of Huaqiao University(Natural Science)
基 金:国家自然科学基金资助项目(61472138)
摘 要:针对目标概念在近似空间上存在多种粒结构的问题,通过讨论目标概念的最优近似集与Pawlak近似集、变精度近似集之间的代数关系,得到最优近似集与Pawlak下、上近似集、变精度下、上近似集的等价条件;通过分析基于最优近似、基于Pawlak近似、基于变精度近似的分布约简之间的关系,得到在一定条件下,最优近似分布约简为Pawlak近似与变精度近似的分布约简.研究结果表明:根据目标概念与基本知识粒之间不同的近似刻画,不仅可以建立不同的粗糙集模型,还可以建立不同的分布约简.To the problem of existing many kinds of granular structures on approximation space, the algebraic relations among the optimal approximation set, Pawlak lower and upper approximation set and the variable precision lower and upper approximation set of the target concept are discussed. The equivalent conditions of the optimal approximation set between Pawlak approximation set, the variable precision approximation set are obtained. The relationships among the distribution reduction based on the optimal approximation, the distribution reduction based on the Pawlak approximation and the distribution reduction based on the variable precision approximation are analyzed. Under certain conditions, the conclusions that the optimal approximate distribution reduction is Pawlak approximation and variable precision approximation distribution reduction are presented. It can be seen from these above conclusions that the different rough set models can not only be established, but also different distribution reduction can be established according to the different approximate characterization between the target concept and the basic granular.
关 键 词:粒计算 粗糙集 属性约简 包含度 变精度粗糙集 最优近似 相似度
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.217.93.250