A comparison of incremental case-based reasoning and inductive learning

  • Barry Smyth
  • Pádraig Cunningham
Methods and Tools
Part of the Lecture Notes in Computer Science book series (LNCS, volume 984)


This paper focuses on problems where the reuse of old solutions seems appropriate but where conventional case-based reasoning (CBR) methodology is not adequate because a complete description of the new problem is not available to trigger case retrieval. We describe an information theoretic technique that solves this problem by producing focused questions to fill out the case description. This use of information theoretic techniques in CBR raises the question of whether a standard inductive learning approach would not solve this problem adequately. The main contribution of this paper is an evaluation of how this incremental case-based reasoning compares with a pure inductive learning approach to the same task.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cunningham P., Smyth, B.: A Comparison Of Model-Based And Incremental Case-Based Approaches To Electronic Fault Diagnosis. In D. Aha (Ed.) Case-Based Reasoning Workshop, Twelfth National Conference on Artificial Intelligence. (1994)Google Scholar
  2. 2.
    Quinlan J.R.: Induction of Decision Trees. Machine Learning, 1 (1986) 81–106.Google Scholar
  3. 3.
    Fisher, D. H.: Knowledge Acquisition via Incremental Conceptual Clustering. Machine Learning, 2 (1987) 139–172.Google Scholar
  4. 4.
    Michalski R.S.: A Theory And Methodology Of Inductive Learning. In R.S. Michalski, J.G. Carbonnell, & T.M. Mitchell (Eds.), Machine Learning An Artificial Intelligence Approach. Morgan Kaufmann. (1983)Google Scholar
  5. 5.
    Cunningham P., Brady M.: Qualitative Reasoning In Electronic Fault Diagnosis. In J. McDermott (Ed.), Tenth International Joint Conference on Artificial Intelligence. (1987) 443–445.Google Scholar
  6. 6.
    Cunningham P.: Knowledge Representation in Electronic Fault Diagnosis, Ph. D. Thesis, Department of Computer Science, Dublin University, Trinity College, Ireland. (1988)Google Scholar
  7. 7.
    Quinlan J.R.: Learning Efficient Classification Procedures and their Application to Chess End-Games. In R.S. Michalski, J.G. Carbonnell, & T.M. Mitchell (Eds.), Machine Learning An Artificial Intelligence Approach. Morgan Kaufmann. (1983)Google Scholar
  8. 8.
    Wess, S., Althoff, K-D., and Derwand, G: Using k-d Trees to Improve the Retrieval Step in case-Based Reasoning. In S. Wess, K-D Althoff, M. Richter (Eds.) Topics in Case-Based Reasoning. Springer-Verlag (1994) 167–181Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Barry Smyth
    • 1
  • Pádraig Cunningham
    • 2
  1. 1.Hitachi Dublin LaboratoryTrinity CollegeDublin 2Ireland
  2. 2.Department of Computer ScienceTrinity CollegeDublin 2Ireland

Personalised recommendations