Graphical representation of information on the set of reducts

Mikhail Moshkov*, Marcin Piliszczuk

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationRough Sets and Knowledge Technology - Second International Conference, RSKT 2007, Proceedings
Pages372-378
Number of pages7
Volume4481 LNAI
StatePublished - 2007
Externally publishedYes
Event2nd International Conference on Rough Sets and Knowledge Technology, RSKT 2007 - Toronto, Canada
Duration: May 14 2007May 16 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4481 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Conference on Rough Sets and Knowledge Technology, RSKT 2007
CountryCanada
CityToronto
Period05/14/0705/16/07

Keywords

  • Decision reducts
  • Decision tables
  • Rough sets

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Graphical representation of information on the set of reducts'. Together they form a unique fingerprint.

Cite this