计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (16): 30-33.

• 博士论坛 • 上一篇    下一篇

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

王立宏   

  1. 烟台大学 计算机科学与技术学院,山东 烟台 264005
  • 收稿日期:2008-01-17 修回日期:2008-03-07 出版日期:2008-06-01 发布日期:2008-06-01
  • 通讯作者: 王立宏

Study of closed discretization schemes of information tables

WANG Li-hong   

  1. School of Computer Science and Technology,Yantai University,Yantai,Shandong 264005,China
  • Received:2008-01-17 Revised:2008-03-07 Online:2008-06-01 Published:2008-06-01
  • Contact: WANG Li-hong

摘要: 提出对象域U的有序划分概念,讨论一种特殊的离散化方案(闭离散化方案)。给出对象域U的有序划分对应的闭离散化方案获取算法CDA,分析闭离散化方案与对象域U的有序划分之间的关系,证明了闭离散化方案在离散格到划分格的映射f下能保持交并运算。

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

Abstract: 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.

Key words: closed discretization schemes, discretization lattice, ordered partition, rough set