A novel approach to fuzzy rough sets based on a fuzzy covering

  • Authors:

  • Tingquan Deng;Yanmei Chen;Wenli Xu;Qionghai Dai

  • Affiliations:

  • College of Science, Harbin Engineering University, Harbin 150001, PR China and Department of Automation, Tsinghua University, Beijing 100084, PR China;Department of Mathematics, Harbin Institute of Technology, Harbin 150001, PR China;Department of Automation, Tsinghua University, Beijing 100084, PR China;Department of Automation, Tsinghua University, Beijing 100084, PR China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2007

Quantified Score

Hi-index 0.08

Visualization

Abstract

This paper proposes an approach to fuzzy rough sets in the framework of lattice theory. The new model for fuzzy rough sets is based on the concepts of both fuzzy covering and binary fuzzy logical operators (fuzzy conjunction and fuzzy implication). The conjunction and implication are connected by using the complete lattice-based adjunction theory. With this theory, fuzzy rough approximation operators are generalized and fundamental properties of these operators are investigated. Particularly, comparative studies of the generalized fuzzy rough sets to the classical fuzzy rough sets and Pawlak rough set are carried out. It is shown that the generalized fuzzy rough sets are an extension of the classical fuzzy rough sets as well as a fuzzification of the Pawlak rough set within the framework of complete lattices. A link between the generalized fuzzy rough approximation operators and fundamental morphological operators is presented in a translation-invariant additive group.