信息表的闭离散化方案研究  

Study of closed discretization schemes of information tables

作　　者：王立宏[1] 

机构地区：[1]烟台大学计算机科学与技术学院,山东烟台264005

出　　处：《计算机工程与应用》2008年第16期30-33,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(the National Natural Science Foundation of China under Grant No.60772028);山东省自然科学基金(the NaturalScience Foundation of Shandong Province of China under Grant No.Y2006G22)

摘　　要：提出对象域U的有序划分概念,讨论一种特殊的离散化方案(闭离散化方案)。给出对象域U的有序划分对应的闭离散化方案获取算法CDA,分析闭离散化方案与对象域U的有序划分之间的关系,证明了闭离散化方案在离散格到划分格的映射f下能保持交并运算。This paper reviews the concept of discretization lattice composed by discretization schemes,proposes the concept of ordered partition of universe U,and discusses a special kind of discretization schemes named closed discretization schemes.We give a closed discretization scheme acquisition algorithm （CDA） for an ordered partition of universe U,analyze the relationship between closed discretization schemes and ordered partitions,and draw the conclusion that under the function f from discretization lattice to partition lattice,closed discretization schemes hold the union and intersection operations.

关 键 词：闭离散化方案 离散格 有序划分 粗集 

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