Cohen, W. W. (1993). Efficient pruning methods for separate-and-conquer rule learning systems. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pp. 988–994, San Mateo, CA. Morgan Kaufmann.

Esposito, F., Malerba, D., & Semeraro, G. (1993). Decision tree pruning as a search in the state space. In Brazdil, P. B. (Ed.), Machine Learning: ECML-93, Proceedings of the Sixth European Conference, Vol. 667 of Lecture Notes in Artificial Intelligence, pp.

165-184, Berlin, Heidelberg, New York. Springer-Verlag.

Esposito, F., Malerba, D., & Semeraro, G. (1997). A comparative analysis of methods for pruning decision trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19 (5), 476–491.

Frank, E. (2000). Pruning Decision Trees and Lists. Ph.D. thesis, University of Waikato, Department of Computer Science, Hamilton, New Zealand.

Hagerup, T., & Rüb, C. (1990). A guided tour of Chernoff bounds. Information Processing Letters, 33 (6), 305–308.

Helmbold, D. P., & Schapire, R. E. (1997). Predicting nearly as well as the best pruning of a decision tree. Machine Learning, 27 (1), 51–68.

Holte, R. C., Acker, L., & Porter, B. (1989). Concept learning and the problem of small disjuncts. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 813–818, San Mateo, CA. Morgan Kaufmann.

Kamath, A., Motwani, R., Palem, K., & Spirakis, P. (1994). Tail bounds for occupancy and the satisfiability threshold conjecture. In Proceedings of the Thirty-Fifth Annual IEEE Symposium on Foundations of Computer Science, pp. 592–603, Los Alamitos, CA. IEEE Press.

Kearns, M., & Mansour, Y. (1998). A fast, bottom-up decision tree pruning algorithm with near-optimal generalization. In Shavlik, J. (Ed.), Proceedings of the Fifteenth International Conference on Machine Learning, pp. 269–277, San Francisco, CA. Morgan K aufmann.

Malerba, D., Esposito, F., & Semeraro, G. (1996). A further comparison of simplification methods for decision-tree induction. In Fisher, D., & Lenz, H.-J. (Eds.), Learning from Data : A I and Statistics V, pp. 365–374, Berlin, Heidelberg, New York. Springer-Verlag.

Mansour, Y. (1997). Pessimistic decision tree pruning based on tree size. In Fisher, D. H.

(Ed.), Proceedings of the Fourteenth International Conference on Machine Learning, p. 195–201, San Francisco, CA. Morgan Kaufmann.

McDiarmid, C. J. H. (1989). On the method of bounded differences. In Siemons, J. (Ed.),
Surveys in Combinatorics: Invited Papers of the 12th British Combinatorial Conference, pp. 148–188, Cambridge, U.K. Cambridge University Press.

Mingers, J. (1989a). An empirical comparison of pruning methods for decision tree induction.

Machine Learning, 4 (2), 227-243.

Mingers, J. (1989b). An empirical comparison of selection measures for decision-tree induction. Machine Learning, 3 (4), 319–342.

Mitchell, T. M. (1997). Machine Learning. McGraw-Hill, New York.