• DocumentCode
    2613090
  • Title

    Covering Based Rough Equivalence of Sets and Comparison of Knowledge

  • Author

    Tripathy, B.K. ; Tripathy, Hrudaya Ku

  • Author_Institution
    Sch. of Comput. Sci., V.I.T. Univ., Vellore, India
  • fYear
    2009
  • fDate
    17-20 April 2009
  • Firstpage
    303
  • Lastpage
    307
  • Abstract
    Covering based rough sets have been introduced as an extension of the basic rough sets introduced by Pawlak. There is only one way to define the lower approximation of a set using covering. However, as many as four definitions have been proposed for covering based upper approximation. Accordingly, we find four types of covering based rough sets in the literature. In earlier work the concept of rough equivalences of sets, which extended the corresponding notions of approximate equalities of Novotny and Pawlak were introduced and their properties were studied. In this article we further generalize these concepts to the setting of covering based rough sets and establish some of their properties.
  • Keywords
    approximation theory; rough set theory; approximate equalities; covering based rough equivalence; covering based rough sets; lower approximation; Computer science; Data mining; Rough sets; Springs; Covering; Lower approximation; Rough set; covering based rough sets; rough equivalence and covering based rough equivalence; upper approximation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Information Technology - Spring Conference, 2009. IACSITSC '09. International Association of
  • Conference_Location
    Singapore
  • Print_ISBN
    978-0-7695-3653-8
  • Type

    conf

  • DOI
    10.1109/IACSIT-SC.2009.88
  • Filename
    5169362