论文信息 - Pessimistic Decision Tree Pruning Based on Tree Size

Pessimistic Decision Tree Pruning Based on Tree Size

In this work we develop a new criteria to perform pessimistic decision tree pruning. Our method is theoretically sound and is based on theoretical concepts such as uniform convergence and the Vapnik-Chervonenkis dimension. We show that our criteria is very well motivated, from the theory side, and performs very well in practice. The accuracy of the new criteria is comparable to that of the current method used in C4.5.

Yishay Mansour

[1] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .

[2] Peter Auer,et al. Theory and Applications of Agnostic PAC-Learning with Small Decision Trees , 1995, ICML.

[3] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .

[4] Tim Niblett,et al. Constructing Decision Trees in Noisy Domains , 1987, EWSL.

[5] John Mingers,et al. Expert Systems—Rule Induction with Statistical Data , 1987 .

[6] Ron Kohavi,et al. Scaling Up the Accuracy of Naive-Bayes Classifiers: A Decision-Tree Hybrid , 1996, KDD.

[7] J. Ross Quinlan,et al. Simplifying Decision Trees , 1987, Int. J. Man Mach. Stud..