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

Handle URI:
http://hdl.handle.net/10754/564343
Title:
Construction of α-decision trees for tables with many-valued decisions
Authors:
Moshkov, Mikhail ( 0000-0003-0085-9483 ) ; Zielosko, Beata
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.
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:
Springer Science + Business Media
Journal:
Rough Sets and Knowledge Technology
Conference/Event name:
6th International Conference on Rough Sets and Knowledge Technology, RSKT 2011
Issue Date:
2011
DOI:
10.1007/978-3-642-24425-4_63
Type:
Conference Paper
ISSN:
03029743
ISBN:
9783642244247
Appears in Collections:
Conference Papers; Applied Mathematics and Computational Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorMoshkov, Mikhailen
dc.contributor.authorZielosko, Beataen
dc.date.accessioned2015-08-04T06:24:18Zen
dc.date.available2015-08-04T06:24:18Zen
dc.date.issued2011en
dc.identifier.isbn9783642244247en
dc.identifier.issn03029743en
dc.identifier.doi10.1007/978-3-642-24425-4_63en
dc.identifier.urihttp://hdl.handle.net/10754/564343en
dc.description.abstractThe 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.en
dc.publisherSpringer Science + Business Mediaen
dc.subjectdecision table with many-valued decisionsen
dc.subjectdecision treeen
dc.subjectgreedy algorithmen
dc.titleConstruction of α-decision trees for tables with many-valued decisionsen
dc.typeConference Paperen
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.journalRough Sets and Knowledge Technologyen
dc.conference.date9 October 2011 through 12 October 2011en
dc.conference.name6th International Conference on Rough Sets and Knowledge Technology, RSKT 2011en
dc.conference.locationBanff, ABen
dc.contributor.institutionInstitute of Computer Science, University of Silesia, 39, Bȩdzińska St., 41-200 Sosnowiec, Polanden
kaust.authorMoshkov, Mikhailen
kaust.authorZielosko, Beataen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.