A greedy algorithm for construction of decision trees for tables with many-valued decisions - A comparative study
Type
Article
KAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) DivisionApplied Mathematics and Computational Science Program
Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Date
2013-11-25Metadata
Show full item recordAbstract
In the paper, we study a greedy algorithm for construction of 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. Experimental results for data sets from UCI Machine Learning Repository and randomly generated tables are presented. We make a comparative study of the depth and average depth of the constructed decision trees for proposed approach and approach based on generalized decision. The obtained results show that the proposed approach can be useful from the point of view of knowledge representation and algorithm construction.Publisher
IOS PressJournal
Fundamenta InformaticaeISSN
01692968Handle URI
http://hdl.handle.net/10754/564819Scopus Count
Collections
ArticlesRelated items
Showing items related by title, author, creator and subject.
-
Optimization of decision rule complexity for decision tables with many-valued decisions(Institute of Electrical and Electronics Engineers (IEEE), 2013-10)We describe new heuristics to construct decision rules for decision tables with many-valued decisions from the point of view of length and coverage which are enough good. We use statistical test to find leaders among the heuristics. After that, we compare our results with optimal result obtained by dynamic programming algorithms. The average percentage of relative difference between length (coverage) of constructed and optimal rules is at most 6.89% (15.89%, respectively) for leaders which seems to be a promising result. © 2013 IEEE.
-
Decision rules for decision tables with many-valued decisions(Springer Science + Business Media, 2011)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.
-
Minimization of Decision Tree Average Depth for Decision Tables with Many-valued Decisions(Elsevier BV, 2014-09-13)The paper is devoted to the analysis of greedy algorithms for the minimization of average depth of decision trees for decision tables such that each row is labeled with a set of decisions. The goal is to find one decision from the set of decisions. When we compare with the optimal result obtained from dynamic programming algorithm, we found some greedy algorithms produces results which are close to the optimal result for the minimization of average depth of decision trees.
