OpenAIR OpenAIR
 
 

OpenAIR @ RGU >
Design and Technology >
Computing >
Conference publications (Computing) >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10059/64
This item has been viewed 4 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
ictai2000_jarmulak1.pdf170.32 kBAdobe PDFView/Open
Title: Self-optimising CBR retrieval
Authors: Jarmulak, Jacek
Craw, Susan
Rowe, Ray
Keywords: Case-based reasoning
Issue Date: Nov-2000
Publisher: IEEE
Citation: JARMULAK, J., CRAW, S. and ROWE, R. 2000. Self-optimising CBR retrieval. In: Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence. 13-15 November 2000. Vancouver, Canada. pp.376-383.
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 effortmay 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 casebase. 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.
ISBN: 0769509096
Appears in Collections:Conference publications (Computing)

All items in OpenAIR are protected by copyright, with all rights reserved.

 

 
   Disclaimer | Freedom of Information | Privacy Statement |Copyright ©2012 Robert Gordon University, Schoolhill, Aberdeen, AB10 1FR, Scotland, UK: a Scottish charity, registration No. SCO13781