Generalisation of roughness bounds in rough set operations

  • Authors:

  • Yingjie Yang;Robert I. John

  • Affiliations:

  • Centre for Computational Intelligence, School of Computing, De Montfort University, The Gateway, Leicester LE1 9BH, United Kingdom;Centre for Computational Intelligence, School of Computing, De Montfort University, The Gateway, Leicester LE1 9BH, United Kingdom

  • Venue:
  • International Journal of Approximate Reasoning
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper investigates the general roughness bounds for rough set operations. Compared with set-oriented rough sets, the results prove that the same upper bound of the roughness for the union, difference and complement operation could be determined by the roughness of the two operand sets. However, the lower roughness bounds of set-oriented rough sets operations do not hold for other rough sets. We provide an example to show the derived bounds from the operand's roughness.