• DocumentCode
    2820481
  • Title

    Definability of Approximations for a Generalization of the Indiscernibility Relation

  • Author

    GrzymalaBusse, Jerzy W. ; Rzasa, Wojcicch

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., Kansas Univ., Lawrence, KS
  • fYear
    2007
  • fDate
    1-5 April 2007
  • Firstpage
    65
  • Lastpage
    72
  • Abstract
    We discuss a generalization of the indiscernibility relation, i.e., a relation R that is not necessarily reflexive, symmetric, or transitive. On the basis of granules, defined by R, we introduce the idea of definability. Twelve different basic definitions of approximations are discussed. Since four of these approximations do not satisfy, in general, the inclusion property, four additional modified approximations are introduced. Furthermore, eight other approximations are constructed by duality. The main objective is to study definability of approximations. We study definability of all approximations for reflexive, symmetric, or transitive relations. In particular, for reflexive relations the set of these twenty four approximations is reduced, in general, to the set of fourteen approximations
  • Keywords
    approximation theory; rough set theory; approximation definability; inclusion property; indiscernibility relation generalization; reflexive relations; Computational intelligence; Computer science; Data mining; Machine learning; Set theory; USA Councils;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computational Intelligence, 2007. FOCI 2007. IEEE Symposium on
  • Conference_Location
    Honolulu, HI
  • Print_ISBN
    1-4244-0703-6
  • Type

    conf

  • DOI
    10.1109/FOCI.2007.372149
  • Filename
    4233887