Time plays a key role in describing stories and cases. In the last decades, great efforts have been done to develop Case-Based Reasoning (CBR) systems that can cope with the temporal dimension. Despite this kind of system finds it difficult to maintain their case-base, little attention has been paid to maintain temporal case-bases. Case-Base Maintenance (CBM) algorithms are useful tools to build efficient and reliable CBR systems. In this work, we propose the extension of different CBM approaches to deal with this problem. Five temporal CBM algorithms are proposed (t-CNN, t-RENN, t-DROP1, t-ICF and t-RC-FP). These algorithms make the maintenance of case-bases possible when cases are temporal event sequences.
展开▼
