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

  • Authors:

  • Mikhail Moshkov;Beata Zielosko

  • Affiliations:

  • Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia;Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia and Institute of Computer Science, University of Silesia, So ...

  • Venue:
  • RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.