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...") |
m (Text replacement - ". ---- " to ". ---- ") |
||
| (19 intermediate revisions by 2 users not shown) | |||
| 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 [[Ranking Tree Pruning Algorithm]]. | |||
** a [[Regression Tree Pruning Algorithm]]. | |||
* <B>See:</B> [[MDL Principle]], [[Overfitting]]. | |||
---- | ---- | ||
---- | |||
== References == | |||
=== 1995 === | |||
* (Mehta, 1995) ⇒ Manish Mehta, Jorma Rissanen, and [[Rakesh Agrawal]]. ([[1995]]). “[http://www.almaden.ibm.com/cs/projects/iis/hdb/Publications/papers/kdd95_mdl.pdf MDL-Based Decision Tree Pruning].” In: KDD, vol. 95. | |||
---- | ---- | ||
__NOTOC__ | __NOTOC__ | ||
[[Category:Concept]] | |||
Latest revision as of 22:24, 16 June 2021
A Classification Tree Pruning Algorithm is a Decision Tree Pruning Algorithm for a classification tree.
- Context(s):
- Counter-Example(s):
- See: MDL Principle, Overfitting.
References
1995
- (Mehta, 1995) ⇒ Manish Mehta, Jorma Rissanen, and Rakesh Agrawal. (1995). “MDL-Based Decision Tree Pruning.” In: KDD, vol. 95.