Construction of α-decision trees for tables with many-valued decisions

Mikhail Moshkov, Beata Zielosko

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

7 Scopus citations

Abstract

The paper is devoted to the study of greedy algorithm for construction of approximate decision trees (α-decision trees). This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. We consider bound on the number of algorithm steps, and bound on the algorithm accuracy relative to the depth of decision trees. © 2011 Springer-Verlag.
Original languageEnglish (US)
Title of host publicationRough Sets and Knowledge Technology
PublisherSpringer Nature
Pages486-494
Number of pages9
ISBN (Print)9783642244247
DOIs
StatePublished - 2011

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

Cite this