A comparison of two types of rough sets induced by coverings

  • Authors:

  • Guilong Liu;Ying Sai

  • Affiliations:

  • School of Information Science, Beijing Language and Culture University, No. 15, Xueyuan Road, Beijing 100083, China;School of Computer and Information Engineering, Shandong University of Finance, Jinan 250014, China

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

Rough set theory is an important technique in knowledge discovery in databases. In covering-based rough sets, many types of rough set models were established in recent years. In this paper, we compare the covering-based rough sets defined by Zhu with ones defined by Xu and Zhang. We further explore the properties and structures of these types of rough set models. We also consider the reduction of coverings. Finally, the axiomatic systems for the lower and upper approximations defined by Xu and Zhang are constructed.