Classification Tree Pruning Algorithm: Difference between revisions
Jump to navigation
Jump to search
(Created page with "A Classification Tree Pruning Algorithm is a Decision Tree Pruning Algorithm for a classification tree. * <B>See:</B> Classification Tree Pre-Pruning Algorithm...") |
No edit summary |
||
| Line 1: | Line 1: | ||
A [[Classification Tree Pruning Algorithm]] is a [[Decision Tree Pruning Algorithm]] for a [[classification tree]]. | A [[Classification Tree Pruning Algorithm]] is a [[Decision Tree Pruning Algorithm]] for a [[classification tree]]. | ||
* <B> | * <B>Context(s):</B> | ||
** [[Classification Tree Pre-Pruning Algorithm]]. | |||
** [[Classification Tree Post-Pruning Algorithm]]. | |||
* <B>Counter-Example(s):</B> | |||
** a [[Regression Tree Pruning Algorithm]]. | |||
* <B>See:</B> [[MDL Principle]], [[Overfitting]]. | |||
---- | ---- | ||
---- | ---- | ||
__NOTOC__ | __NOTOC__ | ||
Revision as of 21:08, 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.