Studies on the covering rough set and its matrix description

  • Authors:
  • Xiaogai Wang;Yingcang Ma;Lu Wang;Juanjuan Zhang

  • Affiliations:
  • School of Science, Xi'an Polytechnic University, Xi'an, China;School of Science, Xi'an Polytechnic University, Xi'an, China;School of Science, Xi'an Polytechnic University, Xi'an, China;School of Science, Xi'an Polytechnic University, Xi'an, China

  • Venue:
  • AICI'12 Proceedings of the 4th international conference on Artificial Intelligence and Computational Intelligence
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper mainly studies on the covering rough set based on the close friend element. Firstly, the upper and lower approximations of the covering rough set based on the close friend element are defined, while the properties are discussed. Secondly, we define the binary relation is induced by a covering called the close friend relation and its properties are studied. Finally, we give the matrix description of the covering rough set based on the close friend element, and prove that the upper and lower approximations obtained from the matrix are same to from the definition of covering rough set based on the close friend element, which give a new way to describe the covering rough set.