# Decision Tree Splitting Criterion

(Redirected from splitting criterion)

A Decision Tree Splitting Criterion is a metric function used by a decision tree algorithm to rank tree splitting options.

**Context:**- It can range from being a Classification Tree Splitting Criterion, to being a Ranking Tree Splitting Criterion, to being a Regression Tree Splitting Criterion.

**Example(s):****Counter-Example(s):****See:**Splitting Criterion, Impurity Function.

## References

### 2013

- http://en.wikipedia.org/wiki/Decision_tree_learning#Formulae
- Algorithms for constructing decision trees usually work top-down, by choosing a variable at each step that best splits the set of items.
^{[1]}Different algorithms use different metrics for measuring "best". These generally measure the homogeneity of the target variable within the subsets. Some examples are given below. These metrics are applied to each candidate subset, and the resulting values are combined (e.g., averaged) to provide a measure of the quality of the split.

- Algorithms for constructing decision trees usually work top-down, by choosing a variable at each step that best splits the set of items.

- ↑ Rokach, L.; Maimon, O. (2005). "Top-down induction of decision trees classifiers-a survey".
*IEEE Transactions on Systems, Man, and Cybernetics, Part C***35**(4): 476–487. doi:10.1109/TSMCC.2004.843247.

### 1999

- (Shih, 1999) ⇒ Yu-Shan Shih. (1999). “Families of splitting criteria for classification trees].” In: Statistics and Computing, 9(4). doi:10.1023/A:1008920224518.