Properties of the Second Type of Covering-Based Rough Sets

  • Authors:
  • William Zhu

  • Affiliations:
  • University of Auckland, New Zealand/ Nankai University, China

  • Venue:
  • WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

To deal with the vagueness and granularity in information systems, researchers proposed several methods such as fuzzy theory and rough set theory. This paper studies a class of covering-based generalized rough sets. In this setting, a covering can generate a lower approximation operation and an upper approximation operation, but some of common properties of classical lower and upper approximation operations are no longer satisfied. We investigate conditions for a covering under which these properties hold for the second type of covering-based lower and upper approximation operations.