Structured cases in case-based reasoning: re-using and adapting cases for time-tabling problems

Burke, Edmund, MacCarthy, Bart L., Petrovic, Sanja and Qu, Rong (2000) Structured cases in case-based reasoning: re-using and adapting cases for time-tabling problems. Knowledge-Based Systems, 13 (2-3). pp. 159-165.

Full text not available from this repository.

Abstract

In this paper, we present a case-based reasoning (CBR) approach solving educational time-tabling problems. Following the basic idea behind CBR, the solutions of previously solved problems are employed to aid finding the solutions for new problems. A list of feature-value pairs is insufficient to represent all the necessary information. We show that attribute graphs can represent more information and thus can help to retrieve re-usable cases that have similar structures to the new problems. The case base is organised as a decision tree to store the attribute graphs of solved problems hierarchically. An example is given to illustrate the retrieval, re-use and adaptation of structured cases. The results from our experiments show the effectiveness of the retrieval and adaptation in the proposed method.

Item Type: Article
RIS ID: https://nottingham-repository.worktribe.com/output/1023625
Keywords: case-based reasoning; time-tabling problems; attribute graphs
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Qu, Rong
Date Deposited: 15 Dec 2005
Last Modified: 04 May 2020 20:32
URI: https://eprints.nottingham.ac.uk/id/eprint/345

Actions (Archive Staff Only)

Edit View Edit View