Graphical representation of information on the set of reducts

Authors:
Mikhail Moshkov;Marcin Piliszczuk
Affiliations:
Institute of Computer Science, University of Silesia, Sosnowiec, Poland;ING Bank Slaski S.A., Katowice, Poland
Venue:
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Year:
2007

Citing 2
Cited 2

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Pairwise cores in information systems

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I

On Covering Attribute Sets by Reducts

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Extracting Relevant Information about Reduct Sets from Data Tables

Transactions on Rough Sets IX

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study properties of the graph G(T), associated with an arbitrary decision table T. The set of vertices of G(T) coincides with the set of conditional attributes of T belonging to at least one decision reduct for T, and the set of edges coincides with the set of pairs of attributes which do not belong to any decision reduct for T.