References

1

Briand, L., Basili, V., and Thomas, W. M., ``A Pattern Recognition Approach for Software Engineering Data Analysis'', IEEE Transactions on Software Engineering, Vol. 18, No. 11, pp. 931 - 942.

2

Clark, P. and Niblett, T., ``The CN2 Induction Algorithm'', Machine Learning, Vol. 3, No. 4, pp. 261 - 283.

3

Fisher, D., ``Machine Learning'', Unpublished Manuscript.

4

Michalski, R., ``On the Quasi-minimal Solution of the General Covering Problem'', Proceedings of the Fifth International Symposium on Information Processing, pp. 125 - 128.

5

Murphy, P. and Pazzani, M. J., ``Exploring the Decision Forest: An Empirical Investigation of Occam's Razor in Decision Tree Induction'', Journal of Artificial Intelligence Research, Vol. 1, pp. 257 - 275.

6

Pagallo, G. and Haussler, D., ``Boolean Feature Discovery in Empirical Learning'', Machine Learning, Vol. 5, No. 1, pp. 71 - 99.

7

Quinlan, J., ``Simplifying Decision Trees'', International Journal of Man-Machine Studies, Vol. 27, pp. 221 - 234.

8

Quinlan, J., ``C4.5: Programs for Machine Learning'', San Mateo, CA: Morgan Kaufmann, 1993

9

Rivest, R., ``Learning Decision Trees'', Machine Learning, Vol. 2, pp. 229 - 246, 1987.

10

Segal, R. and Etzioni, O., ``Learning Decision Lists Using Homogeneous Rules'', Proceedings of AAAI-94, pp. 619 - 625.

11

Thrun, S. et al., ``The MONK's Problems -- A Performance Comparison of Different Learning Algorithms'', Technical Report CS-CMU-91-197, Carnegie Mellon University.