Online First:07 October 2005,
Published:2005
移动端阅览
吕丹, 吴孟达, 张学志. 可拓集合与粗糙集合[J]. 广东工业大学学报, 2005, 22(4): 120-123.
LU Dan, WU Meng-da, ZHANG Xue-zhi. Extension and Rough Set[J]. 2005, 22(4): 120-123.
吕丹, 吴孟达, 张学志. 可拓集合与粗糙集合[J]. 广东工业大学学报, 2005, 22(4): 120-123. DOI:
LU Dan, WU Meng-da, ZHANG Xue-zhi. Extension and Rough Set[J]. 2005, 22(4): 120-123. DOI:
将粗糙集合和可拓集合进行了比较
并表明任何粗糙集合可以用一个形如U→{-1
0
1}的关联函数来表示.证明了这两个概念是不同的但可用可拓集合运算的新定义来把粗糙关联函数拓展到可拓集合的交并运算上
采用可拓集合中可拓域的概念较好地解决了此问题.
In this paper
the concepts of rough set and extension set are compared.Any rough set can be expressed by means of a dependent function U→{-1
1}.It is shown that these two concepts are different
and this representation can be extended to union and intersection.At last
the concept of extension field is used to solve this problem effectively.
张文修等编著.粗糙集理论与方法[M]. 科学出版社, 2001
蔡文等著.可拓逻辑初步[M]. 科学出版社, 2003
Views
下载量
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution