Chapter

Advances in Case-Based Reasoning

Volume 1898 of the series Lecture Notes in Computer Science pp 517-528

Date:

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

  • Steve ScottAffiliated withSchool of Computing and Mathematics, University of Huddersfield
  • , Hugh OsborneAffiliated withSchool of Computing and Mathematics, University of Huddersfield
  • , Ron SimpsonAffiliated withSchool of Computing and Mathematics, University of Huddersfield

* Final gross prices may vary according to local VAT.

Get Access

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.