首页 | 官方网站   微博 | 高级检索  
     

覆盖广义粗糙集与信任函数
引用本文:彭金发.覆盖广义粗糙集与信任函数[J].漳州师院学报,2010,24(2):1-4.
作者姓名:彭金发
作者单位:漳州师范学院,政治法律系,福建,漳州,363000 
基金项目:国家自然科学基金资助项目(10671173;10971186)
摘    要:本文在覆盖广义粗糙集最简覆盖的基础上,应用等域关系,将覆盖广义粗糙集转化为Pawlak经典的粗糙集,使得经典粗糙集理论的应用范围得到了一定的扩充,并用例子说明该转化方法提高了一个集合的近似程度.最后讨论了覆盖广义粗糙集与证据理论之间的关系.

关 键 词:粗糙集  等域关系  信任函数  最简覆盖

Connections between Covering Generization Rough Set and Dempster-Shafer Theory of Evidence
LIN Guo-ping.Connections between Covering Generization Rough Set and Dempster-Shafer Theory of Evidence[J].Journal of ZhangZhou Teachers College(Philosophy & Social Sciences),2010,24(2):1-4.
Authors:LIN Guo-ping
Affiliation:LIN Guo-ping(Department of Mathematics & Information Science,Zhangzhou Normal University,Zhangzhou,Fujian 363000,China)
Abstract:Based on the most reduced coverage of the generalization covering rough set,the equal domain relation is used to transform the generalization covering rough set into the classical ones so as to extend their applications of rough set theory further.An exemplification is given to show that this transformation method can improve the approximation level of a set.Then the Connections between Covering generalization rough set and theory of Dempster-Shafer evidence is discussed.
Keywords:rough set  equal domain relation  belief functions  most reduced coverage
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号