Log In
Communities & Collections
All of KAUST
About
Home
Research
Articles
Algorithms for Decision Tree Construction
Algorithms for Decision Tree Construction
Type
Article
Authors
Chikalov, Igor
KAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Date
2011
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.
Citation
Chikalov, I. (2011). Algorithms for Decision Tree Construction. Average Time Complexity of Decision Trees, 61–78. doi:10.1007/978-3-642-22661-8_4
Publisher
Springer Nature
Journal
Intelligent Systems Reference Library
DOI
10.1007/978-3-642-22661-8_4
Permanent link to this record
http://hdl.handle.net/10754/561677
Collections
Articles
Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
Full item page