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

覆盖粗糙集的一般化
引用本文:周军,张庆灵,陈文实. 覆盖粗糙集的一般化[J]. 东北大学学报(自然科学版), 2004, 25(10): 954-956
作者姓名:周军  张庆灵  陈文实
作者单位:东北大学,理学院,辽宁,沈阳,110004;辽宁工学院,计算机科学与工程系,辽宁,锦州,121001
基金项目:辽宁省优秀青年骨干教师基金,辽宁省教育厅资助项目
摘    要:在近似空间中给出了基于最简覆盖的等域关系定义,证明了它是论域上的一个不可区分关系·由此,覆盖粗糙集转化为经典粗糙集,使得经典的粗糙集理论的应用范围得到了进一步的扩展·举例说明了一般化方法既能化覆盖粗糙集为经典的粗糙集,又提高了一个集合的近似程度·还给出了基于覆盖的近似空间中的信息处理过程的模型,该模型应用了WilliamZhu和Fei YueWang提出的覆盖约简的方法和技术来消除冗余数据,又可以使覆盖粗糙集转化为经典的粗糙集·

关 键 词:粗糙集  覆盖粗糙集  上近似  下近似  等域关系  覆盖  最简覆盖
文章编号:1005-3026(2004)10-0954-03
修稿时间:2004-03-05

Generalization of Covering Rough Sets
ZHOU Jun,ZHANG Qing-ling,CHEN Wen-shi. Generalization of Covering Rough Sets[J]. Journal of Northeastern University(Natural Science), 2004, 25(10): 954-956
Authors:ZHOU Jun  ZHANG Qing-ling  CHEN Wen-shi
Affiliation:ZHOU Jun~1,ZHANG Qing-ling~1,CHEN Wen-shi~2
Abstract:Giving definition of the equal domain relation in most reduced form of coverage in an approximate space, the equal domain relation is proved an indiscernible relation in the universe of discourse. The covering rough sets can thus be transformed into classical ones so as to extend theoretically their applications further. An exemplification of generalization is given to reveal that the covering rough sets can not only be transformed into classical ones but also improve the approximation level of a set. An information processing model in the approximate space based on coverage is also given, which used the covering reduction technique proposed by William Zhu and Fei-Yue Wang to get rid of redundancy and make the transformation available as above.
Keywords:rough set  covering rough set  upper approximation  lower approximation  equal domain relation  most reduced coverage
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《东北大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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