Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

KDD
1995
ACM

favoriteEmaildiscussreport

176views Data Mining» more KDD 1995»

MDL-Based Decision Tree Pruning

13 years 8 months ago

MDL-Based Decision Tree Pruning

Download www.cs.iastate.edu

This paper explores the application of the Minimum Description Length principle for pruning decision trees. We present a new algorithm that intuitively captures the primary goal of reducing the misclassi cation error. An experimental comparison is presented with three other pruning algorithms. The results show that the MDL pruning algorithm achieves good accuracy, small trees, and fast execution times.

Manish Mehta 0002, Jorma Rissanen, Rakesh Agrawal

Real-time Traffic

Data Mining | KDD 1995 | MDL Pruning Algorithm | Misclassi Cation Error | Pruning Algorithm |

claim paper

Related Content

» Induction of Modular Classification Rules Using Jmaxpruning

» Detecting and Pruning Introns for Faster Decision Tree Evolution

» TreeBased Solution Methods for Multiagent POMDPs with Delayed Communication

» Pruning belief decision tree methods in averaging and conjunctive approaches

» A Fast BottomUp Decision Tree Pruning Algorithm with NearOptimal Generalization

» PUBLIC A Decision Tree Classifier that Integrates Building and Pruning

» Maximum a posteriori pruning on decision trees and its application to bootstrap BUMPing

» ErrorBased Pruning of Decision Trees Grown on Very Large Data Sets Can Work

» Properties of the knorm pruning algorithm for decision tree classifiers

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	KDD
Authors	Manish Mehta 0002, Jorma Rissanen, Rakesh Agrawal

Comments (0)