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

Burke, Edmund; MacCarthy, Bart L.; Petrovic, Sanja; Qu, Rong

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.

Citation

Burke, E., MacCarthy, B. L., Petrovic, S., & Qu, R. (2000). Structured cases in case-based reasoning: re-using and adapting cases for time-tabling problems. Knowledge-Based Systems, 13(2-3),

• Journal Article Type: Article
• Publication Date: Jan 1, 2000
• Deposit Date: Dec 15, 2005
• Publicly Available Date: Oct 9, 2007
• Journal: Knowledge-Based Systems
• Print ISSN: 0950-7051
• Publisher: Elsevier
• Peer Reviewed: Peer Reviewed
• Volume: 13
• Issue: 2-3
• Keywords: case-based reasoning; time-tabling problems; attribute graphs
• Public URL: https://nottingham-repository.worktribe.com/output/1023625