首页 | 本学科首页   官方微博 | 高级检索  
     

信息表的闭离散化方案研究
引用本文:王立宏.信息表的闭离散化方案研究[J].计算机工程与应用,2008,44(16):30-33.
作者姓名:王立宏
作者单位:烟台大学 计算机科学与技术学院,山东 烟台 264005
基金项目:国家自然科学基金 , 山东省自然科学基金
摘    要:提出对象域U的有序划分概念,讨论一种特殊的离散化方案(闭离散化方案)。给出对象域U的有序划分对应的闭离散化方案获取算法CDA,分析闭离散化方案与对象域U的有序划分之间的关系,证明了闭离散化方案在离散格到划分格的映射f下能保持交并运算。

关 键 词:闭离散化方案  离散格  有序划分  粗集  
文章编号:1002-8331(2008)16-0030-04
收稿时间:2008-1-17
修稿时间:2008年1月17日

Study of closed discretization schemes of information tables
WANG Li-hong.Study of closed discretization schemes of information tables[J].Computer Engineering and Applications,2008,44(16):30-33.
Authors:WANG Li-hong
Affiliation:School of Computer Science and Technology,Yantai University,Yantai,Shandong 264005,China
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.
Keywords:closed discretization schemes  discretization lattice  ordered partition  rough set
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号