A decision tree is a tree where each non-leaf or internal node is associated with a decision and the leaf nodes are generally associated with an outcome or class label. Each internal node tests one or more attribute values leading to two or more links or branches. Each link in turn is associated with a possible value of the decision. These links are mutually distinct and collectively exhaustive. This means that it is possible to follow only one of the links and all possibilities will be taken care of—there is a link for each possibility.
KeywordsDecision Tree Leaf Node Class Label Pattern Classification Categorical Feature
Unable to display preview. Download preview PDF.
- 1.Buntine, W. and T. Niblett. A further comparison of splitting rules for decisiontree Induction. Machine Learning 8: 75–85. 1992.Google Scholar
- 5.John, George H. Finding multivariate splits in decision trees using function optimization. Proceedings of the AAAI. 1994.Google Scholar
- 8.Ouyang, Jie, Nilesh Patel and Ishwar Sethi. Induction of multiclass multifeature split decision trees from distributed data. Pattern Recognition. 2009.Google Scholar
- 9.Quinlan, J. R. Induction of decision trees. Machine Learning 1: 81–106. 1986.Google Scholar
- 10.Quinlan, J.R. C4.5-Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann. 1992.Google Scholar