Dissemin is shutting down on January 1st, 2025

Published in

Elsevier, Knowledge-Based Systems, 2-3(13), p. 159-165

DOI: 10.1016/s0950-7051(00)00057-5

Research and Development in Intelligent Systems XVI, p. 191-203

DOI: 10.1007/978-1-4471-0745-3_13

Links

Tools

Export citation

Search in Google Scholar

Structured Cases in Case-Based Reasoning - Re-using and Adapting Cases for Time-tabling Problems

Journal article published in 2000 by Edmund K. Burke, Bart L. MacCarthy, Sanja Petrovic, Rong Qu ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Red circle
Postprint: archiving forbidden
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

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.