Binary relation based rough sets

  • Authors:

  • William Zhu;Fei-Yue Wang

  • Affiliations:

  • The Key Laboratory of Complex Systems and Intelligent Science, Institute of Automation, The Chinese Academy of Sciences, Beijing, China;The Key Laboratory of Complex Systems and Intelligent Science, Institute of Automation, The Chinese Academy of Sciences, Beijing, China

  • Venue:
  • FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Rough set theory has been proposed by Pawlak as a tool for dealing with the vagueness and granularity in information systems. The core concepts of classical rough sets are lower and upper approximations based on equivalence relations. This paper studies arbitrary binary relation based generalized rough sets. In this setting, a binary relation can generate a lower approximation operation and an upper approximation operation. We prove that such a binary relation is unique, since two different binary relations will generate two different lower approximation operations and two different upper approximation operations. This paper also explores the relationships between the lower or upper approximation operation generated by the intersection of two binary relations and those generated by these two binary relations, respectively.