Efficient case retrieval

Part of the Lecture Notes in Computer Science book series (LNCS, volume 886)


The major points to retain from the retrieval procedure are:
  • The similarity metric considers the foot-printed initial state and the goal interactions of the past cases.

  • Hash tables prune the set of candidate analogs as early as possible.

  • The matching is done incrementally until a “reasonable” similar set of past cases is found according to a previously set threshold for the partial match.


Goal Statement Problem Solver Hash Table Search Cost Partial Match 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Personalised recommendations