Motwani, R., & Raghavan, P. (1995). Randomized Algorithms. Cambridge University Press, New York Niblett, T., & Bratko, I. (1986). Learning decision rules in noisy domains. In Bramer, M. A.

(Ed.), Research and Development in Expert Systems III, pp. 25–34, Cambridge, UK.

Cambridge University Press.

Oates, T., & Jensen, D. (1997). The effects of training set size on decision tree complexity.

In Fisher, D. H. (Ed.), Proceedings of the Fourteenth International Conference on Machine Learning, pp. 254–261, San Francisco, CA. Morgan Kaufmann.

Oates, T., & Jensen, D. (1998). Large datasets lead to overly complex models: An explanation and a solution. In Agrawal, R., Stolorz, P., & Piatetsky-Shapiro, G. (Eds.),
Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pp. 294-298, Menlo Park, CA. AAAI Press.

Oates, T., & Jensen, D. (1999).  Toward a theoretical understanding of why and when decision tree pruning algorithms fail. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pp. 372–378, Menlo Park, CA/Cambridge, MA. AAAI Press/MIT Press Oliver, J. J., & Hand, D. J. (1995). On pruning and averaging decision trees. In Prieditis, A.,
& Russell, S. (Eds.), Proceedings of the Twelfth International Conference on Machine Learning, pp. 430–437, San Francisco, CA. Morgan Kaufmann.

Pagallo, G., & Haussler, D. (1990). Boolean feature discovery in empirical learning. Machine Learning, 5 (1), 71-99.

Pereira, F., & Singer, Y. (1999). An efficient extension to mixture techniques for prediction and decision trees. Machine Learning, 36 (3), 183–199.

Quinlan, J. R. (1986). Induction of decision trees. Machine Learning, 1, 81–106 Quinlan, J. R. (1987). Simplifying decision trees. International Journal of Man-Machine Studies, 27 (3), 221–248.

Quinlan, J. R. (1993).  C4.5: Programs for Machine Learning.  Morgan Kaufmann, San Mateo, CA.

Slud, E. V. (1977). Distribution inequalities for the binomial law. The Annals of Probability, 5(3), 404-412.