摘要
覆盖粗糙集是经典粗糙集的推广。然而,覆盖粗糙集的上下近似定义的方法有很多,上下近似是否对偶一直是争论的焦点。本文分析覆盖粗糙集上下近似的对偶性质,讨论对偶下的正域、负域及边界的可定义性。通过对偶性质的分析,对不同问题使用不同上下近似的方法。进一步研究约简与对偶运算的关系,分析覆盖粗糙集中满足对偶的两对重要的上下近似。
Covering-based rough set theory is an extension of the classical rough set theory. In a variety of definitions of approxi- mations operations, duality is always the focus of debate. This paper analyses duality of approximation operations through the de- finable properties of positive region, negative region and boundary region. With duality, this paper shows how to choose approxi- mation operations for different applications. This paper also investigates the duality of approximation operations in reduct cover- ing. Finally, the paper analyzes two pairs of approximation operations satisfying the duality in coveting-based rough sets.
出处
《计算机与现代化》
2012年第7期1-5,共5页
Computer and Modernization
基金
福建省教育厅资助项目(JB11320)
关键词
粗糙集
覆盖
对偶性
约简
上近似
rough sets
covering
duality
reduct
upper approximation
