摘要
将粗糙集合和可拓集合进行了比较,并表明任何粗糙集合可以用一个形如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, 0, 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.
出处
《广东工业大学学报》
CAS
2005年第4期120-123,128,共5页
Journal of Guangdong University of Technology
基金
国防科技大学基础研究项目(Gc03-02-003)
关键词
粗糙集
可拓集
粗糙关联函数
rough set
extension set
rough dependent function
