Synonyms
Classification tree; Decision tree
Definition
Decision tree classifiers are decision trees used for classification. As any other classifier, the decision tree classifiers use values of attributes/features of the data to make a class label (discrete) prediction. Structurally, decision tree classifiers are organized like a decision treein which simple conditions on (usually single) attributes label the edge between an intermediate node and its children. Leaves are labeled by class label predictions. A large number of learning methods have been proposed for decision tree classifiers. Most methods have a tree growing and a pruning phase. The tree growing is recursive and consists in selecting an attribute to split on and actual splitting conditions then recurring on the children until the data corresponding to that path is pure or too small in size. The pruning phase eliminates part of the bottom of the tree that learned noise from the data in order to improve the generalization...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Agresti A. Categorical data analysis. Wiley; 1990.
Breiman L, Friedman JH, Olshen RA, Stone CJ. Classification and regression trees. Belmont: Wadsworth; 1984.
Buntine W. Learning classification trees. Artificial Intelligence frontiers in statistics. London: Chapman & Hall; 1993. p. 182–201.
Cox LA, Qiu Y, Kuehner W. Heuristic least-cost computation of discrete classification functions with uncertain argument values. Ann Oper Res. 1989;21(1):1–30.
Frank E. Pruning decision trees and lists. Doctoral dissertation, Department of Computer Science, University of Waikato, Hamilton; 2000.
Hyafil L, Rivest RL. Constructing optimal binary decision trees is np-complete. Inf Process Lett. 1976;5(1):15–7.
James M. Classification algorithms. New York: Wiley; 1985.
Lim T-S, Loh W-Y, Shih Y-S. An empirical comparison of decision trees and other classification methods Department of Statistics, University of Wisconsin, Madison; 1997. (Technical Report 979).
Loh W-Y, Shih Y-S. Split selection methods for classification trees. Stat Sin. 1997;7(4):815.
Murthy SK. Automatic construction of decision trees from data: a multi-disciplinary survey. Data Mining Knowle Discov. 1997;2(4):345–89.
Quinlan JR. Induction of decision trees. Mach Learn. 1986;1(1):81–106.
Quinlan JR. Learning with continuous classes. In: Proceedings of the 5th Australian Joint Conference on Artificial Intelligence; 1992. p. 343–8.
Quinlan JR. C4.5: programs for machine learning. Morgan Kaufman; 1993.
Murphy OJ, Mccraw RL. Designing storage efficient decision trees. IEEE Trans Comput. 1991;40(3): 315–9.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Dobra, A. (2018). Decision Tree Classification. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_554
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_554
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering