Knowledge-based feature discovery for evaluation functions

Computational Intelligence

Volumn 12, Issue 1, 1996, Pages 42-64

  Fawcett, Tom E ^a  

^a VERIZON   (United States)

Author keywords

Constructive induction; Evaluation functions; Feature discovery; Games; Learning

Indexed keywords

FUNCTION EVALUATION; GAME THEORY; LEARNING SYSTEMS; PROBLEM SOLVING;

CONSTRUCTIVE INDUCTION; KNOWLEDGE BASED FEATURE DISCOVERY;

KNOWLEDGE BASED SYSTEMS;

EID: 0030087080     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1467-8640.1996.tb00252.x     Document Type: Article

References (39)

1. BERLINER, H. J. 1980. Backgammon computer program beats world champion. Artificial Intelligence, 14:205-220.
2. CALLAN, J. P., and P. E. UTGOFF. 1991 a. Construction induction on domain knowledge. In Proceedings of the Ninth National Conference on Artificial Intelligence. MIT Press, Anaheim, CA, pp. 614-619.
3. CALLAN, J. P. 1993. Knowledge-based feature generation for inductive learning. Ph.D. dissertation, University of Massachusetts, Amherst, MA.
4. DE JONG, K. A., and A. C. SCHULTZ. 1988. Using experience-based learning in game playing. In Proceedings of the Fifth International Conference on Machine Learning. Morgan Kaufmann, Ann Arbor, MI, pp. 284-290.
5. DRASTAL, G., G. CZAKO, and S. RAATZ. 1989. Induction in an abstraction space: a form of constructive induction. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Morgan Kaufmann, Detroit, Michigan, pp. 708-712.
6. FAWCETT, T. E., and P. E. UTGOFF. 1991. A hybrid method for feature generation. In Proceedings of the Eighth International Workshop on Machine Learning. Morgan Kaufmann, Evanston, IL, pp. 137-141.
7. FAWCETT, T. E., and P. E. UTGOFF. 1992. Automatic feature generation for problem solving systems. In Proceedings of the Ninth International Conference on Machine Learning, Morgan Kaufmann, San Mateo, CA, pp. 144-153.
8. FAWCETT, T. E. 1993. Feature discovery for problem solving systems. Ph.D. dissertation, University of Massachusetts, Amherst, MA. Also available as Technical Report 93-49 from the University of Massachusetts. Available electronically via ftp://ftp.cs.umass.edu/pub/techrept/techreport/1993/UM-CS-1993-049.ps.
9. PREY, P. W. 1986. Algorithmic strategies for improving the performance of game-playing programs. In Evolution, games and learning. North Holland, New York, NY, pp. 355-365.
10. JACOBS, R. A. 1990. Task decomposition through competition in a modular connectionist architecture. Ph.D. dissertation, University of Massachusetts, Amherst, MA. Also COINS Technical Report 90-44.
11. KIERULF, A. 1989. New concepts in computer Othello: corner value, edge avoidance, access, and parity. In Heuristic programming in artificial intelligence: the first computer olympiad. Edited by D. N. L. Levy and D. F. Beal. Ellis Horwood Ltd., Chichester, UK.
12. KIERULF, A. 1990. Smart game board: a workbench for game-playing programs, with go and Othello as case studies. Ph.D. dissertation, Swiss Federal Institute of Technology, Zürich.
13. KIRA, K., and L. RENDELL. 1992. A practical approach to feature selection. In Proceedings of the Ninth International Conference on Machine Learning. Morgan Kaufmann, San Mateo, CA, pp. 249-256.
14. KITTLER, J. 1986. Feature selection and extraction. In Handbook of pattern recognition and image processing. Academic Press, New York, pp. 59-83.
15. LEE, K. F., and S. MAHAJAN. 1988. A pattern classification approach to evaluation function learning. Artificial Intelligence, 36(1):1-25.
16. MATHEUS, C. J. 1990. Feature construction: an analytic framework and an application to decision trees. Ph.D. dissertation. University of Illinois, Urbana-Champaign, IL. Also Report No. UIUCDCS-R-89-1559 and UILU-ENG-89-1740.
17. MICHALSKI, R. S. 1983. A theory and methodology of inductive learning. In Machine learning: an artificial intelligence approach. Morgan Kaufmann, San Mateo, CA, pp. 83-134.
18. MINTON, S. 1988. Quantitative results concerning the utility of explanation-based learning. In Proceedings of the Seventh National Conference on Artificial Intelligence. Morgan Kaufmann, St. Paul, MN, pp. 564-569.
19. MITCHELL, D. 1984. Using features to evaluate positions in experts' and novices' Othello games. Master's thesis, Department of Psychology, Northwestern University, Evanston, IL.
20. MITCHELL, T., R. KELLER, and S. KEDAR-CABELLI. 1986. Explanation-based generalization: a unifying view. Machine Learning, 1(1):47-80.
21. PUGET. J. F. 1988. Learning invariants from explanations. In Proceedings of the Fifth International Conference on Machine Learning. Morgan Kaufmann, Ann Arbor, MI. pp. 200-204.
22. QUINLAN, J. R. 1993. C4.5: programs for machine learning. Morgan Kaufmann.
23. RENDELL, L. 1985. Substantial constructive induction using layered information compression: tractable feature formation in search. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Vol. 1. Morgan Kaufmann, Los Angeles. CA, pp. 650-658.
24. ROSENBLOOM, P. 1982. A world-championship-level Othello program. Artificial Intelligence, 19:279-320.
25. SACERDOTI, E. D. 1974. Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5(2):115-135.
26. SAMUEL. A. 1959. Some studies in machine learning using the game of checkers. IBM Journal of Research and Development, 3(3):211-229.
27. SAMUEL, A. 1967. Some studies in machine learning using the game of checkers II: recent progress. IBM Journal of Research and Development, 11(6):60 3-617.
28. SCHLIMMER, J. C. 1987. Incremental adjustment of representations. In Proceedings of the Fourth International Workshop on Machine Learning. Morgan Kaufmann. Irvine, CA. pp. 79-90.
29. SMITH, D., and M. GENESERETH. 1985. Ordering conjunctive queries. Artificial Intelligence, 26:171-215.
30. SUTTON. R. S. 1988. Learning to predict by the method of temporal differences. Machine Learning, 3(1):9-44.
31. TAN, M., and J. C. SCHLIMMER. 1991. Two case studies in cost-sensitive concept acquisition. In Proceedings of the Eighth National Conference on Artificial Intelligence. Morgan Kaufmann, pp. 854-860.
32. TESAURO, G. 1992. Temporal difference learning of backgammon strategy. In Proceedings of the Ninth International Conference on Machine Learning. Morgan Kaufmann, San Mateo, CA, pp. 451-457.
33. TESAURO, G., and T. J. SEJNOWSKI. 1989. A parallel network that learns to play backgammon. Artificial Intelligence 39:357-390.
34. UTGOFF, P. E. 1986. Machine learning of inductive bias. Kluwer, Hingham, MA. Reviewed in IEEE Expert, Fall 1986.
35. UTGOFF, P. E., and J. A. CLOUSE. 1991. Two kinds of training information for evaluation function learning. In Proceedings of the Ninth National Conference on Artificial Intelligence. MIT Press, Cambridge, MA, pp. 596-600.
36. UTGOFF, P. E.. and S. SAXENA. 1987. Learning a preference predicate. In Proceedings of the Fourth International Workshop on Machine Learning. Morgan Kaufmann, Irvine, CA, pp. 115-121.
37. WARREN, D. 1977. Implementing prolog - compiling predicate logic programs. Technical Reports 39 and 40, University of Edinburgh.
38. WARREN, D. 1981. Efficient processing of interactive relational database queries expressed in logic. In Seventh International Conference on Very Large Data Bases. IEEE, Cannes, France, pp. 272-281.
39. YOUNG, P. 1984. Recursive estimation and time-series analysis. Springer-Verlag, New York.