• Title of article

    Reduction about approximation spaces of covering generalized rough sets Original Research Article

  • Author/Authors

    Tian Yang، نويسنده , , Qingguo Li، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2010
  • Pages
    11
  • From page
    335
  • To page
    345
  • Abstract
    The introduction of covering generalized rough sets has made a substantial contribution to the traditional theory of rough sets. The notion of attribute reduction can be regarded as one of the strongest and most significant results in rough sets. However, the efforts made on attribute reduction of covering generalized rough sets are far from sufficient. In this work, covering reduction is examined and discussed. We initially construct a new reduction theory by redefining the approximation spaces and the reducts of covering generalized rough sets. This theory is applicable to all types of covering generalized rough sets, and generalizes some existing reduction theories. Moreover, the currently insufficient reducts of covering generalized rough sets are improved by the new reduction. We then investigate in detail the procedures to get reducts of a covering. The reduction of a covering also provides a technique for data reduction in data mining.
  • Keywords
    Rough set , Approximation space , Reduct , Data mining , covering , Granular computing
  • Journal title
    International Journal of Approximate Reasoning
  • Serial Year
    2010
  • Journal title
    International Journal of Approximate Reasoning
  • Record number

    1182815