(2000) Self-Optimising CBR Retrieval

J. Jarmulak, S. Craw, and R. Rowe, “Self-Optimising CBR Retrieval”, in: ICTAI-2000 Proceedings, Vancouver, Canada, IEEE Computer Society, 2000, pp. 376-383. (pdf)

Abstract: One reason why Case-Based Reasoning (CBR) has become popular is because it reduces development cost compared to rule-based expert systems. Still, the knowledge engineering effort may be demanding. In this paper we present a tool which helps to reduce the knowledge acquisition effort for building a typical CBR retrieval stage consisting of a decision-tree index and similarity measure. We use Genetic Algorithms to determine the relevance/importance of case features and to find optimal retrieval parameters. The optimisation is done using the data contained in the case-base. Because no (or little) other knowledge is needed this results in a self-optimising CBR retrieval. To illustrate this we present how the tool has been applied to optimise retrieval for a tablet formulation problem.

Leave a Reply

Your email address will not be published. Required fields are marked *

Reload the CAPTCHA code