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

嵌套决策粒度约简关系的研究
引用本文:李道国,苗夺谦,张年琴.嵌套决策粒度约简关系的研究[J].计算机科学,2006,33(2):178-181.
作者姓名:李道国  苗夺谦  张年琴
作者单位:1. 同济大学计算机科学与技术系,上海,200092;太原理工大学阳泉学院,山西阳泉,045001
2. 同济大学计算机科学与技术系,上海,200092
摘    要:在基于粗糙集理论的知识发现中,知识约简是核心内容。因此,本文从理论上分析了相容决策表中嵌套决策粒度约简的关系,得出并证明了粗决策粒度的相对 D 核一定是细决策粒度相对 D 核的子集,粗决策粒度的一个相对D约简在满足相容性的条件下一定可以扩张成细决策粒度的一个约简。反之,细决策粒度的一个约简一定可以缩减为粗决策粒度的一个约简。研究结果对基于决策表的知识约简和知识发现有一定的实际意义。

关 键 词:相对D核  相对D约简  包容强度  偏序关系  粒划分

Research on Reduction Relationships of Nested Granularities
LI Dao-Guo,MIAO Duo-Qian,ZHANG Nian-Qin.Research on Reduction Relationships of Nested Granularities[J].Computer Science,2006,33(2):178-181.
Authors:LI Dao-Guo  MIAO Duo-Qian  ZHANG Nian-Qin
Affiliation:1,Department of Computer Science and Technology, Tongji University, Shanghai 200092;2, Yangquan College of Taiyuan University of Technology, Yangquan 045001
Abstract:Knowledge Reduction plays an important role in knowledge discovery based on rough set theory.In this pa- per,therefore,the reduction relationships of nested granularities are theoretically analyzed in consistent information ta- bles.We educe and prove that relative core of coarser decision granularity must be a subset of relative core of finer deci- sion granularity.At the same time,a relative reduction of coarser decision granularity that satisfies consistency can be extended into a relative reduction of its finer decision granularity.Inversely,a relative reduction of finer decision granu- larity can also be cut back a relative reduction of its coarser decision granularity.The conclusions are helpful for knowl- edge reduction and knowledge discovery based on rough sets.
Keywords:Relative core  Relative reduction  Inclusion degree  Information granular partition
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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