Selecting and Comparing Multiple Cases to Maximise Result Quality after Adaptation in Case-Based Adaptive Scheduling

  • Steve Scott
  • Hugh Osborne
  • Ron Simpson
Conference paper

DOI: 10.1007/3-540-44527-7_44

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1898)
Cite this paper as:
Scott S., Osborne H., Simpson R. (2000) Selecting and Comparing Multiple Cases to Maximise Result Quality after Adaptation in Case-Based Adaptive Scheduling. In: Blanzieri E., Portinale L. (eds) Advances in Case-Based Reasoning. EWCBR 2000. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence), vol 1898. Springer, Berlin, Heidelberg

Abstract

Recent Case-Based Reasoning research has begun to refocus attention on the problem of automatic adaptation of the retrieved case to give a fuller solution to the new problem. Such work has highlighted problems with the usefulness of similarity assessment of cases where adaptation is involved. As a response to this, methods of case selection are evolving that take adaptation into account. This current work looks more closely at the relationship between selection and adaptation. It considers experimental evidence considering adaptation of multiple cases for one problem. It argues that selection of the best case after adaptation will often make more efficient use of case knowledge than any attempt to pre-select a single case for adaptation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Steve Scott
    • 1
  • Hugh Osborne
    • 1
  • Ron Simpson
    • 1
  1. 1.School of Computing and MathematicsUniversity of HuddersfieldQueensgateUK

Personalised recommendations