Feature Discovery for Inductive Concept Learning

This paper describes Zenith, a discovery system that performs constructive induction. The system is able to generate and extend new features for concept learning using agenda-based heuris- tic search. The search is guided by feature worth (a composite measure of discriminability and cost). Zenith is distinguished from existing constructive induction systems by its interaction with a performance system, and its ability to extend its knowledge base by creating new domain classes. Zenith is able to discover known useful features for the Othello board game.

[1]  Christopher J. Matheus,et al.  Adding Domain Knowledge to SBL Through Feature Construction , 1990, AAAI.

[2]  Steven Minton,et al.  Quantitative Results Concerning the Utility of Explanation-based Learning , 1988, Artif. Intell..

[3]  J. Shavlik,et al.  Re nement of Approximate Domain Theories byKnowledge-Based Neural Networks , 1990 .

[4]  James P. Callan Knowledge-Based Feature Generation , 1989, ML.

[5]  Sharad Saxena Evaluating alternative Instance Representations , 1989, ML.

[6]  Shaul Markovitch,et al.  Learning Novel Domains Through Curiosity and Conjecture , 1989, IJCAI.

[7]  Jack Mostow,et al.  Discovering Admissible Heuristics by Abstracting and Optimizing: A Transformational Approach , 1989, IJCAI.

[8]  Larry A. Rendell,et al.  Constructive Induction On Decision Trees , 1989, IJCAI.

[9]  Giulia Pagallo,et al.  Learning DNF by Decision Trees , 1989, IJCAI.

[10]  Herbert A. Simon,et al.  Rule Creation and Rule Learning Through Environmental Exploration , 1989, IJCAI.

[11]  George Drastal,et al.  Induction in an Abstraction Space: A Form of Constructive Induction , 1989, IJCAI.

[12]  Prasad Tadepalli,et al.  Lazy ExplanationBased Learning: A Solution to the Intractable Theory Problem , 1989, IJCAI.

[13]  Douglas H. Fisher,et al.  An Empirical Comparison of ID3 and Back-propagation , 1989, IJCAI.

[14]  Raymond J. Mooney,et al.  An Experimental Comparison of Symbolic and Connectionist Learning Algorithms , 1989, IJCAI.

[15]  P. Utgoff,et al.  Representation Problems in Machine Learnin: A Proposal , 1989 .

[16]  T. Ash,et al.  Dynamic node creation in backpropagation networks , 1989, International 1989 Joint Conference on Neural Networks.

[17]  Sanjoy Mahajan,et al.  A Pattern Classification Approach to Evaluation Function Learning , 1988, Artif. Intell..

[18]  Stephen Muggleton,et al.  Machine Invention of First Order Predicates by Inverting Resolution , 1988, ML.

[19]  O. G. Selfridge,et al.  Pandemonium: a paradigm for learning , 1988 .

[20]  J. C. Schlimmer,et al.  Concept acquisition through representational adjustment , 1987 .

[21]  Richard M. Keller,et al.  Concept Learning in Context , 1987 .

[22]  Paul E. Utgoff,et al.  Learning a Preference Predicate , 1987 .

[23]  John H. Holland,et al.  Escaping brittleness: the possibilities of general-purpose learning algorithms applied to parallel rule-based systems , 1995 .

[24]  G. Collins,et al.  Transcending inductive category formation in learning , 1986, Behavioral and Brain Sciences.

[25]  이종원,et al.  Explanation - Based Generalization 의 문제점 및 이의 해결방안 , 1986 .

[26]  Douglas H. Fisher,et al.  A Case Study of Incremental Concept Induction , 1986, AAAI.

[27]  P. Ut Goff,et al.  Machine learning of inductive bias , 1986 .

[28]  Paul E. Utgoff,et al.  Shift of bias for inductive concept learning , 1984 .

[29]  Ryszard S. Michalski,et al.  A Theory and Methodology of Inductive Learning , 1983, Artificial Intelligence.

[30]  Douglas B. Lenat,et al.  The Role of Heuristics in Learning by Discovery: Three Case Studies , 1983 .

[31]  Thomas G. Dietterich,et al.  A Comparative Review of Selected Methods for Learning from Examples , 1983 .

[32]  Paul S. Rosenbloom,et al.  A World-Championship-Level Othello Program , 1982, Artif. Intell..

[33]  Tom M. Mitchell,et al.  Acquisition of Appropriate Bias for Inductive Concept Learning , 1982, AAAI.

[34]  Berliner,et al.  Search vs. knowledge : an analysis from the domain of games , 1981 .

[35]  Tom Michael Mitchell Version spaces: an approach to concept learning. , 1979 .

[36]  Tom M. Mitchell,et al.  Version Spaces: A Candidate Elimination Approach to Rule Learning , 1977, IJCAI.

[37]  Arthur L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..