Classification Tree Pruning Algorithm: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 8: | Line 8: | ||
* <B>See:</B> [[MDL Principle]], [[Overfitting]]. | * <B>See:</B> [[MDL Principle]], [[Overfitting]]. | ||
---- | ---- | ||
---- | |||
==References== | |||
===2013=== | |||
* (Mehta, 2013) => Manish Mehta, Jorma Rissanen, and Rakesh Agrawal. (2013). "[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__ | ||
Revision as of 21:32, 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.
References
2013
- (Mehta, 2013) => Manish Mehta, Jorma Rissanen, and Rakesh Agrawal. (2013). "MDL-Based Decision Tree Pruning." In: KDD, vol. 95.