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

基于覆盖粗糙集理论中的约简与求核
引用本文:张亚军,王艳平,付上金. 基于覆盖粗糙集理论中的约简与求核[J]. 模糊系统与数学, 2007, 21(6): 152-156
作者姓名:张亚军  王艳平  付上金
作者单位:辽宁工业大学,数理科学系,辽宁,锦州,121001
摘    要:
提出基于分辨矩阵的求覆盖粗糙集约简与核的方法,在Zakowski提出的覆盖粗糙集模型的基础上,利用分辨矩阵的一些性质,把文献[10]中的粗糙集理论中的约简与求核方法应用到基于覆盖的粗糙集理论中,既简化了覆盖粗糙集理论中的约简与求核过程,又推广了文献[10]的方法,最后举例说明此方法的有效性。

关 键 词:覆盖  覆盖粗糙集  分辨矩阵    约简
文章编号:1001-7402(2007)06-0152-05
收稿时间:2006-05-18
修稿时间:2006-05-18

On Finding Core and Reduction in Covering Rough Set Theory
ZHANG Ya-jun,WANG Yan-ping,FU Shang-jin. On Finding Core and Reduction in Covering Rough Set Theory[J]. Fuzzy Systems and Mathematics, 2007, 21(6): 152-156
Authors:ZHANG Ya-jun  WANG Yan-ping  FU Shang-jin
Abstract:
Put forward the method based on discesnable matrix to find the reduction and core in covering rough set,whick based on covering rough set model which proposed by Zakawski.Using some natures of the discernable matrix,this paper applies the procedure of finding core and reduction in rough set theory which is appeared in literature to the theory based on covering rough set,which not only simplifies the process of finding reduction and core,but also generalizes the method in .In the end,the effectiveness of the result obtained is demonstrated by an example.
Keywords:Covering  Covering Rough Set  Discernable Matrix  Core  Reduction
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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