A greedy algorithm for construction of decision trees for tables with many-valued decisions - A comparative study

Handle URI:
http://hdl.handle.net/10754/564819
Title:
A greedy algorithm for construction of decision trees for tables with many-valued decisions - A comparative study
Authors:
Azad, Mohammad ( 0000-0001-9851-1420 ) ; Chikalov, Igor; Moshkov, Mikhail ( 0000-0003-0085-9483 ) ; Zielosko, Beata
Abstract:
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Applied Mathematics and Computational Science Program; Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Publisher:
IOS Press
Journal:
Fundamenta Informaticae
Issue Date:
25-Nov-2013
DOI:
10.3233/FI-2013-929
Type:
Article
ISSN:
01692968
Appears in Collections:
Articles; Applied Mathematics and Computational Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAzad, Mohammaden
dc.contributor.authorChikalov, Igoren
dc.contributor.authorMoshkov, Mikhailen
dc.contributor.authorZielosko, Beataen
dc.date.accessioned2015-08-04T07:17:08Zen
dc.date.available2015-08-04T07:17:08Zen
dc.date.issued2013-11-25en
dc.identifier.issn01692968en
dc.identifier.doi10.3233/FI-2013-929en
dc.identifier.urihttp://hdl.handle.net/10754/564819en
dc.description.abstractIn 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.en
dc.publisherIOS Pressen
dc.subjectDecision table with many-valued decisionsen
dc.subjectdecision treeen
dc.subjectgreedy algorithmen
dc.titleA greedy algorithm for construction of decision trees for tables with many-valued decisions - A comparative studyen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentApplied Mathematics and Computational Science Programen
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Groupen
dc.identifier.journalFundamenta Informaticaeen
dc.contributor.institutionInstitute of Computer Science, University of Silesia, 39, Bȩdzińska St., Sosnowiec 41-200, Polanden
kaust.authorAzad, Mohammaden
kaust.authorChikalov, Igoren
kaust.authorMoshkov, Mikhailen
kaust.authorZielosko, Beataen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.