格观念下的知识约简  

Knowledge Reduction under View of Lattice

作　　者：马丽[1,2] 米据生[1] 

机构地区：[1]河北师范大学数学与信息科学学院,石家庄050024 [2]石家庄经济学院信息工程学院,石家庄050031

出　　处：《计算机科学》2015年第6期79-81,100,共4页Computer Science

基　　金：国家自然科学基金(61170107,61300153,61300121);河北省高校创新团队领军人才培育计划项目(LJRC022)资助

摘　　要：经典的信息系统可看作是一种特殊的格结构。从格的角度给出了知识约简和协调集的概念,借助粗糙集的思想定义了一对新的上下近似算子,并在此基础上通过定义可辨识集,给出了约简和相对约简的判定定理。这种表示更深层次地揭示了知识的本质,将知识约简的已有相关结果做了进一步拓广。Classic information systems can be viewed as a special case of lattice structure. We proposed some new con- cepts such as knowledge reduction and consistent set based on rough set theory under the view of lattice. By means of defining lower approximate and upper approximate operators, we gave two specific reductions. Then, we presented the judgement theorems for consistent sets and proved them. These representations deeply reveal the essence of knowledge, and some relevant results of knowledge reduction are obtained.

关 键 词：格 分划 知识约简 相对约简 

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