Showing papers by "Rong Qu published in 2000"
TL;DR: It is shown that attribute graphs can represent more information and thus can help to retrieve re-usable cases that have similar structures to the new problems in case of educational time-tabling problems.
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.
82 citations
01 Jan 2000
TL;DR: It is shown that attribute graphs can be used to represent information such as the relations between events and thus can help to retrieve re-usable cases that have similar structures to the new problems.
Abstract: In this paper, we present a case-based reasoning (CBR) approach for solving educational time-tabling problems. Following the basic idea behind CBR, the timetables from previously solved problems are employed to aid in the generation of solutions for new time-tabling problems. A list of feature-value pairs is insufficient to represent all the necessary information. We show that attribute graphs can be used to represent information such as the relations between events 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 that stores the attribute graphs of previously solved time-tabling problems hierarchically. A new problem is classified to a node in the tree and all the cases stored below that node are retrieved for re-use. 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.
4 citations