1Oates T, Jemen D. The effects of training set sizes on decision tree[A]. Proc of the 14th Int'l Conf on Machine Learning[C]. Nashville: Morgan Kaufman, 1997. 254-262.
2Breslow L A, A_ha D W. Simplifying decision trees: a survey[J]. Knowledge Engineering Review, 1997. 12( 1 ) : 1-40.
3Breiman L, Friedman J, Olshen R A, et al. Classification and regression trees[ M]. Belmont: Wadsworth, 1984. 1-358.
4Nobel A. Analysis of a complexity based pruning scheme for classification trees [ J ]. IEEE Transactions on Information Theory, 2002, 48 (8) : 2 362-2 368.
5Malerba D, Semeraro G, Esposito F. Choosing the best pruned decision tree: a matter of bias [A]. Proc 5th Italian Workshop on Machine Learning[C]. Parma: University of Parma, 1994. 33-37.
6Quinlan J R. Simplifying decision trees [ J]. International Journal of Man-Machine Studies, 1987, 27 (3) : 221-234.
7Elomaa T, Kaafiainen M. An analysis of reduced error pruning[J]. Journal of Artificial Intelligence Research, 2001, 15 :163-187.
8Niblett T, Bratko I. Learning decision rules in noisy domains[A]. Proceedings of Expert Systems 86 [ C]. Cambridge:Cambridge Uninversity Press, 1986. 25-34.
9Cestnik B, Bratko I. On estimating probabilities in tree pruning[ A]. Proc of European Working Sessions on Learning[ C ].Porto: Springer-Verlag, 1991. 138-150.
