计算机与现代化 ›› 2012, Vol. 203 ›› Issue (7): 1-5.doi: 10.3969/j.issn.1006-2475.2012.07.001

• 人工智能 •    下一篇

覆盖粗糙集上下近似的对偶性分析

陈文,刘绍清,郑若鹢,黄河清   

  1. 福州职业技术学院计算机系,福建福州350108
  • 收稿日期:2012-02-20 修回日期:1900-01-01 出版日期:2012-08-10 发布日期:2012-08-10

Duality Analysis of Approximation Operations in Covering-based Rough Sets

CHEN Wen, LIU Shao-qing, ZHENG Ruo-yi, HUANG He-qing

  

  1. Department of Computer, Fuzhou Polytechnic, Fuzhou 350108, China
  • Received:2012-02-20 Revised:1900-01-01 Online:2012-08-10 Published:2012-08-10

摘要: 覆盖粗糙集是经典粗糙集的推广。然而,覆盖粗糙集的上下近似定义的方法有很多,上下近似是否对偶一直是争论的焦点。本文分析覆盖粗糙集上下近似的对偶性质,讨论对偶下的正域、负域及边界的可定义性。通过对偶性质的分析,对不同问题使用不同上下近似的方法。进一步研究约简与对偶运算的关系,分析覆盖粗糙集中满足对偶的两对重要的上下近似。

关键词: 粗糙集, 覆盖, 对偶性, 约简, 上近似

Abstract: Covering-based rough set theory is an extension of the classical rough set theory. In a variety of definitions of approximations operations, duality is always the focus of debate. This paper analyses duality of approximation operations through the definable properties of positive region, negative region and boundary region. With duality, this paper shows how to choose approximation operations for different applications. This paper also investigates the duality of approximation operations in reduct covering. Finally, the paper analyzes two pairs of approximation operations satisfying the duality in covering-based rough sets.

Key words: rough sets, covering, duality, reduct, upper approximation

中图分类号: