Learning Efficient Classification Procedures and Their Application to Chess End Games
A series of experiments dealing with the discovery of efficient classification procedures from large numbers of examples is described, with a case study from the chess end game king-rook versus king-knight. After an outline of the inductive inference machinery used, the paper reports on trials leading to correct and very fast attribute-based rules for the relations lost 2-ply and lost 3-ply. On another tack, a model of the performance of an idealized induction system is developed and its somewhat surprising predictions compared with observed results. The paper ends with a description of preliminary work on the automatic specification of relevant attributes.
KeywordsDecision Tree Classification Rule Inductive Inference Induction System Game Tree
Unable to display preview. Download preview PDF.
- Bratko, I. and Mulec, P., “An experiment in automatic learning of diagnostic rules,” Informatika, 1981.Google Scholar
- Dietterich, T. G. and Michalski, R. S., “Learning and generalization of characteristic descriptions: evaluation criteria and comparative review of selected methods,” Sixth International Joint Conference on Artificial Intelligence, IJCAI, Tokyo, Japan, pp. 223–231, August 1979.Google Scholar
- Hayes-Roth, F. and McDermott, J., “Knowledge acquisition from structural descriptions,” Proceedings of the Fifth International Joint Conference on Artificial Intelligence, IJCAI, Cambridge, Mass., pp. 356–362, August 1977.Google Scholar
- Hunt, E. B., Marin, J. and Stone. P. T., Experiments in Induction, Academic Press, New York, 1966.Google Scholar
- Kopec, D. and Niblett, T, T., “How hard is the play of the King-Rook King-Knight ending?,” Advances in Computer Chess, volume 2, Clarke, M.R.B. (Ed.), Edinburgh University Press; 1980.Google Scholar
- Mitchell, T. M. M., “An analysis of generalization as a search problem,” Sixth International Joint Conference on Artificial Intelligence, Tokyo, Japan, August 1979.Google Scholar
- Quinlan, J. R., “Induction over large data bases”, Technical Report Report HPP-79–14, Heuristic Programming Project, Stanford University, 1979.Google Scholar
- Quinlan, J. R., “Discovering rules from large collections of examples: a case study,” Expert Systems in the Micro Electronic Age, Michie, D. (Ed.), Edinburgh University Press, Edinburgh, 1979.Google Scholar
- Quinlan, J. R., “Semi-autonomous acquisition of pattern-based knowledge,” Australian Computer Bulletin,April 1980, (also to appear in Michie, D. (ed.), Machine Intelligence 10,Halsted Press, 1982).Google Scholar
- Shapiro, A. and Niblett, T, T., “Automatic Induction of classification rules for a chess endgame,” Advances in Computer Chess, volume 3, Clarke, M.R.B. (Ed.), Edinburgh University Press, 1982.Google Scholar
- Vere, S. A., “Inductive learning of relational productions,” Pattern-Directed Inference Systems, Waterman, D. A. and Hayes-Roth, F. (Eds.), Academic Press, New York, 1978.Google Scholar