By Topic

The representation of indiscernibility relation by graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Ognjenovic, V. ; Tech. Fac. Mihajlo Pupin, Univ. of Novi Sad, Zrenjanin, Serbia ; Brtka, V. ; Jovanovic, M. ; Brtka, E.
more authors

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.

Published in:

Intelligent Systems and Informatics (SISY), 2011 IEEE 9th International Symposium on

Date of Conference:

8-10 Sept. 2011