• DocumentCode
    3514017
  • Title

    The representation of indiscernibility relation by graph

  • Author

    Ognjenovic, Visnja ; Brtka, Vladimir ; Jovanovic, Martin ; Brtka, Eleonora ; Berkovic, Ivana

  • Author_Institution
    Tech. Fac. Mihajlo Pupin, Univ. of Novi Sad, Zrenjanin, Serbia
  • fYear
    2011
  • fDate
    8-10 Sept. 2011
  • Firstpage
    91
  • Lastpage
    94
  • Abstract
    The paper presents a new form of indiscernibility relation based on graph. Based on widely accepted definitions of indiscernibility relation and its matrix representation, it has been shown how the indiscernibility relations can be obtained by a graph. The application of the indiscernibility graph enables the partitioning of the universe of objects represented by their attributes. This is in connection with the Rough sets theory (Z. Pawlak, 1980s). The relation between state space, when applied to the indiscernibility graph, is also theoretically discussed. Formal definitions are accompanied by some examples.
  • Keywords
    graph theory; matrix algebra; rough set theory; indiscernibility relation; matrix representation; rough sets theory; Approximation methods; Data mining; Informatics; Intelligent systems; Rough sets; Symmetric matrices;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Systems and Informatics (SISY), 2011 IEEE 9th International Symposium on
  • Conference_Location
    Subotica
  • Print_ISBN
    978-1-4577-1975-2
  • Type

    conf

  • DOI
    10.1109/SISY.2011.6034298
  • Filename
    6034298