1. Barron, A.R., & Cover, T.M. (1991). Minimum complexity density estimation.IEEE Transactions on Information Theory, 37, 1034?1054.
2. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M.K. (1987). Occam's razor.Information Processing Letters, 24, 377?380.
3. Breiman, L., Friedman, J., Olshen, R., & Stone, C. (1984).Classification and Regression Trees. Pacific Grove, CA: Wadsworth & Brooks.
4. Buntine, W. (1990).A theory of learning classification rules. Doctoral dissertation, University of Technology, Sydney.
5. Cestnik, B., & Bratko, I. (1991). On estimating probabilities in tree pruning. In Y., Kodratoff (Ed.),Machine learning, EWSL-91. Berlin: Springer-Verlag.