Computer and Modernization ›› 2012, Vol. 203 ›› Issue (7): 1-5.doi: 10.3969/j.issn.1006-2475.2012.07.001

• 人工智能 •     Next Articles

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

CLC Number: