摘要
粗糙集理论是一种处理模糊和不确定知识的数学工具,其中约简是粗糙集理论研究的重要内容,而寻找信息系统的最小约简是NP-hard问题.定义了信息系统上的差别量矩阵,通过给出信息系统上的p参数关系,诱导出对象集上一系列缩小映射,并证明了通过缩小映射得到的集合是对象集上的划分,且划分之间还存在细于关系.
Rough set theory is a new mathematical tool to deal with vagueness and uncertainty.And reduction is one of the important topics in the research on rough set theory.Howerver,finding the minimal reduction of an information system is a NP-hard problem.In this paper,the discernibility matrix on information system is firstly defined.Based on it,a sequence of contraction map are induced by ap parameter relation.Finally,it proves that each set which is generated from contraction maps is a partition of object set and there is a finer relation between them.
出处
《内蒙古师范大学学报（自然科学汉文版）》
CAS
北大核心
2016年第4期464-468,共5页
Journal of Inner Mongolia Normal University(Natural Science Edition)
基金
陕西省自然科学基础研究计划资助项目(2014JM1027)
宝鸡文理学院硕士启动项目(ZK16114)
关键词
粗糙集理论
动态压缩
信息系统
知识约简
rough set theory
dynamic compression
information system
reduct of knowledge
