# Classification Tree Learning Algorithm

A Classification Tree Learning Algorithm is a Decision Tree Learning Algorithm that can produce a Classification Tree.

**Context:**- It can be applied by an Classification Tree Learning System.
- It can (typically) make us of a Classification Tree Splitting Criterion.
- It can (typically) make us of a Classification Tree Pruning Function.
- It is a Symbolic Learning Algorithm.
- It is a Discriminative Learning Algorithm.

**Example(s):****Counter-Example(s):****See:**Kernel-based Classification Algorithm.

## References

### 2012

- (Domingos, 2012) ⇒ Pedro Domingos. (2012). “A Few Useful Things to Know About Machine Learning.” In: Communications of the ACM Journal, 55(10). doi:10.1145/2347736.2347755
- QUOTE: Algorithm 1 (below) shows a bare-bones decision tree learner for Boolean domains, using information gain and greedy search(20). InfoGain([math]x_j, y[/math]) is the mutual information between feature [math]x_j[/math] and the class [math]y[/math]. MakeNode(x,c_0,c_1) returns a node that tests feature x and has c_0 as the child for x=0 and c_1 as the child for x=1.

LearnDT(TrainSet) if all examples in TrainSet have the same class y_*thenreturn MakeLeaf(y_*) if no feature x_j has InfoGain(x_j,y) > 0 then y_* ← Most frequent class in TrainSet return MakeLeaf(y_*) x_* ← argmax_{x_j}, InfoGain(x_j,y) TS_0 ← Examples in TrainSet with x_* = 0 TS_1 ← Examples in TrainSet with x_* = 1 return MakeNode(x_*,l), LearnDT(TS0),LearnDT(TS_1))