Decision rules for decision tables with many-valued decisions

Igor Chikalov, Beata Zielosko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

In the paper, authors presents a greedy algorithm for construction of exact and partial decision rules for decision tables with many-valued decisions. Exact decision rules can be 'over-fitted', so instead of exact decision rules with many attributes, it is more appropriate to work with partial decision rules with smaller number of attributes. Based on results for set cover problem authors study bounds on accuracy of greedy algorithm for exact and partial decision rule construction, and complexity of the problem of minimization of decision rule length. © 2011 Springer-Verlag.
Original languageEnglish (US)
Title of host publicationRough Sets and Knowledge Technology
PublisherSpringer Nature
Pages763-768
Number of pages6
ISBN (Print)9783642244247
DOIs
StatePublished - 2011

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Decision rules for decision tables with many-valued decisions'. Together they form a unique fingerprint.

Cite this