Compositional Instance-Based Acquisition of Preference Predicates

which PQ(x, y). For example, each time a learning apKnowledge to guide search can be represented as a preference predicate PQ(x, y) expressing that state x is preferable to state y. Interactions by a learning apprentice with a human expert provide an opportunity to acquire exemplars consisting of pairs that satisfy PQ. CIBL (compositional instancebased learning) is a strategy for learning preference predicates that permits multiple exemplars to be composed, directly exploiting the transitivity of PQ. An empirical evaluation with artificial data showed that CIBL is consistently more accurate than an instance-based learning strategy unable to compose exemplars. Moreover, CIBL outperforms decision tree induction when the evaluation function Q underlying PQ contains one or more extrema or a severe discontinuity.

[1]  David Aha A study of instance-based algorithms for supervised learning tasks: mathematica:l , 1990 .

[2]  Jaime G. Carbonell,et al.  Derivational analogy: a theory of reconstructive problem solving and expertise acquisition , 1993 .

[3]  Janet L. Kolodner,et al.  Retrieval and organizational strategies in conceptual memory: a computer model , 1980 .

[4]  Kristian J. Hammond,et al.  Case-based planning: an integrated theory of planning, learning and memory , 1986 .

[5]  Tom M. Mitchell,et al.  LEAP: A Learning Apprentice for VLSI Design , 1985, IJCAI.

[6]  Karl Branting,et al.  Integrating rules and precedents for classification and explanation: automating legal analysis , 1990 .

[7]  Michael Redmond,et al.  Distributed Cases for Case-Based Reasoning: Facilitating Use of Multiple Cases , 1990, AAAI.

[8]  J. Ross Quinlan,et al.  Learning Efficient Classification Procedures and Their Application to Chess End Games , 1983 .

[9]  J. P. Callan Adaptive Case-Based Reasoning , 1991 .

[10]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[11]  David W. Aha,et al.  Incremental, Instance-Based Learning of Independent and Graded Concept Descriptions , 1989, ML.

[12]  David W. Aha,et al.  Generalizing from Case studies: A Case Study , 1992, ML.

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

[14]  Paul E. Utgoff,et al.  Two Kinds of Training Information For Evaluation Function Learning , 1991, AAAI.

[15]  David L. Waltz,et al.  Toward memory-based reasoning , 1986, CACM.

[16]  Ray Bareiss,et al.  Concept Learning and Heuristic Classification in WeakTtheory Domains , 1990, Artif. Intell..

[17]  Karl Branting,et al.  Rules and Precedents as Complementary Warrants , 1991, AAAI.