Algorithms for Decision Tree Construction

Handle URI:
http://hdl.handle.net/10754/561677
Title:
Algorithms for Decision Tree Construction
Authors:
Chikalov, Igor
Abstract:
The study of algorithms for decision tree construction was initiated in 1960s. The first algorithms are based on the separation heuristic [13, 31] that at each step tries dividing the set of objects as evenly as possible. Later Garey and Graham [28] showed that such algorithm may construct decision trees whose average depth is arbitrarily far from the minimum. Hyafil and Rivest in [35] proved NP-hardness of DT problem that is constructing a tree with the minimum average depth for a diagnostic problem over 2-valued information system and uniform probability distribution. Cox et al. in [22] showed that for a two-class problem over information system, even finding the root node attribute for an optimal tree is an NP-hard problem. © Springer-Verlag Berlin Heidelberg 2011.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Publisher:
Springer Science + Business Media
Journal:
Average Time Complexity of Decision Trees
Issue Date:
2011
DOI:
10.1007/978-3-642-22661-8_4
Type:
Article
ISSN:
18684394
ISBN:
9783642226601
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorChikalov, Igoren
dc.date.accessioned2015-08-03T09:02:04Zen
dc.date.available2015-08-03T09:02:04Zen
dc.date.issued2011en
dc.identifier.isbn9783642226601en
dc.identifier.issn18684394en
dc.identifier.doi10.1007/978-3-642-22661-8_4en
dc.identifier.urihttp://hdl.handle.net/10754/561677en
dc.description.abstractThe study of algorithms for decision tree construction was initiated in 1960s. The first algorithms are based on the separation heuristic [13, 31] that at each step tries dividing the set of objects as evenly as possible. Later Garey and Graham [28] showed that such algorithm may construct decision trees whose average depth is arbitrarily far from the minimum. Hyafil and Rivest in [35] proved NP-hardness of DT problem that is constructing a tree with the minimum average depth for a diagnostic problem over 2-valued information system and uniform probability distribution. Cox et al. in [22] showed that for a two-class problem over information system, even finding the root node attribute for an optimal tree is an NP-hard problem. © Springer-Verlag Berlin Heidelberg 2011.en
dc.publisherSpringer Science + Business Mediaen
dc.titleAlgorithms for Decision Tree Constructionen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalAverage Time Complexity of Decision Treesen
kaust.authorChikalov, Igoren
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.