Greedy algorithm for construction of decision trees for tables with many-valued decisions

Mohammad Azad, Igor Chikalov, Mikhail Moshkov, Beata Zielosko

Research output: Contribution to journalConference articlepeer-review

7 Scopus citations

Abstract

In the paper, we study a greedy algorithm for construction of approximate 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 use an uncertainty measure which is the number of boundary subtables. We present also experimental results for data sets from UCI Machine Learning Repository for proposed approach and approach based on generalized decision.

Original languageEnglish
Pages (from-to)13-24
Number of pages12
JournalCEUR Workshop Proceedings
Volume928
StatePublished - 2012
Externally publishedYes
Event21th International Workshop on Concurrency, Specification and Programming, CS and P 2012 - Berlin, Germany
Duration: 26 Sep 201228 Sep 2012

Keywords

  • Decision table with many-valued decisions
  • Decision tree
  • Greedy algorithm

Fingerprint

Dive into the research topics of 'Greedy algorithm for construction of decision trees for tables with many-valued decisions'. Together they form a unique fingerprint.

Cite this