Classification Tree Pruning Algorithm: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 4: | Line 4: | ||
** [[Classification Tree Post-Pruning Algorithm]]. | ** [[Classification Tree Post-Pruning Algorithm]]. | ||
* <B>Counter-Example(s):</B> | * <B>Counter-Example(s):</B> | ||
** a [[Ranking Tree Pruning Algorithm]]. | |||
** a [[Regression Tree Pruning Algorithm]]. | ** a [[Regression Tree Pruning Algorithm]]. | ||
* <B>See:</B> [[MDL Principle]], [[Overfitting]]. | * <B>See:</B> [[MDL Principle]], [[Overfitting]]. | ||
Revision as of 21:14, 16 July 2013
A Classification Tree Pruning Algorithm is a Decision Tree Pruning Algorithm for a classification tree.
- Context(s):
- Counter-Example(s):
- See: MDL Principle, Overfitting.